/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:52:36,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:52:36,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:52:36,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:52:36,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:52:36,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:52:36,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:52:36,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:52:36,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:52:36,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:52:36,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:52:36,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:52:36,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:52:36,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:52:36,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:52:36,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:52:36,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:52:36,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:52:36,613 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:52:36,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:52:36,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:52:36,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:52:36,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:52:36,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:52:36,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:52:36,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:52:36,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:52:36,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:52:36,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:52:36,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:52:36,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:52:36,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:52:36,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:52:36,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:52:36,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:52:36,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:52:36,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:52:36,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:52:36,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:52:36,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:52:36,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:52:36,631 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:52:36,644 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:52:36,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:52:36,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:52:36,646 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:52:36,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:52:36,646 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:52:36,646 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:52:36,647 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:52:36,647 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:52:36,647 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:52:36,647 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:52:36,647 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:52:36,647 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:52:36,648 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:52:36,648 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:52:36,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:52:36,648 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:52:36,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:52:36,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:52:36,649 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:52:36,649 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:52:36,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:52:36,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:52:36,649 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:52:36,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:52:36,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:52:36,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:52:36,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:52:36,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:52:36,821 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:52:36,834 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:52:36,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:52:36,840 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:52:36,840 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:52:36,841 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:52:36,934 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_0l7TxC/tmp/c0f690d543a74f61bb1b732d6211c4a8/FLAG27b2d72d1 [2020-07-01 12:52:37,263 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:52:37,264 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:52:37,264 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:52:37,271 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_0l7TxC/tmp/c0f690d543a74f61bb1b732d6211c4a8/FLAG27b2d72d1 [2020-07-01 12:52:37,681 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_0l7TxC/tmp/c0f690d543a74f61bb1b732d6211c4a8 [2020-07-01 12:52:37,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:52:37,694 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:52:37,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:52:37,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:52:37,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:52:37,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:52:37" (1/1) ... [2020-07-01 12:52:37,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d732eac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:37, skipping insertion in model container [2020-07-01 12:52:37,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:52:37" (1/1) ... [2020-07-01 12:52:37,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:52:37,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:52:37,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:52:37,964 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:52:37,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:52:37,996 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:52:37,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:37 WrapperNode [2020-07-01 12:52:37,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:52:37,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:52:37,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:52:37,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:52:38,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:37" (1/1) ... [2020-07-01 12:52:38,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:37" (1/1) ... [2020-07-01 12:52:38,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:52:38,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:52:38,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:52:38,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:52:38,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:37" (1/1) ... [2020-07-01 12:52:38,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:37" (1/1) ... [2020-07-01 12:52:38,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:37" (1/1) ... [2020-07-01 12:52:38,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:37" (1/1) ... [2020-07-01 12:52:38,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:37" (1/1) ... [2020-07-01 12:52:38,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:37" (1/1) ... [2020-07-01 12:52:38,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:37" (1/1) ... [2020-07-01 12:52:38,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:52:38,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:52:38,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:52:38,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:52:38,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:37" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:52:38,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:52:38,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:52:38,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:52:38,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:52:38,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:52:38,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:52:38,419 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:52:38,419 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 12:52:38,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:52:38 BoogieIcfgContainer [2020-07-01 12:52:38,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:52:38,424 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:52:38,425 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:52:38,427 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:52:38,427 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:52:38" (1/1) ... [2020-07-01 12:52:38,442 INFO L313 BlockEncoder]: Initial Icfg 46 locations, 47 edges [2020-07-01 12:52:38,443 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:52:38,444 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:52:38,444 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:52:38,445 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:52:38,447 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:52:38,448 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:52:38,448 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:52:38,471 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:52:38,508 INFO L200 BlockEncoder]: SBE split 23 edges [2020-07-01 12:52:38,513 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:52:38,515 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:52:38,551 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding [2020-07-01 12:52:38,553 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:52:38,555 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:52:38,555 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:52:38,559 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-07-01 12:52:38,560 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:52:38,561 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:52:38,561 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:52:38,561 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:52:38,562 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:52:38,562 INFO L313 BlockEncoder]: Encoded RCFG 35 locations, 64 edges [2020-07-01 12:52:38,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:52:38 BasicIcfg [2020-07-01 12:52:38,563 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:52:38,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:52:38,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:52:38,568 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:52:38,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:52:37" (1/4) ... [2020-07-01 12:52:38,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68dff4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:52:38, skipping insertion in model container [2020-07-01 12:52:38,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:37" (2/4) ... [2020-07-01 12:52:38,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68dff4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:52:38, skipping insertion in model container [2020-07-01 12:52:38,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:52:38" (3/4) ... [2020-07-01 12:52:38,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68dff4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:52:38, skipping insertion in model container [2020-07-01 12:52:38,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:52:38" (4/4) ... [2020-07-01 12:52:38,572 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:52:38,583 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:52:38,591 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2020-07-01 12:52:38,605 INFO L251 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2020-07-01 12:52:38,630 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:52:38,630 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:52:38,630 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:52:38,630 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:52:38,630 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:52:38,630 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:52:38,631 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:52:38,631 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:52:38,646 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-01 12:52:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:52:38,652 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:52:38,653 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:52:38,653 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:52:38,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:38,659 INFO L82 PathProgramCache]: Analyzing trace with hash 125222, now seen corresponding path program 1 times [2020-07-01 12:52:38,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:38,670 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048588523] [2020-07-01 12:52:38,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:38,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048588523] [2020-07-01 12:52:38,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:52:38,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:52:38,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965603000] [2020-07-01 12:52:38,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:52:38,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:52:38,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:52:38,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:38,849 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-01 12:52:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:52:38,977 INFO L93 Difference]: Finished difference Result 68 states and 119 transitions. [2020-07-01 12:52:38,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:52:38,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:52:38,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:52:38,991 INFO L225 Difference]: With dead ends: 68 [2020-07-01 12:52:38,991 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 12:52:38,995 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 12:52:39,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-01 12:52:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 12:52:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 57 transitions. [2020-07-01 12:52:39,034 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 57 transitions. Word has length 3 [2020-07-01 12:52:39,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:52:39,034 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 57 transitions. [2020-07-01 12:52:39,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:52:39,035 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 57 transitions. [2020-07-01 12:52:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:52:39,035 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:52:39,035 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:52:39,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:52:39,037 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:52:39,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:39,038 INFO L82 PathProgramCache]: Analyzing trace with hash 125346, now seen corresponding path program 1 times [2020-07-01 12:52:39,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:39,038 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762776353] [2020-07-01 12:52:39,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:39,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:39,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762776353] [2020-07-01 12:52:39,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:52:39,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:52:39,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054212695] [2020-07-01 12:52:39,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:52:39,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:52:39,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:52:39,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,105 INFO L87 Difference]: Start difference. First operand 35 states and 57 transitions. Second operand 3 states. [2020-07-01 12:52:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:52:39,199 INFO L93 Difference]: Finished difference Result 35 states and 57 transitions. [2020-07-01 12:52:39,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:52:39,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:52:39,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:52:39,201 INFO L225 Difference]: With dead ends: 35 [2020-07-01 12:52:39,201 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:52:39,202 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:52:39,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 12:52:39,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:52:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2020-07-01 12:52:39,207 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 3 [2020-07-01 12:52:39,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:52:39,207 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 49 transitions. [2020-07-01 12:52:39,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:52:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 49 transitions. [2020-07-01 12:52:39,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:52:39,208 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:52:39,208 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:52:39,208 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:52:39,209 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:52:39,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:39,209 INFO L82 PathProgramCache]: Analyzing trace with hash 125348, now seen corresponding path program 1 times [2020-07-01 12:52:39,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:39,209 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627503787] [2020-07-01 12:52:39,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:39,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627503787] [2020-07-01 12:52:39,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:52:39,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:52:39,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009898435] [2020-07-01 12:52:39,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:52:39,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:52:39,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:52:39,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,236 INFO L87 Difference]: Start difference. First operand 31 states and 49 transitions. Second operand 3 states. [2020-07-01 12:52:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:52:39,313 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2020-07-01 12:52:39,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:52:39,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:52:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:52:39,314 INFO L225 Difference]: With dead ends: 35 [2020-07-01 12:52:39,315 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:52:39,315 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:52:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 12:52:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:52:39,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-01 12:52:39,320 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 3 [2020-07-01 12:52:39,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:52:39,320 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-01 12:52:39,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:52:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-01 12:52:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:52:39,321 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:52:39,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:52:39,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:52:39,321 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:52:39,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:39,322 INFO L82 PathProgramCache]: Analyzing trace with hash 125349, now seen corresponding path program 1 times [2020-07-01 12:52:39,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:39,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309037367] [2020-07-01 12:52:39,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:39,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:39,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309037367] [2020-07-01 12:52:39,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:52:39,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:52:39,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024036468] [2020-07-01 12:52:39,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:52:39,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:52:39,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:52:39,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,367 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 3 states. [2020-07-01 12:52:39,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:52:39,430 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2020-07-01 12:52:39,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:52:39,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:52:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:52:39,448 INFO L225 Difference]: With dead ends: 31 [2020-07-01 12:52:39,448 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:52:39,449 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:52:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:52:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:52:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2020-07-01 12:52:39,453 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 41 transitions. Word has length 3 [2020-07-01 12:52:39,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:52:39,453 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 41 transitions. [2020-07-01 12:52:39,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:52:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 41 transitions. [2020-07-01 12:52:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:52:39,453 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:52:39,454 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:52:39,454 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:52:39,454 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:52:39,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:39,454 INFO L82 PathProgramCache]: Analyzing trace with hash 3887234, now seen corresponding path program 1 times [2020-07-01 12:52:39,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:39,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523476449] [2020-07-01 12:52:39,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:39,482 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523476449] [2020-07-01 12:52:39,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:52:39,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:52:39,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632890021] [2020-07-01 12:52:39,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:52:39,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:52:39,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:52:39,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,484 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. Second operand 3 states. [2020-07-01 12:52:39,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:52:39,533 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2020-07-01 12:52:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:52:39,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:52:39,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:52:39,534 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:52:39,534 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:52:39,535 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:52:39,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:52:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:52:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2020-07-01 12:52:39,539 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 4 [2020-07-01 12:52:39,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:52:39,540 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 38 transitions. [2020-07-01 12:52:39,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:52:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2020-07-01 12:52:39,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:52:39,541 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:52:39,541 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:52:39,541 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:52:39,542 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:52:39,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:39,542 INFO L82 PathProgramCache]: Analyzing trace with hash 3887231, now seen corresponding path program 1 times [2020-07-01 12:52:39,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:39,542 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304303198] [2020-07-01 12:52:39,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:39,574 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304303198] [2020-07-01 12:52:39,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:52:39,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:52:39,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25070822] [2020-07-01 12:52:39,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:52:39,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:52:39,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:52:39,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,576 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand 3 states. [2020-07-01 12:52:39,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:52:39,654 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2020-07-01 12:52:39,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:52:39,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:52:39,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:52:39,655 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:52:39,655 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 12:52:39,656 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 12:52:39,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-01 12:52:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 12:52:39,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2020-07-01 12:52:39,659 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 4 [2020-07-01 12:52:39,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:52:39,659 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-07-01 12:52:39,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:52:39,660 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2020-07-01 12:52:39,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:52:39,660 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:52:39,660 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:52:39,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:52:39,661 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:52:39,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:39,661 INFO L82 PathProgramCache]: Analyzing trace with hash 3887233, now seen corresponding path program 1 times [2020-07-01 12:52:39,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:39,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241644572] [2020-07-01 12:52:39,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:39,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241644572] [2020-07-01 12:52:39,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:52:39,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:52:39,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411837385] [2020-07-01 12:52:39,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:52:39,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:52:39,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:52:39,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,706 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand 3 states. [2020-07-01 12:52:39,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:52:39,761 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2020-07-01 12:52:39,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:52:39,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:52:39,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:52:39,762 INFO L225 Difference]: With dead ends: 24 [2020-07-01 12:52:39,762 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 12:52:39,763 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 12:52:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-01 12:52:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:52:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2020-07-01 12:52:39,767 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 4 [2020-07-01 12:52:39,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:52:39,767 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-07-01 12:52:39,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:52:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2020-07-01 12:52:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:52:39,768 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:52:39,768 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:52:39,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:52:39,768 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:52:39,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:39,769 INFO L82 PathProgramCache]: Analyzing trace with hash 120505577, now seen corresponding path program 1 times [2020-07-01 12:52:39,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:39,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599232646] [2020-07-01 12:52:39,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:39,798 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599232646] [2020-07-01 12:52:39,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:52:39,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:52:39,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825314107] [2020-07-01 12:52:39,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:52:39,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:52:39,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:52:39,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,800 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand 3 states. [2020-07-01 12:52:39,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:52:39,839 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2020-07-01 12:52:39,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:52:39,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:52:39,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:52:39,840 INFO L225 Difference]: With dead ends: 21 [2020-07-01 12:52:39,840 INFO L226 Difference]: Without dead ends: 17 [2020-07-01 12:52:39,840 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-01 12:52:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-01 12:52:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-01 12:52:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-07-01 12:52:39,843 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 5 [2020-07-01 12:52:39,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:52:39,843 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-07-01 12:52:39,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:52:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-07-01 12:52:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:52:39,844 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:52:39,844 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:52:39,845 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:52:39,845 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:52:39,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:39,845 INFO L82 PathProgramCache]: Analyzing trace with hash 120505579, now seen corresponding path program 1 times [2020-07-01 12:52:39,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:39,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512894392] [2020-07-01 12:52:39,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:39,870 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512894392] [2020-07-01 12:52:39,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:52:39,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:52:39,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634169538] [2020-07-01 12:52:39,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:52:39,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:52:39,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:52:39,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,871 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 3 states. [2020-07-01 12:52:39,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:52:39,891 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-01 12:52:39,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:52:39,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:52:39,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:52:39,892 INFO L225 Difference]: With dead ends: 21 [2020-07-01 12:52:39,892 INFO L226 Difference]: Without dead ends: 17 [2020-07-01 12:52:39,893 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-01 12:52:39,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-01 12:52:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-01 12:52:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2020-07-01 12:52:39,896 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 5 [2020-07-01 12:52:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:52:39,896 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2020-07-01 12:52:39,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:52:39,896 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-01 12:52:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:52:39,897 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:52:39,897 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:52:39,897 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:52:39,898 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:52:39,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:39,898 INFO L82 PathProgramCache]: Analyzing trace with hash 120505580, now seen corresponding path program 1 times [2020-07-01 12:52:39,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:39,898 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687483813] [2020-07-01 12:52:39,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:39,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687483813] [2020-07-01 12:52:39,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:52:39,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:52:39,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021172890] [2020-07-01 12:52:39,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:52:39,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:52:39,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:52:39,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,931 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2020-07-01 12:52:39,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:52:39,960 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-01 12:52:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:52:39,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:52:39,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:52:39,962 INFO L225 Difference]: With dead ends: 17 [2020-07-01 12:52:39,962 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:52:39,962 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:52:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:52:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:52:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:52:39,963 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 12:52:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:52:39,963 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:52:39,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:52:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:52:39,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:52:39,964 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:52:39,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:52:40,004 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:52:40,004 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 12:52:40,004 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:52:40,005 INFO L264 CegarLoopResult]: At program point L13-3(lines 13 17) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_main_~y~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~z~0.base)) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= 0 ULTIMATE.start_main_~z~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~z~0.base)) (= 0 ULTIMATE.start_main_~y~0.offset) (= (select |#length| ULTIMATE.start_main_~x~0.base) 4) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_main_~y~0.base)) (= 0 ULTIMATE.start_main_~x~0.offset)) [2020-07-01 12:52:40,005 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-01 12:52:40,005 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:52:40,005 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:52:40,006 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:52:40,006 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:52:40,006 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:52:40,006 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:52:40,006 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:52:40,006 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:52:40,006 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:52:40,006 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:52:40,007 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:52:40,007 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:52:40,007 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:52:40,007 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 12:52:40,007 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:52:40,007 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 12:52:40,007 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 12:52:40,007 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:52:40,007 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:52:40,008 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 12:52:40,008 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:52:40,008 INFO L268 CegarLoopResult]: For program point L14-2(line 14) no Hoare annotation was computed. [2020-07-01 12:52:40,008 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:52:40,008 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 12:52:40,008 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:52:40,008 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:52:40,008 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:52:40,008 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:52:40,009 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:52:40,009 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:52:40,011 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:52:40,022 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,023 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,023 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,024 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:52:40,030 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,030 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,030 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,031 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:52:40,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:52:40 BasicIcfg [2020-07-01 12:52:40,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:52:40,034 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:52:40,034 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:52:40,038 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:52:40,039 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:52:40,039 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:52:37" (1/5) ... [2020-07-01 12:52:40,040 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@461aae3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:52:40, skipping insertion in model container [2020-07-01 12:52:40,040 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:52:40,040 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:37" (2/5) ... [2020-07-01 12:52:40,040 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@461aae3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:52:40, skipping insertion in model container [2020-07-01 12:52:40,040 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:52:40,041 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:52:38" (3/5) ... [2020-07-01 12:52:40,041 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@461aae3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:52:40, skipping insertion in model container [2020-07-01 12:52:40,041 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:52:40,041 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:52:38" (4/5) ... [2020-07-01 12:52:40,041 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@461aae3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:52:40, skipping insertion in model container [2020-07-01 12:52:40,041 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:52:40,042 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:52:40" (5/5) ... [2020-07-01 12:52:40,043 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:52:40,066 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:52:40,066 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:52:40,066 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:52:40,066 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:52:40,066 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:52:40,066 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:52:40,067 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:52:40,067 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:52:40,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2020-07-01 12:52:40,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 12:52:40,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:52:40,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:52:40,082 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:52:40,082 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:52:40,082 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:52:40,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2020-07-01 12:52:40,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 12:52:40,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:52:40,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:52:40,086 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:52:40,086 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:52:40,091 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue [95] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 12#L-1true [136] L-1-->L9: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~z~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~z~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_1, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~z~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~z~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6] 10#L9true [181] L9-->L10: Formula: (and (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_18|) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 14#L10true [182] L10-->L11: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_10) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_20|) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~y~0.base_13)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_28| v_ULTIMATE.start_main_~y~0.base_13))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 32#L11true [183] L11-->L13-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_12 4) (select |v_#length_29| v_ULTIMATE.start_main_~z~0.base_16)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_12) (= (store |v_#memory_int_23| v_ULTIMATE.start_main_~z~0.base_16 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~z~0.base_16) v_ULTIMATE.start_main_~z~0.offset_12 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_22|) (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~z~0.base_16))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_23|, #length=|v_#length_29|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_16, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_12, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_22|, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 29#L13-3true [2020-07-01 12:52:40,092 INFO L796 eck$LassoCheckResult]: Loop: 29#L13-3true [190] L13-3-->L14: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_14) (< 0 (select (select |v_#memory_int_30| v_ULTIMATE.start_main_~x~0.base_18) v_ULTIMATE.start_main_~x~0.offset_14)) (= 1 (select |v_#valid_45| v_ULTIMATE.start_main_~x~0.base_18)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_14 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_18))) InVars {#valid=|v_#valid_45|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_30|, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_18} OutVars{#valid=|v_#valid_45|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_30|, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_18, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 20#L14true [82] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_13| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 18#L14-1true [78] L14-1-->L14-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_15| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~y~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 17#L14-2true [187] L14-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem7_6| |v_ULTIMATE.start_main_#t~mem8_6|))) |v_#memory_int_24|) (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~x~0.base_17))) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_30|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, #memory_int] 22#L15true [86] L15-->L15-1: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~z~0.base_7)) (<= (+ v_ULTIMATE.start_main_~z~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~z~0.base_7)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~z~0.base_7) v_ULTIMATE.start_main_~z~0.offset_6))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_7, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_6, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 36#L15-1true [188] L15-1-->L16: Formula: (and (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~y~0.base_14 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~y~0.base_14) v_ULTIMATE.start_main_~y~0.offset_11 |v_ULTIMATE.start_main_#t~mem9_6|)) |v_#memory_int_26|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_11) (= 1 (select |v_#valid_43| v_ULTIMATE.start_main_~y~0.base_14)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_11 4) (select |v_#length_31| v_ULTIMATE.start_main_~y~0.base_14))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_14, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_11, #length=|v_#length_31|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_14, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_11, #length=|v_#length_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 5#L16true [62] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~z~0.offset_8 4) (select |v_#length_23| v_ULTIMATE.start_main_~z~0.base_10)) (<= 0 v_ULTIMATE.start_main_~z~0.offset_8) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~z~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem10_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~z~0.base_10) v_ULTIMATE.start_main_~z~0.offset_8))) InVars {ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_10, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 3#L16-1true [189] L16-1-->L13-3: Formula: (and (= (select |v_#valid_44| v_ULTIMATE.start_main_~z~0.base_17) 1) (<= (+ v_ULTIMATE.start_main_~z~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~z~0.base_17)) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~z~0.base_17 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~z~0.base_17) v_ULTIMATE.start_main_~z~0.offset_13 (+ (* |v_ULTIMATE.start_main_#t~mem10_6| (- 1)) (- 1)))) |v_#memory_int_28|) (<= 0 v_ULTIMATE.start_main_~z~0.offset_13)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_17, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_13, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_29|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_~z~0.base=v_ULTIMATE.start_main_~z~0.base_17, ULTIMATE.start_main_~z~0.offset=v_ULTIMATE.start_main_~z~0.offset_13, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, #memory_int] 29#L13-3true [2020-07-01 12:52:40,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:40,093 INFO L82 PathProgramCache]: Analyzing trace with hash 120594988, now seen corresponding path program 1 times [2020-07-01 12:52:40,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:40,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210290566] [2020-07-01 12:52:40,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:40,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:40,113 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210290566] [2020-07-01 12:52:40,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:52:40,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:52:40,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793448804] [2020-07-01 12:52:40,115 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:52:40,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:40,115 INFO L82 PathProgramCache]: Analyzing trace with hash 783402215, now seen corresponding path program 1 times [2020-07-01 12:52:40,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:40,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987259925] [2020-07-01 12:52:40,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:40,160 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:52:40,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:52:40,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:52:40,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:40,293 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-01 12:52:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:52:40,373 INFO L93 Difference]: Finished difference Result 35 states and 57 transitions. [2020-07-01 12:52:40,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:52:40,377 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:52:40,381 INFO L168 Benchmark]: Toolchain (without parser) took 2686.67 ms. Allocated memory was 649.6 MB in the beginning and 681.6 MB in the end (delta: 32.0 MB). Free memory was 561.7 MB in the beginning and 396.4 MB in the end (delta: 165.3 MB). Peak memory consumption was 197.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:52:40,381 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:52:40,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.73 ms. Allocated memory was 649.6 MB in the beginning and 681.6 MB in the end (delta: 32.0 MB). Free memory was 561.7 MB in the beginning and 644.3 MB in the end (delta: -82.7 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:52:40,383 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.56 ms. Allocated memory is still 681.6 MB. Free memory was 644.3 MB in the beginning and 642.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:52:40,383 INFO L168 Benchmark]: Boogie Preprocessor took 23.97 ms. Allocated memory is still 681.6 MB. Free memory was 642.1 MB in the beginning and 641.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:52:40,384 INFO L168 Benchmark]: RCFGBuilder took 363.03 ms. Allocated memory is still 681.6 MB. Free memory was 641.0 MB in the beginning and 615.6 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:52:40,384 INFO L168 Benchmark]: BlockEncodingV2 took 138.89 ms. Allocated memory is still 681.6 MB. Free memory was 615.6 MB in the beginning and 604.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:52:40,385 INFO L168 Benchmark]: TraceAbstraction took 1469.04 ms. Allocated memory is still 681.6 MB. Free memory was 603.7 MB in the beginning and 437.3 MB in the end (delta: 166.4 MB). Peak memory consumption was 166.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:52:40,385 INFO L168 Benchmark]: BuchiAutomizer took 344.59 ms. Allocated memory is still 681.6 MB. Free memory was 437.3 MB in the beginning and 396.4 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:52:40,389 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 46 locations, 47 edges - StatisticsResult: Encoded RCFG 35 locations, 64 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 302.73 ms. Allocated memory was 649.6 MB in the beginning and 681.6 MB in the end (delta: 32.0 MB). Free memory was 561.7 MB in the beginning and 644.3 MB in the end (delta: -82.7 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.56 ms. Allocated memory is still 681.6 MB. Free memory was 644.3 MB in the beginning and 642.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.97 ms. Allocated memory is still 681.6 MB. Free memory was 642.1 MB in the beginning and 641.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 363.03 ms. Allocated memory is still 681.6 MB. Free memory was 641.0 MB in the beginning and 615.6 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 138.89 ms. Allocated memory is still 681.6 MB. Free memory was 615.6 MB in the beginning and 604.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1469.04 ms. Allocated memory is still 681.6 MB. Free memory was 603.7 MB in the beginning and 437.3 MB in the end (delta: 166.4 MB). Peak memory consumption was 166.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 344.59 ms. Allocated memory is still 681.6 MB. Free memory was 437.3 MB in the beginning and 396.4 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant [2020-07-01 12:52:40,399 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,399 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,399 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,400 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:52:40,401 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,401 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,401 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,401 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((4 == unknown-#length-unknown[y] && 4 == unknown-#length-unknown[z]) && \valid[x] == 1) && 0 == z) && 1 == \valid[z]) && 0 == y) && unknown-#length-unknown[x] == 4) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[y]) && 0 == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 22 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.3s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 43 SDtfs, 314 SDslu, 6 SDs, 0 SdLazy, 302 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 43 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 375 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:52:34.390 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_0l7TxC/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:52:40.628 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check