./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/array16_alloca_original_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/array16_alloca_original_false-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b6c8e92f4d5413ae33bafe73b9024f19a73a1964 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:47:51,540 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:47:51,542 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:47:51,554 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:47:51,554 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:47:51,555 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:47:51,557 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:47:51,559 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:47:51,560 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:47:51,562 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:47:51,562 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:47:51,563 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:47:51,564 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:47:51,564 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:47:51,566 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:47:51,567 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:47:51,568 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:47:51,570 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:47:51,572 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:47:51,574 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:47:51,575 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:47:51,577 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:47:51,579 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:47:51,579 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:47:51,580 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:47:51,581 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:47:51,582 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:47:51,583 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:47:51,584 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:47:51,585 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:47:51,586 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:47:51,586 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:47:51,586 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:47:51,587 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:47:51,588 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:47:51,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:47:51,589 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:47:51,606 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:47:51,606 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:47:51,607 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:47:51,608 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:47:51,608 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:47:51,608 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:47:51,609 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:47:51,609 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:47:51,609 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:47:51,609 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:47:51,609 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:47:51,610 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:47:51,610 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:47:51,610 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:47:51,610 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:47:51,610 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:47:51,610 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:47:51,611 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:47:51,612 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:47:51,612 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:47:51,612 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:47:51,613 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:47:51,613 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:47:51,613 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:47:51,613 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:47:51,613 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:47:51,614 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:47:51,615 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:47:51,616 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:47:51,616 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6c8e92f4d5413ae33bafe73b9024f19a73a1964 [2019-01-14 02:47:51,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:47:51,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:47:51,679 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:47:51,681 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:47:51,682 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:47:51,683 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/array16_alloca_original_false-termination.c.i [2019-01-14 02:47:51,743 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cfb1631e/f5f73c948c70461a8800766c6dc6c89a/FLAG7cb4411e2 [2019-01-14 02:47:52,286 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:47:52,287 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/array16_alloca_original_false-termination.c.i [2019-01-14 02:47:52,297 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cfb1631e/f5f73c948c70461a8800766c6dc6c89a/FLAG7cb4411e2 [2019-01-14 02:47:52,579 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cfb1631e/f5f73c948c70461a8800766c6dc6c89a [2019-01-14 02:47:52,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:47:52,584 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:47:52,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:47:52,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:47:52,589 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:47:52,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:47:52" (1/1) ... [2019-01-14 02:47:52,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4998b6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:52, skipping insertion in model container [2019-01-14 02:47:52,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:47:52" (1/1) ... [2019-01-14 02:47:52,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:47:52,641 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:47:53,040 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:47:53,059 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:47:53,133 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:47:53,283 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:47:53,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:53 WrapperNode [2019-01-14 02:47:53,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:47:53,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:47:53,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:47:53,285 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:47:53,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:53" (1/1) ... [2019-01-14 02:47:53,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:53" (1/1) ... [2019-01-14 02:47:53,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:47:53,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:47:53,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:47:53,334 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:47:53,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:53" (1/1) ... [2019-01-14 02:47:53,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:53" (1/1) ... [2019-01-14 02:47:53,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:53" (1/1) ... [2019-01-14 02:47:53,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:53" (1/1) ... [2019-01-14 02:47:53,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:53" (1/1) ... [2019-01-14 02:47:53,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:53" (1/1) ... [2019-01-14 02:47:53,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:53" (1/1) ... [2019-01-14 02:47:53,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:47:53,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:47:53,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:47:53,361 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:47:53,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:47:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:47:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:47:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:47:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:47:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:47:53,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:47:53,795 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:47:53,795 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 02:47:53,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:47:53 BoogieIcfgContainer [2019-01-14 02:47:53,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:47:53,798 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:47:53,798 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:47:53,801 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:47:53,802 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:47:53,802 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:47:52" (1/3) ... [2019-01-14 02:47:53,803 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74478b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:47:53, skipping insertion in model container [2019-01-14 02:47:53,803 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:47:53,803 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:53" (2/3) ... [2019-01-14 02:47:53,804 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74478b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:47:53, skipping insertion in model container [2019-01-14 02:47:53,804 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:47:53,804 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:47:53" (3/3) ... [2019-01-14 02:47:53,806 INFO L375 chiAutomizerObserver]: Analyzing ICFG array16_alloca_original_false-termination.c.i [2019-01-14 02:47:53,865 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:47:53,866 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:47:53,866 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:47:53,866 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:47:53,867 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:47:53,867 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:47:53,867 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:47:53,867 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:47:53,867 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:47:53,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:47:53,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-14 02:47:53,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:53,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:53,908 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:47:53,908 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:47:53,908 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:47:53,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:47:53,910 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-14 02:47:53,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:53,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:53,911 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:47:53,911 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:47:53,918 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2019-01-14 02:47:53,918 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume 1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2);havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2019-01-14 02:47:53,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:53,925 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-01-14 02:47:53,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:53,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:53,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:53,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:53,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:54,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:54,051 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-01-14 02:47:54,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:54,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:54,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:54,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:54,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:54,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:54,087 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-01-14 02:47:54,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:54,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:54,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:54,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:54,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:54,262 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-14 02:47:54,619 WARN L181 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-01-14 02:47:54,797 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-01-14 02:47:54,872 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:47:54,873 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:47:54,874 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:47:54,874 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:47:54,874 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:47:54,874 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:47:54,874 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:47:54,874 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:47:54,875 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration1_Lasso [2019-01-14 02:47:54,875 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:47:54,876 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:47:54,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:54,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:54,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:54,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:54,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:55,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:55,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:55,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:55,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:55,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:55,208 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-14 02:47:55,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:55,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:55,938 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:47:55,944 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:47:55,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:55,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:55,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:55,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:55,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:55,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:55,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:55,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:55,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:55,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:55,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:55,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:55,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:55,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:55,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:55,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:55,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:55,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:55,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:55,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:55,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:55,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:55,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:55,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:55,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:55,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:55,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:55,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:55,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:55,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:55,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:55,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:55,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:55,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:55,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:55,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:55,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:55,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:55,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:55,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:55,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:55,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:55,982 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:55,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:55,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:55,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:55,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:55,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:55,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:55,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:55,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:55,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:56,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:56,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:56,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:56,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:56,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:56,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:56,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:56,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:56,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:56,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:56,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:56,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:56,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:56,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:56,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:56,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:56,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:56,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:56,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:56,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:56,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:56,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:56,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:56,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:56,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:56,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:56,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:56,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:56,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:56,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:56,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:56,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:56,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:56,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:56,128 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:47:56,160 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:47:56,160 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:47:56,162 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:47:56,164 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:47:56,164 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:47:56,165 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2019-01-14 02:47:56,197 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:47:56,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:47:56,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:56,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:56,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:56,649 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:47:56,650 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-01-14 02:47:56,720 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2019-01-14 02:47:56,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:47:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:47:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-01-14 02:47:56,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 02:47:56,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:56,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-14 02:47:56,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:56,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-14 02:47:56,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:56,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2019-01-14 02:47:56,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:56,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2019-01-14 02:47:56,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:47:56,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:47:56,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-01-14 02:47:56,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:47:56,736 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-14 02:47:56,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-01-14 02:47:56,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-14 02:47:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:47:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-01-14 02:47:56,759 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-14 02:47:56,759 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-14 02:47:56,759 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:47:56,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-01-14 02:47:56,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:56,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:56,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:56,761 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:47:56,761 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:47:56,761 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 113#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 114#L367 assume !(main_~length~0 < 1); 121#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 122#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 123#L370-3 assume !(main_~i~0 < main_~length~0); 117#L370-4 main_~j~0 := 0; 118#L378-2 [2019-01-14 02:47:56,762 INFO L796 eck$LassoCheckResult]: Loop: 118#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 120#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 118#L378-2 [2019-01-14 02:47:56,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:56,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-01-14 02:47:56,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:56,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:56,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:56,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:56,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:56,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:47:56,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:47:56,827 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:47:56,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:56,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-01-14 02:47:56,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:56,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:56,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:56,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:56,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:57,008 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 02:47:57,147 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-01-14 02:47:57,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:47:57,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:47:57,153 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-14 02:47:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:47:57,211 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-01-14 02:47:57,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:47:57,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-01-14 02:47:57,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:57,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-01-14 02:47:57,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:47:57,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:47:57,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-01-14 02:47:57,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:47:57,216 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-01-14 02:47:57,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-01-14 02:47:57,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-01-14 02:47:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:47:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-01-14 02:47:57,218 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:47:57,218 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:47:57,218 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:47:57,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-01-14 02:47:57,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:57,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:57,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:57,220 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:47:57,220 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:47:57,220 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 147#L367 assume !(main_~length~0 < 1); 154#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 155#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 156#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 148#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 149#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 157#L370-3 assume !(main_~i~0 < main_~length~0); 150#L370-4 main_~j~0 := 0; 151#L378-2 [2019-01-14 02:47:57,220 INFO L796 eck$LassoCheckResult]: Loop: 151#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 153#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 151#L378-2 [2019-01-14 02:47:57,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:57,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-01-14 02:47:57,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:57,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:57,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:57,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:57,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:57,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:57,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-01-14 02:47:57,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:57,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:57,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:57,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:57,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:57,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:57,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-01-14 02:47:57,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:57,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:57,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:57,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:47:57,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:57,472 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-01-14 02:47:57,687 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-01-14 02:47:58,013 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-01-14 02:47:58,023 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:47:58,023 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:47:58,023 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:47:58,023 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:47:58,023 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:47:58,023 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:47:58,024 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:47:58,024 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:47:58,024 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration3_Lasso [2019-01-14 02:47:58,024 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:47:58,024 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:47:58,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:58,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:58,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:58,365 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-01-14 02:47:58,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:58,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:58,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:58,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:58,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:58,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:58,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:58,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:58,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:59,131 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:47:59,131 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:47:59,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:59,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:59,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:59,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:59,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:59,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:59,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:59,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:59,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:59,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:59,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:59,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:59,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:59,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:59,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:59,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:59,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:59,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:59,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:59,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:59,143 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:47:59,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:59,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:59,145 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:47:59,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:59,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:59,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:59,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:59,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:59,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:59,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:59,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:59,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:59,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:59,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:59,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:59,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:59,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:59,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:59,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:59,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:59,212 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:47:59,251 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-14 02:47:59,252 INFO L444 ModelExtractionUtils]: 12 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:47:59,252 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:47:59,255 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:47:59,256 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:47:59,256 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 + 2 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 + 4 >= 0] [2019-01-14 02:47:59,304 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 02:47:59,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:59,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:59,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:47:59,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 02:47:59,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:47:59,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 02:47:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:59,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:59,683 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2019-01-14 02:47:59,683 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-01-14 02:47:59,977 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 24 states and 34 transitions. Complement of second has 10 states. [2019-01-14 02:47:59,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2019-01-14 02:47:59,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:47:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2019-01-14 02:47:59,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-14 02:47:59,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:59,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-14 02:47:59,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:59,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-14 02:47:59,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:59,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 34 transitions. [2019-01-14 02:47:59,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:59,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 34 transitions. [2019-01-14 02:47:59,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 02:47:59,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 02:47:59,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 34 transitions. [2019-01-14 02:47:59,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:47:59,985 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-01-14 02:47:59,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 34 transitions. [2019-01-14 02:47:59,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-01-14 02:47:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 02:47:59,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-01-14 02:47:59,988 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-01-14 02:47:59,989 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-01-14 02:47:59,989 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:47:59,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2019-01-14 02:47:59,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:59,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:59,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:59,990 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:47:59,990 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:47:59,991 INFO L794 eck$LassoCheckResult]: Stem: 284#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 278#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 279#L367 assume !(main_~length~0 < 1); 289#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 290#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 291#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 294#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 292#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 293#L370-3 assume !(main_~i~0 < main_~length~0); 295#L370-4 main_~j~0 := 0; 296#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 288#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 283#L378-2 [2019-01-14 02:47:59,991 INFO L796 eck$LassoCheckResult]: Loop: 283#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 285#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 283#L378-2 [2019-01-14 02:47:59,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:59,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-01-14 02:47:59,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:59,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:59,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:59,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:59,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:00,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:00,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-01-14 02:48:00,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:00,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:00,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:00,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:00,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:00,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:00,036 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-01-14 02:48:00,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:00,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:00,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:00,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:00,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:48:00,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:48:00,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:48:00,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:00,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:00,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:48:00,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 02:48:00,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-01-14 02:48:00,396 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-01-14 02:48:00,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:48:00,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:48:00,399 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-01-14 02:48:00,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:48:00,418 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-14 02:48:00,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:48:00,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2019-01-14 02:48:00,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:48:00,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 30 transitions. [2019-01-14 02:48:00,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:48:00,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 02:48:00,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2019-01-14 02:48:00,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:48:00,424 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-14 02:48:00,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2019-01-14 02:48:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-14 02:48:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 02:48:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2019-01-14 02:48:00,429 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-01-14 02:48:00,430 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-01-14 02:48:00,430 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:48:00,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2019-01-14 02:48:00,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:48:00,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:00,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:00,431 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:00,431 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:48:00,432 INFO L794 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 374#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 375#L367 assume !(main_~length~0 < 1); 383#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 384#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 385#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 388#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 392#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 389#L370-3 assume !(main_~i~0 < main_~length~0); 390#L370-4 main_~j~0 := 0; 391#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 382#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 380#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 381#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 387#L378-2 [2019-01-14 02:48:00,432 INFO L796 eck$LassoCheckResult]: Loop: 387#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 393#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 387#L378-2 [2019-01-14 02:48:00,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:00,432 INFO L82 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 2 times [2019-01-14 02:48:00,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:00,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:00,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:00,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:00,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:00,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:48:00,602 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:48:00,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:48:00,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:48:00,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:48:00,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:00,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:48:00,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-01-14 02:48:00,849 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:48:00,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:00,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-01-14 02:48:00,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:00,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:00,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:00,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 02:48:00,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-01-14 02:48:00,941 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 10 Second operand 10 states. [2019-01-14 02:48:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:48:01,065 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2019-01-14 02:48:01,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 02:48:01,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2019-01-14 02:48:01,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:48:01,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 19 states and 24 transitions. [2019-01-14 02:48:01,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:48:01,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:48:01,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2019-01-14 02:48:01,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:48:01,070 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-14 02:48:01,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2019-01-14 02:48:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-01-14 02:48:01,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 02:48:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-14 02:48:01,072 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-14 02:48:01,072 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-14 02:48:01,072 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:48:01,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-01-14 02:48:01,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:48:01,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:01,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:01,074 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:01,074 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:48:01,074 INFO L794 eck$LassoCheckResult]: Stem: 498#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 494#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 495#L367 assume !(main_~length~0 < 1); 500#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 501#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 502#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 506#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 503#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 504#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 492#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 493#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 507#L370-3 assume !(main_~i~0 < main_~length~0); 496#L370-4 main_~j~0 := 0; 497#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 499#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 505#L378-2 [2019-01-14 02:48:01,074 INFO L796 eck$LassoCheckResult]: Loop: 505#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 508#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 505#L378-2 [2019-01-14 02:48:01,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:01,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701287, now seen corresponding path program 2 times [2019-01-14 02:48:01,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:01,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:01,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:01,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:01,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:01,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:01,114 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-01-14 02:48:01,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:01,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:01,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:01,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:01,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:01,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:01,128 INFO L82 PathProgramCache]: Analyzing trace with hash -685994468, now seen corresponding path program 3 times [2019-01-14 02:48:01,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:01,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:01,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:01,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:01,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:01,398 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 02:48:01,568 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-01-14 02:48:01,841 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 102 [2019-01-14 02:48:02,321 WARN L181 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-01-14 02:48:02,323 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:48:02,324 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:48:02,324 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:48:02,324 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:48:02,324 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:48:02,324 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:02,325 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:48:02,325 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:48:02,325 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration6_Lasso [2019-01-14 02:48:02,325 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:48:02,325 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:48:02,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:02,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:02,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:02,600 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-14 02:48:02,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:02,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:02,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:02,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:02,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:02,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:02,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:02,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:02,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:03,171 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:48:03,171 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:48:03,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:03,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:03,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:03,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:03,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:03,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:03,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:03,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:03,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:03,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:03,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:03,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:03,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:03,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:03,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:03,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:03,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:03,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:03,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:03,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:03,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:03,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:03,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:03,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:03,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:03,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:03,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:03,183 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:48:03,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:03,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:03,185 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:48:03,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:03,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:03,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:03,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:03,188 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:48:03,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:03,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:03,190 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:48:03,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:03,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:03,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:03,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:03,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:03,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:03,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:03,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:03,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:03,217 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:48:03,232 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:48:03,233 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:48:03,233 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:48:03,234 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:48:03,234 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:48:03,234 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-01-14 02:48:03,296 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-01-14 02:48:03,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:03,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:03,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:03,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:03,380 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:48:03,381 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:48:03,393 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 27 transitions. Complement of second has 5 states. [2019-01-14 02:48:03,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:48:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:48:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-01-14 02:48:03,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 15 letters. Loop has 2 letters. [2019-01-14 02:48:03,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:03,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 17 letters. Loop has 2 letters. [2019-01-14 02:48:03,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:03,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2019-01-14 02:48:03,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:03,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2019-01-14 02:48:03,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:48:03,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 27 transitions. [2019-01-14 02:48:03,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 02:48:03,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:48:03,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-01-14 02:48:03,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:48:03,401 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-14 02:48:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-01-14 02:48:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-14 02:48:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 02:48:03,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-01-14 02:48:03,405 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-14 02:48:03,405 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-14 02:48:03,405 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:48:03,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2019-01-14 02:48:03,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:48:03,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:03,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:03,408 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:03,408 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:48:03,409 INFO L794 eck$LassoCheckResult]: Stem: 628#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 622#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 623#L367 assume !(main_~length~0 < 1); 634#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 635#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 636#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 624#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 625#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 637#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 638#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 642#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 640#L370-3 assume !(main_~i~0 < main_~length~0); 626#L370-4 main_~j~0 := 0; 627#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 641#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 639#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 633#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 629#L378-2 [2019-01-14 02:48:03,409 INFO L796 eck$LassoCheckResult]: Loop: 629#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 630#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 629#L378-2 [2019-01-14 02:48:03,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:03,409 INFO L82 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 3 times [2019-01-14 02:48:03,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:03,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:03,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:03,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:03,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:03,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:03,444 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2019-01-14 02:48:03,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:03,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:03,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:03,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:03,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:03,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:03,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684191, now seen corresponding path program 4 times [2019-01-14 02:48:03,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:03,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:03,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:03,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:03,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:03,640 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 02:48:04,126 WARN L181 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 119 [2019-01-14 02:48:04,589 WARN L181 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2019-01-14 02:48:04,592 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:48:04,592 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:48:04,592 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:48:04,592 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:48:04,592 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:48:04,592 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:04,593 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:48:04,593 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:48:04,593 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration7_Lasso [2019-01-14 02:48:04,593 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:48:04,593 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:48:04,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:04,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:04,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:04,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:04,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:04,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:04,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:04,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:04,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:04,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:04,786 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-01-14 02:48:04,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:05,460 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:48:05,460 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:48:05,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:05,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:05,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:05,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:05,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:05,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:05,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:05,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:05,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:05,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:05,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:05,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:05,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:05,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:05,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:05,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:05,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:05,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:05,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:05,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:05,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:05,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:05,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:05,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:05,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:05,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,482 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:48:05,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,483 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:48:05,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:05,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:05,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:05,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:05,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:05,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:05,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:05,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:05,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:05,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:05,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:05,507 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:48:05,517 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:48:05,518 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:48:05,518 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:48:05,519 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:48:05,519 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:48:05,519 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-01-14 02:48:05,610 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 02:48:05,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:05,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:05,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:05,702 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:48:05,702 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 02:48:05,719 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 25 states and 33 transitions. Complement of second has 5 states. [2019-01-14 02:48:05,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:48:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:48:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-14 02:48:05,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-01-14 02:48:05,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:05,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 19 letters. Loop has 2 letters. [2019-01-14 02:48:05,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:05,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 4 letters. [2019-01-14 02:48:05,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:05,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2019-01-14 02:48:05,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:48:05,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 33 transitions. [2019-01-14 02:48:05,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:48:05,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 02:48:05,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2019-01-14 02:48:05,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:48:05,723 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-14 02:48:05,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2019-01-14 02:48:05,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-14 02:48:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 02:48:05,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-01-14 02:48:05,728 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-14 02:48:05,728 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-14 02:48:05,729 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:48:05,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-01-14 02:48:05,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:48:05,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:05,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:05,732 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:05,732 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:48:05,733 INFO L794 eck$LassoCheckResult]: Stem: 768#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 762#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 763#L367 assume !(main_~length~0 < 1); 773#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 774#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 775#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 779#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 776#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 777#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 764#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 765#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 780#L370-3 assume !(main_~i~0 < main_~length~0); 766#L370-4 main_~j~0 := 0; 767#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 769#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 778#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 772#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 784#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 783#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 782#L378-2 [2019-01-14 02:48:05,733 INFO L796 eck$LassoCheckResult]: Loop: 782#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 781#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 782#L378-2 [2019-01-14 02:48:05,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:05,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684189, now seen corresponding path program 5 times [2019-01-14 02:48:05,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:05,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:05,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:05,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:05,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:06,118 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 6 [2019-01-14 02:48:06,434 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 15 [2019-01-14 02:48:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:48:06,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:48:06,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:48:06,780 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 02:48:06,842 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-01-14 02:48:06,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:48:06,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:07,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-14 02:48:07,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2019-01-14 02:48:07,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:07,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:48:07,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:48:07,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:5 [2019-01-14 02:48:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 02:48:07,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:48:07,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2019-01-14 02:48:07,161 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:48:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:07,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2019-01-14 02:48:07,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:07,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:07,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:07,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:07,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:07,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 02:48:07,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-01-14 02:48:07,265 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 12 Second operand 15 states. [2019-01-14 02:48:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:48:07,392 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-01-14 02:48:07,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 02:48:07,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2019-01-14 02:48:07,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:48:07,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 46 transitions. [2019-01-14 02:48:07,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-14 02:48:07,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-14 02:48:07,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2019-01-14 02:48:07,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:48:07,399 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-01-14 02:48:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2019-01-14 02:48:07,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-01-14 02:48:07,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 02:48:07,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2019-01-14 02:48:07,403 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-01-14 02:48:07,403 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-01-14 02:48:07,403 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:48:07,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2019-01-14 02:48:07,404 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:48:07,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:07,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:07,405 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:07,405 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:48:07,405 INFO L794 eck$LassoCheckResult]: Stem: 904#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 898#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 899#L367 assume !(main_~length~0 < 1); 910#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 911#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 912#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 900#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 901#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 918#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 919#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 913#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 914#L370-3 assume !(main_~i~0 < main_~length~0); 902#L370-4 main_~j~0 := 0; 903#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 921#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 922#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 925#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 927#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 923#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 924#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 915#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 916#L378-2 [2019-01-14 02:48:07,405 INFO L796 eck$LassoCheckResult]: Loop: 916#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 929#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 916#L378-2 [2019-01-14 02:48:07,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:07,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1144787610, now seen corresponding path program 6 times [2019-01-14 02:48:07,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:07,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:07,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:07,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:07,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:07,550 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:48:07,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:48:07,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:48:07,561 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 02:48:07,576 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-01-14 02:48:07,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:48:07,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:07,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-01-14 02:48:07,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2019-01-14 02:48:07,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:48:07,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:48:07,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:48:07,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-01-14 02:48:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:48:07,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:48:07,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2019-01-14 02:48:07,812 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:48:07,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:07,812 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2019-01-14 02:48:07,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:07,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:07,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:07,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:07,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:07,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 02:48:07,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-01-14 02:48:07,932 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. cyclomatic complexity: 15 Second operand 13 states. [2019-01-14 02:48:08,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:48:08,284 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2019-01-14 02:48:08,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 02:48:08,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 73 transitions. [2019-01-14 02:48:08,288 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-01-14 02:48:08,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 55 states and 67 transitions. [2019-01-14 02:48:08,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-01-14 02:48:08,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-01-14 02:48:08,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 67 transitions. [2019-01-14 02:48:08,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:48:08,291 INFO L706 BuchiCegarLoop]: Abstraction has 55 states and 67 transitions. [2019-01-14 02:48:08,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 67 transitions. [2019-01-14 02:48:08,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2019-01-14 02:48:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-14 02:48:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2019-01-14 02:48:08,294 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-01-14 02:48:08,294 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-01-14 02:48:08,294 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 02:48:08,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 44 transitions. [2019-01-14 02:48:08,295 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 02:48:08,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:08,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:08,296 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:08,296 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-01-14 02:48:08,297 INFO L794 eck$LassoCheckResult]: Stem: 1095#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1091#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 1092#L367 assume !(main_~length~0 < 1); 1100#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 1101#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 1102#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 1106#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 1111#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 1107#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 1108#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 1103#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 1104#L370-3 assume !(main_~i~0 < main_~length~0); 1093#L370-4 main_~j~0 := 0; 1094#L378-2 [2019-01-14 02:48:08,297 INFO L796 eck$LassoCheckResult]: Loop: 1094#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1096#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 1119#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1105#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 1094#L378-2 [2019-01-14 02:48:08,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:08,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1781949270, now seen corresponding path program 2 times [2019-01-14 02:48:08,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:08,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:08,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:08,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:08,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:08,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:08,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-01-14 02:48:08,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:08,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:08,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:08,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:08,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:08,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:08,329 INFO L82 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 7 times [2019-01-14 02:48:08,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:08,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:08,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:08,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:08,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:08,554 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-01-14 02:48:08,854 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2019-01-14 02:48:10,056 WARN L181 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-01-14 02:48:10,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:48:10 BoogieIcfgContainer [2019-01-14 02:48:10,115 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:48:10,116 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:48:10,116 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:48:10,117 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:48:10,121 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:47:53" (3/4) ... [2019-01-14 02:48:10,129 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 02:48:10,256 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 02:48:10,256 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:48:10,257 INFO L168 Benchmark]: Toolchain (without parser) took 17674.71 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -200.5 MB). Peak memory consumption was 100.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:10,258 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:10,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:10,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:10,260 INFO L168 Benchmark]: Boogie Preprocessor took 26.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:10,261 INFO L168 Benchmark]: RCFGBuilder took 436.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:10,261 INFO L168 Benchmark]: BuchiAutomizer took 16317.45 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -69.2 MB). Peak memory consumption was 453.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:10,264 INFO L168 Benchmark]: Witness Printer took 140.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:10,273 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 699.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 436.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16317.45 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -69.2 MB). Peak memory consumption was 453.9 MB. Max. memory is 11.5 GB. * Witness Printer took 140.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (5 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * arr + -4 * i + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has affine ranking function -1 * arr + -4 * j + 2 and consists of 8 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 15 locations. The remainder module has 35 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.2s and 10 iterations. TraceHistogramMax:4. Analysis of lassos took 13.9s. Construction of modules took 0.4s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 9. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 93 SDtfs, 142 SDslu, 117 SDs, 0 SdLazy, 345 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital185 mio100 ax100 hnf99 lsp76 ukn97 mio100 lsp47 div150 bol100 ite100 ukn100 eq153 hnf64 smp90 dnf113 smp98 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {NULL=0, \result=0, NULL=0, arr=-1, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65917982=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11d0c2b4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c7430fa=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@1a436919=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c7430fa=-1, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@5801c866=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@3e4868f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@2a278132=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@69a8f0e9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i