./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer --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 7ed84bee4308b8cf5be51a33ec471886cd45cc40 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 11:08:57,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:08:57,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:08:57,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:08:57,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:08:57,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:08:57,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:08:57,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:08:57,553 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:08:57,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:08:57,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:08:57,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:08:57,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:08:57,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:08:57,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:08:57,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:08:57,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:08:57,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:08:57,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:08:57,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:08:57,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:08:57,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:08:57,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:08:57,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:08:57,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:08:57,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:08:57,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:08:57,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:08:57,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:08:57,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:08:57,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:08:57,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:08:57,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:08:57,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:08:57,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:08:57,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:08:57,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:08:57,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:08:57,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:08:57,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:08:57,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:08:57,592 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-20 11:08:57,617 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:08:57,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:08:57,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:08:57,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:08:57,628 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:08:57,628 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 11:08:57,628 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 11:08:57,628 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 11:08:57,629 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 11:08:57,629 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 11:08:57,629 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 11:08:57,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:08:57,629 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 11:08:57,630 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 11:08:57,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:08:57,631 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 11:08:57,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 11:08:57,631 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 11:08:57,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 11:08:57,632 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 11:08:57,632 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:08:57,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 11:08:57,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:08:57,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:08:57,633 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 11:08:57,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:08:57,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 11:08:57,633 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 11:08:57,635 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 11:08:57,635 INFO L138 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer 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 -> 7ed84bee4308b8cf5be51a33ec471886cd45cc40 [2019-11-20 11:08:57,802 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:08:57,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:08:57,820 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:08:57,821 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:08:57,823 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:08:57,824 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i [2019-11-20 11:08:57,880 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/data/7aad8a5b8/0b683022b12b480ebf5859c8472b1627/FLAGccc878447 [2019-11-20 11:08:58,349 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:08:58,350 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i [2019-11-20 11:08:58,370 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/data/7aad8a5b8/0b683022b12b480ebf5859c8472b1627/FLAGccc878447 [2019-11-20 11:08:58,687 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/data/7aad8a5b8/0b683022b12b480ebf5859c8472b1627 [2019-11-20 11:08:58,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:08:58,691 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 11:08:58,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:08:58,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:08:58,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:08:58,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:08:58" (1/1) ... [2019-11-20 11:08:58,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ca763d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:58, skipping insertion in model container [2019-11-20 11:08:58,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:08:58" (1/1) ... [2019-11-20 11:08:58,706 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:08:58,736 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:08:59,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:08:59,094 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:08:59,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:08:59,203 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:08:59,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:59 WrapperNode [2019-11-20 11:08:59,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:08:59,204 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 11:08:59,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 11:08:59,205 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 11:08:59,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:59" (1/1) ... [2019-11-20 11:08:59,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:59" (1/1) ... [2019-11-20 11:08:59,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 11:08:59,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:08:59,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:08:59,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:08:59,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:59" (1/1) ... [2019-11-20 11:08:59,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:59" (1/1) ... [2019-11-20 11:08:59,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:59" (1/1) ... [2019-11-20 11:08:59,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:59" (1/1) ... [2019-11-20 11:08:59,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:59" (1/1) ... [2019-11-20 11:08:59,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:59" (1/1) ... [2019-11-20 11:08:59,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:59" (1/1) ... [2019-11-20 11:08:59,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:08:59,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:08:59,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:08:59,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:08:59,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/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-11-20 11:08:59,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 11:08:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 11:08:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 11:08:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 11:08:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:08:59,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:08:59,866 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:08:59,866 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-20 11:08:59,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:08:59 BoogieIcfgContainer [2019-11-20 11:08:59,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:08:59,868 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 11:08:59,868 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 11:08:59,872 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 11:08:59,874 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 11:08:59,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 11:08:58" (1/3) ... [2019-11-20 11:08:59,875 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b2aa6d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 11:08:59, skipping insertion in model container [2019-11-20 11:08:59,876 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 11:08:59,876 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:59" (2/3) ... [2019-11-20 11:08:59,876 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b2aa6d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 11:08:59, skipping insertion in model container [2019-11-20 11:08:59,876 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 11:08:59,876 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:08:59" (3/3) ... [2019-11-20 11:08:59,878 INFO L371 chiAutomizerObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-alloca.i [2019-11-20 11:08:59,932 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 11:08:59,932 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 11:08:59,933 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 11:08:59,933 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:08:59,933 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:08:59,933 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 11:08:59,933 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:08:59,933 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 11:08:59,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-11-20 11:08:59,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:08:59,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:08:59,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:08:59,992 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:08:59,992 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:08:59,993 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 11:08:59,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-11-20 11:08:59,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:08:59,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:08:59,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:08:59,999 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:09:00,000 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:09:00,008 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 22#L553true assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 25#L553-2true call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 17#L558true assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 19#L558-2true call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 9#L563true assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post17;havoc main_#t~mem16; 13#L563-2true call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3#L568true assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 5#L568-2true call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 24#L573true assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 27#L573-2true call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 18#L578true assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 21#L578-2true call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 11#L583true assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 16#L583-2true call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 4#L588true assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 6#L588-2true call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 26#L593true assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 10#L598-4true [2019-11-20 11:09:00,009 INFO L796 eck$LassoCheckResult]: Loop: 10#L598-4true call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 20#L598true assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 8#L598-2true assume !!main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 10#L598-4true [2019-11-20 11:09:00,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:00,015 INFO L82 PathProgramCache]: Analyzing trace with hash 187436106, now seen corresponding path program 1 times [2019-11-20 11:09:00,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:00,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238736477] [2019-11-20 11:09:00,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:00,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238736477] [2019-11-20 11:09:00,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:00,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:09:00,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308555540] [2019-11-20 11:09:00,349 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:09:00,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:00,350 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 1 times [2019-11-20 11:09:00,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:00,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97360356] [2019-11-20 11:09:00,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:00,449 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:00,655 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-20 11:09:00,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:00,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:09:00,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:09:00,764 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2019-11-20 11:09:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:00,948 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2019-11-20 11:09:00,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:09:00,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 49 transitions. [2019-11-20 11:09:00,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:00,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 29 states and 41 transitions. [2019-11-20 11:09:00,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-20 11:09:00,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-20 11:09:00,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 41 transitions. [2019-11-20 11:09:00,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:09:00,965 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 41 transitions. [2019-11-20 11:09:00,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 41 transitions. [2019-11-20 11:09:00,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-11-20 11:09:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-20 11:09:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-11-20 11:09:00,998 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-11-20 11:09:00,998 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-11-20 11:09:00,998 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 11:09:00,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. [2019-11-20 11:09:01,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:01,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:09:01,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:09:01,003 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:09:01,004 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:09:01,004 INFO L794 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 91#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 92#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 93#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 76#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 77#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 82#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post17;havoc main_#t~mem16; 95#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 78#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 79#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 87#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 96#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 80#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 81#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 88#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post37;havoc main_#t~mem36; 97#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 99#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 84#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 89#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 90#L598-4 [2019-11-20 11:09:01,004 INFO L796 eck$LassoCheckResult]: Loop: 90#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 85#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 86#L598-2 assume !!main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 90#L598-4 [2019-11-20 11:09:01,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:01,005 INFO L82 PathProgramCache]: Analyzing trace with hash 189283148, now seen corresponding path program 1 times [2019-11-20 11:09:01,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:01,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108390151] [2019-11-20 11:09:01,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:01,155 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:01,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:01,155 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 2 times [2019-11-20 11:09:01,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:01,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850217840] [2019-11-20 11:09:01,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:01,199 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:01,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:01,200 INFO L82 PathProgramCache]: Analyzing trace with hash -357729952, now seen corresponding path program 1 times [2019-11-20 11:09:01,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:01,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767721784] [2019-11-20 11:09:01,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:01,299 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:01,485 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-20 11:09:06,387 WARN L191 SmtUtils]: Spent 4.84 s on a formula simplification. DAG size of input: 192 DAG size of output: 163 [2019-11-20 11:09:06,623 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-20 11:09:06,636 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 11:09:06,637 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 11:09:06,637 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 11:09:06,637 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 11:09:06,638 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 11:09:06,638 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:06,638 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 11:09:06,638 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 11:09:06,639 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration2_Lasso [2019-11-20 11:09:06,639 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 11:09:06,639 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 11:09:06,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:06,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-11-20 11:09:06,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:06,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-11-20 11:09:06,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:06,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:06,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:06,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:06,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:06,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:06,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:06,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:06,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:06,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:06,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,205 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-11-20 11:09:07,349 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-20 11:09:07,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,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-11-20 11:09:07,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:07,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:08,018 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 11:09:08,023 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:08,044 INFO L120 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-11-20 11:09:08,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:08,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:08,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:08,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:08,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:08,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:08,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:08,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:08,056 INFO L120 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-11-20 11:09:08,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:08,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:08,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:08,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:08,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:08,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:08,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:08,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:08,070 INFO L120 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-11-20 11:09:08,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:08,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:08,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:08,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:08,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:08,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:08,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:08,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:08,095 INFO L120 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-11-20 11:09:08,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:08,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:08,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:08,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:08,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:08,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:08,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:08,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 11:09:08,120 INFO L120 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-11-20 11:09:08,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:08,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:08,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:08,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:08,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:08,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:08,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:08,130 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:08,137 INFO L120 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-11-20 11:09:08,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:08,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:08,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:08,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:08,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:08,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:08,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:08,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 11:09:08,151 INFO L120 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-11-20 11:09:08,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:08,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:08,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:08,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:08,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:08,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:08,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:08,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 11:09:08,175 INFO L120 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-11-20 11:09:08,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:08,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:08,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:08,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:08,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:09:08,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:08,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:08,216 INFO L120 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-11-20 11:09:08,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:08,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:08,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:08,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:08,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:08,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:08,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:08,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:08,228 INFO L120 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-11-20 11:09:08,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:08,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:08,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:08,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:08,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:08,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:08,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:08,232 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:08,237 INFO L120 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-11-20 11:09:08,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:08,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:08,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:08,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:08,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:08,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:08,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:08,243 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 11:09:08,260 INFO L120 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-11-20 11:09:08,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:08,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:08,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:08,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:08,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:08,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:08,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:08,264 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:08,275 INFO L120 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-11-20 11:09:08,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:08,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:08,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:08,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:08,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:08,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:08,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:08,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:08,287 INFO L120 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-11-20 11:09:08,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:08,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:08,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:08,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:08,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:08,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:08,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:08,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:08,300 INFO L120 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-11-20 11:09:08,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:08,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:08,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:08,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:08,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:09:08,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:09:08,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:08,316 INFO L120 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-11-20 11:09:08,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:08,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:08,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:08,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:08,322 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:09:08,322 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:09:08,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:08,334 INFO L120 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-11-20 11:09:08,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:08,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:08,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:08,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:08,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:09:08,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:09:08,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:08,363 INFO L120 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-11-20 11:09:08,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:08,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:08,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:08,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:08,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:09:08,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:09:08,376 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 11:09:08,397 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-20 11:09:08,398 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:08,411 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 11:09:08,414 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-20 11:09:08,415 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 11:09:08,415 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 100 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 2 >= 0] [2019-11-20 11:09:08,623 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2019-11-20 11:09:08,643 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 11:09:08,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:08,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 11:09:08,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:09:08,789 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:08,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2019-11-20 11:09:08,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:08,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:08,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:08,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2019-11-20 11:09:08,849 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 11:09:08,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:08,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:08,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:08,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-20 11:09:08,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 11:09:08,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:08,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:08,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:08,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2019-11-20 11:09:08,949 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 11:09:08,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:08,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:08,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:08,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2019-11-20 11:09:08,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 11:09:08,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:09,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:09,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:09,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2019-11-20 11:09:09,034 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 11:09:09,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:09,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:09,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:09,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2019-11-20 11:09:09,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 11:09:09,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:09,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:09,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:09,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2019-11-20 11:09:09,163 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 11:09:09,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:09,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:09,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:09,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2019-11-20 11:09:09,229 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 11:09:09,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:09,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:09,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:09,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2019-11-20 11:09:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:09,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 11:09:09,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:09:09,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:09,355 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2019-11-20 11:09:09,356 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 11 Second operand 13 states. [2019-11-20 11:09:10,315 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 11. Second operand 13 states. Result 91 states and 129 transitions. Complement of second has 17 states. [2019-11-20 11:09:10,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-20 11:09:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-20 11:09:10,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 111 transitions. [2019-11-20 11:09:10,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 111 transitions. Stem has 19 letters. Loop has 3 letters. [2019-11-20 11:09:10,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:09:10,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 111 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-20 11:09:10,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:09:10,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 111 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-20 11:09:10,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:09:10,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 129 transitions. [2019-11-20 11:09:10,325 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 11:09:10,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 85 states and 116 transitions. [2019-11-20 11:09:10,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2019-11-20 11:09:10,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2019-11-20 11:09:10,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 116 transitions. [2019-11-20 11:09:10,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:09:10,328 INFO L688 BuchiCegarLoop]: Abstraction has 85 states and 116 transitions. [2019-11-20 11:09:10,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 116 transitions. [2019-11-20 11:09:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 52. [2019-11-20 11:09:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-20 11:09:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2019-11-20 11:09:10,335 INFO L711 BuchiCegarLoop]: Abstraction has 52 states and 74 transitions. [2019-11-20 11:09:10,335 INFO L591 BuchiCegarLoop]: Abstraction has 52 states and 74 transitions. [2019-11-20 11:09:10,335 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 11:09:10,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 74 transitions. [2019-11-20 11:09:10,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:10,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:09:10,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:09:10,337 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:09:10,338 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:09:10,338 INFO L794 eck$LassoCheckResult]: Stem: 499#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 495#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 496#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 497#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 528#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 479#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 500#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post17;havoc main_#t~mem16; 501#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 507#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 523#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 521#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 520#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 518#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 515#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 514#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post37;havoc main_#t~mem36; 513#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 512#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 511#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 510#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 494#L598-4 [2019-11-20 11:09:10,338 INFO L796 eck$LassoCheckResult]: Loop: 494#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 489#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 490#L598-2 assume !!main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 494#L598-4 [2019-11-20 11:09:10,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:10,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1777631050, now seen corresponding path program 1 times [2019-11-20 11:09:10,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:10,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286995358] [2019-11-20 11:09:10,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:10,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286995358] [2019-11-20 11:09:10,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:10,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:09:10,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529452431] [2019-11-20 11:09:10,387 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:09:10,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:10,387 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 3 times [2019-11-20 11:09:10,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:10,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480103182] [2019-11-20 11:09:10,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:10,422 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:10,532 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-20 11:09:10,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:10,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:09:10,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:09:10,581 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. cyclomatic complexity: 23 Second operand 4 states. [2019-11-20 11:09:10,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:10,637 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2019-11-20 11:09:10,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:09:10,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 73 transitions. [2019-11-20 11:09:10,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:10,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 73 transitions. [2019-11-20 11:09:10,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-11-20 11:09:10,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-11-20 11:09:10,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 73 transitions. [2019-11-20 11:09:10,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:09:10,642 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 73 transitions. [2019-11-20 11:09:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 73 transitions. [2019-11-20 11:09:10,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-20 11:09:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-20 11:09:10,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions. [2019-11-20 11:09:10,647 INFO L711 BuchiCegarLoop]: Abstraction has 52 states and 73 transitions. [2019-11-20 11:09:10,647 INFO L591 BuchiCegarLoop]: Abstraction has 52 states and 73 transitions. [2019-11-20 11:09:10,647 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 11:09:10,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 73 transitions. [2019-11-20 11:09:10,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:10,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:09:10,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:09:10,648 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:09:10,649 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:09:10,649 INFO L794 eck$LassoCheckResult]: Stem: 611#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 606#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 607#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 609#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 591#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 592#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 597#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post17;havoc main_#t~mem16; 612#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 593#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 594#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 600#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 613#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 595#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 596#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 603#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post37;havoc main_#t~mem36; 615#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 620#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 604#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 605#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 608#L598-4 [2019-11-20 11:09:10,649 INFO L796 eck$LassoCheckResult]: Loop: 608#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 601#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 602#L598-2 assume !!main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 608#L598-4 [2019-11-20 11:09:10,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:10,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1237472568, now seen corresponding path program 1 times [2019-11-20 11:09:10,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:10,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833108521] [2019-11-20 11:09:10,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:10,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833108521] [2019-11-20 11:09:10,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:10,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:09:10,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563292375] [2019-11-20 11:09:10,698 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:09:10,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:10,698 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 4 times [2019-11-20 11:09:10,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:10,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254981869] [2019-11-20 11:09:10,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:10,719 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:10,834 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-20 11:09:10,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:10,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:09:10,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:09:10,871 INFO L87 Difference]: Start difference. First operand 52 states and 73 transitions. cyclomatic complexity: 22 Second operand 5 states. [2019-11-20 11:09:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:10,991 INFO L93 Difference]: Finished difference Result 65 states and 90 transitions. [2019-11-20 11:09:10,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:09:10,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 90 transitions. [2019-11-20 11:09:10,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:10,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 90 transitions. [2019-11-20 11:09:10,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2019-11-20 11:09:10,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2019-11-20 11:09:10,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 90 transitions. [2019-11-20 11:09:10,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:09:10,997 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 90 transitions. [2019-11-20 11:09:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 90 transitions. [2019-11-20 11:09:11,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2019-11-20 11:09:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-20 11:09:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2019-11-20 11:09:11,001 INFO L711 BuchiCegarLoop]: Abstraction has 52 states and 72 transitions. [2019-11-20 11:09:11,001 INFO L591 BuchiCegarLoop]: Abstraction has 52 states and 72 transitions. [2019-11-20 11:09:11,001 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 11:09:11,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 72 transitions. [2019-11-20 11:09:11,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:11,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:09:11,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:09:11,002 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:09:11,002 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:09:11,003 INFO L794 eck$LassoCheckResult]: Stem: 738#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 733#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 734#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 736#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 718#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 719#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 725#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 739#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 720#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 721#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 728#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 740#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 769#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 723#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 742#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post37;havoc main_#t~mem36; 743#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 752#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 727#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 732#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 735#L598-4 [2019-11-20 11:09:11,003 INFO L796 eck$LassoCheckResult]: Loop: 735#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 729#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 730#L598-2 assume !!main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 735#L598-4 [2019-11-20 11:09:11,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:11,003 INFO L82 PathProgramCache]: Analyzing trace with hash -650666554, now seen corresponding path program 1 times [2019-11-20 11:09:11,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:11,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879055658] [2019-11-20 11:09:11,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:11,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879055658] [2019-11-20 11:09:11,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:11,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:09:11,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335366024] [2019-11-20 11:09:11,057 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:09:11,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:11,057 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 5 times [2019-11-20 11:09:11,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:11,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687371928] [2019-11-20 11:09:11,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:11,078 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:11,226 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-20 11:09:11,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:11,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:09:11,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:09:11,267 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. cyclomatic complexity: 21 Second operand 5 states. [2019-11-20 11:09:11,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:11,374 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2019-11-20 11:09:11,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:09:11,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 85 transitions. [2019-11-20 11:09:11,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:11,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 63 states and 85 transitions. [2019-11-20 11:09:11,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-11-20 11:09:11,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2019-11-20 11:09:11,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 85 transitions. [2019-11-20 11:09:11,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:09:11,377 INFO L688 BuchiCegarLoop]: Abstraction has 63 states and 85 transitions. [2019-11-20 11:09:11,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 85 transitions. [2019-11-20 11:09:11,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2019-11-20 11:09:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-20 11:09:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2019-11-20 11:09:11,381 INFO L711 BuchiCegarLoop]: Abstraction has 50 states and 68 transitions. [2019-11-20 11:09:11,381 INFO L591 BuchiCegarLoop]: Abstraction has 50 states and 68 transitions. [2019-11-20 11:09:11,381 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 11:09:11,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 68 transitions. [2019-11-20 11:09:11,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:11,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:09:11,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:09:11,383 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:09:11,383 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:09:11,383 INFO L794 eck$LassoCheckResult]: Stem: 863#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 858#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 859#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 861#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 843#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 844#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 864#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 865#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 845#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 846#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 853#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 866#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 847#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 848#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 856#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post37;havoc main_#t~mem36; 868#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 875#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 852#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 857#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 860#L598-4 [2019-11-20 11:09:11,383 INFO L796 eck$LassoCheckResult]: Loop: 860#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 854#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 855#L598-2 assume !!main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 860#L598-4 [2019-11-20 11:09:11,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:11,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1351731132, now seen corresponding path program 1 times [2019-11-20 11:09:11,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:11,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786433139] [2019-11-20 11:09:11,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:11,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786433139] [2019-11-20 11:09:11,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:11,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:09:11,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828212009] [2019-11-20 11:09:11,423 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:09:11,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:11,423 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 6 times [2019-11-20 11:09:11,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:11,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114224144] [2019-11-20 11:09:11,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:11,442 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:11,559 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-20 11:09:11,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:11,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:09:11,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:09:11,592 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-11-20 11:09:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:11,685 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2019-11-20 11:09:11,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:09:11,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2019-11-20 11:09:11,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:11,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 78 transitions. [2019-11-20 11:09:11,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2019-11-20 11:09:11,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-11-20 11:09:11,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 78 transitions. [2019-11-20 11:09:11,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:09:11,688 INFO L688 BuchiCegarLoop]: Abstraction has 59 states and 78 transitions. [2019-11-20 11:09:11,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 78 transitions. [2019-11-20 11:09:11,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2019-11-20 11:09:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-20 11:09:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2019-11-20 11:09:11,691 INFO L711 BuchiCegarLoop]: Abstraction has 50 states and 66 transitions. [2019-11-20 11:09:11,692 INFO L591 BuchiCegarLoop]: Abstraction has 50 states and 66 transitions. [2019-11-20 11:09:11,692 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 11:09:11,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 66 transitions. [2019-11-20 11:09:11,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:11,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:09:11,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:09:11,693 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:09:11,693 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:09:11,693 INFO L794 eck$LassoCheckResult]: Stem: 981#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 976#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 977#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 979#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 962#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 963#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 968#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 982#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 964#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 965#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 971#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 983#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 966#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 967#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 974#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post37;havoc main_#t~mem36; 985#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1011#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 970#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 975#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 978#L598-4 [2019-11-20 11:09:11,693 INFO L796 eck$LassoCheckResult]: Loop: 978#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 972#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 973#L598-2 assume !!main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 978#L598-4 [2019-11-20 11:09:11,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:11,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2031789502, now seen corresponding path program 1 times [2019-11-20 11:09:11,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:11,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149599006] [2019-11-20 11:09:11,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:11,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149599006] [2019-11-20 11:09:11,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:11,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:09:11,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339949433] [2019-11-20 11:09:11,762 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:09:11,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:11,763 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 7 times [2019-11-20 11:09:11,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:11,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806207992] [2019-11-20 11:09:11,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:11,781 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:11,893 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-20 11:09:11,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:11,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:09:11,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:09:11,925 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-11-20 11:09:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:12,007 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2019-11-20 11:09:12,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:09:12,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 70 transitions. [2019-11-20 11:09:12,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:12,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 70 transitions. [2019-11-20 11:09:12,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-11-20 11:09:12,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2019-11-20 11:09:12,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 70 transitions. [2019-11-20 11:09:12,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:09:12,010 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 70 transitions. [2019-11-20 11:09:12,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 70 transitions. [2019-11-20 11:09:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2019-11-20 11:09:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-20 11:09:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2019-11-20 11:09:12,016 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2019-11-20 11:09:12,016 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2019-11-20 11:09:12,016 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 11:09:12,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 59 transitions. [2019-11-20 11:09:12,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:12,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:09:12,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:09:12,017 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:09:12,017 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:09:12,018 INFO L794 eck$LassoCheckResult]: Stem: 1095#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1090#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1091#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 1092#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1075#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 1076#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1081#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 1094#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1077#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 1078#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1084#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 1096#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1104#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post30;havoc main_#t~mem29; 1113#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1098#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post37;havoc main_#t~mem36; 1099#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1120#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 1083#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1088#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 1089#L598-4 [2019-11-20 11:09:12,018 INFO L796 eck$LassoCheckResult]: Loop: 1089#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1085#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1086#L598-2 assume !!main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1089#L598-4 [2019-11-20 11:09:12,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:12,018 INFO L82 PathProgramCache]: Analyzing trace with hash 488170432, now seen corresponding path program 1 times [2019-11-20 11:09:12,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:12,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896692617] [2019-11-20 11:09:12,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:12,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896692617] [2019-11-20 11:09:12,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:12,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:09:12,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105775276] [2019-11-20 11:09:12,088 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:09:12,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:12,088 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 8 times [2019-11-20 11:09:12,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:12,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135628103] [2019-11-20 11:09:12,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:12,105 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:12,245 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-20 11:09:12,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:12,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:09:12,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:09:12,288 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-20 11:09:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:12,358 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2019-11-20 11:09:12,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:09:12,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 64 transitions. [2019-11-20 11:09:12,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:12,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 64 transitions. [2019-11-20 11:09:12,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-11-20 11:09:12,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-11-20 11:09:12,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 64 transitions. [2019-11-20 11:09:12,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:09:12,361 INFO L688 BuchiCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-11-20 11:09:12,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 64 transitions. [2019-11-20 11:09:12,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2019-11-20 11:09:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 11:09:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-11-20 11:09:12,364 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-20 11:09:12,364 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-20 11:09:12,364 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-20 11:09:12,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 52 transitions. [2019-11-20 11:09:12,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:12,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:09:12,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:09:12,365 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:09:12,365 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:09:12,366 INFO L794 eck$LassoCheckResult]: Stem: 1202#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1198#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1199#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 1200#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1182#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 1183#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1190#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 1203#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1184#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 1185#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1204#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 1205#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1186#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post30;havoc main_#t~mem29; 1187#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1195#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1215#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1214#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1213#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1212#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 1197#L598-4 [2019-11-20 11:09:12,366 INFO L796 eck$LassoCheckResult]: Loop: 1197#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1191#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1192#L598-2 assume !!main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1197#L598-4 [2019-11-20 11:09:12,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:12,366 INFO L82 PathProgramCache]: Analyzing trace with hash 486321468, now seen corresponding path program 1 times [2019-11-20 11:09:12,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:12,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824177851] [2019-11-20 11:09:12,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:12,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:12,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824177851] [2019-11-20 11:09:12,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:12,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 11:09:12,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887978500] [2019-11-20 11:09:12,430 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:09:12,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:12,430 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 9 times [2019-11-20 11:09:12,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:12,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129642133] [2019-11-20 11:09:12,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:12,448 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:12,556 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-20 11:09:12,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:12,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 11:09:12,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:09:12,622 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. cyclomatic complexity: 11 Second operand 7 states. [2019-11-20 11:09:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:12,703 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-11-20 11:09:12,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:09:12,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2019-11-20 11:09:12,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:12,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2019-11-20 11:09:12,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-11-20 11:09:12,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-11-20 11:09:12,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2019-11-20 11:09:12,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:09:12,706 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2019-11-20 11:09:12,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2019-11-20 11:09:12,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-11-20 11:09:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 11:09:12,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2019-11-20 11:09:12,709 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-20 11:09:12,709 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-20 11:09:12,709 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-20 11:09:12,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2019-11-20 11:09:12,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:12,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:09:12,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:09:12,710 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:09:12,710 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:09:12,710 INFO L794 eck$LassoCheckResult]: Stem: 1302#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1298#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1299#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 1300#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1283#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 1284#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1289#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 1303#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1285#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 1286#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1294#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 1304#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1287#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post30;havoc main_#t~mem29; 1288#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1295#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1306#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1290#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1291#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1296#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 1297#L598-4 [2019-11-20 11:09:12,711 INFO L796 eck$LassoCheckResult]: Loop: 1297#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1292#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1293#L598-2 assume !!main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1297#L598-4 [2019-11-20 11:09:12,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:12,711 INFO L82 PathProgramCache]: Analyzing trace with hash 486321466, now seen corresponding path program 1 times [2019-11-20 11:09:12,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:12,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027805785] [2019-11-20 11:09:12,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:12,755 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:12,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:12,755 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 10 times [2019-11-20 11:09:12,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:12,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607010650] [2019-11-20 11:09:12,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:12,772 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:12,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:12,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1078171826, now seen corresponding path program 1 times [2019-11-20 11:09:12,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:12,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065718396] [2019-11-20 11:09:12,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:12,811 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:12,966 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-20 11:09:16,617 WARN L191 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 184 DAG size of output: 163 [2019-11-20 11:09:16,764 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-20 11:09:16,767 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 11:09:16,767 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 11:09:16,767 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 11:09:16,767 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 11:09:16,767 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 11:09:16,767 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:16,767 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 11:09:16,767 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 11:09:16,768 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration10_Lasso [2019-11-20 11:09:16,768 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 11:09:16,768 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 11:09:16,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:16,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:16,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:16,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:16,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:16,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:16,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:16,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:16,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:16,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:16,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:16,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:16,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:16,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:16,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,131 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-11-20 11:09:17,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:09:17,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-11-20 11:09:17,795 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 11:09:17,795 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:17,805 INFO L120 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-11-20 11:09:17,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:17,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:17,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:17,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:17,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:17,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:17,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:17,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:17,815 INFO L120 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-11-20 11:09:17,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:17,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:17,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:17,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:17,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:17,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:17,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:17,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 11:09:17,823 INFO L120 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-11-20 11:09:17,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:17,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:17,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:17,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:17,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:17,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:17,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:17,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:17,834 INFO L120 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-11-20 11:09:17,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:17,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:17,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:17,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:17,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:17,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:17,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:17,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:17,842 INFO L120 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-11-20 11:09:17,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:17,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:17,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:17,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:17,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:17,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:17,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:17,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:17,851 INFO L120 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-11-20 11:09:17,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:17,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:17,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:17,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:17,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:17,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:17,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:17,855 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:17,864 INFO L120 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-11-20 11:09:17,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:17,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:17,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:17,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:17,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:17,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:17,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:17,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:17,871 INFO L120 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-11-20 11:09:17,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:17,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:17,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:17,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:17,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:17,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:17,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:17,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:17,880 INFO L120 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-11-20 11:09:17,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:17,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:17,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:17,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:17,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:17,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:17,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:17,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:17,898 INFO L120 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-11-20 11:09:17,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:17,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:17,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:17,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:17,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:17,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:17,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:17,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:17,923 INFO L120 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-11-20 11:09:17,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:17,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:17,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:17,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:17,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:17,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:17,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:17,927 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 11:09:17,931 INFO L120 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 Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:17,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:17,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:17,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:17,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:17,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:17,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:17,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:17,935 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:17,940 INFO L120 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-11-20 11:09:17,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:17,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:09:17,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:17,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:17,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:17,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:09:17,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:09:17,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:17,958 INFO L120 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-11-20 11:09:17,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:17,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:17,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:17,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:17,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:09:17,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:09:17,967 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:17,971 INFO L120 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-11-20 11:09:17,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:17,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:17,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:17,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:17,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:09:17,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:09:17,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:17,991 INFO L120 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-11-20 11:09:17,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:09:17,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:09:17,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:09:17,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:09:17,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:09:17,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:09:18,004 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 11:09:18,017 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-20 11:09:18,017 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64618fc8-86ff-4010-a8e9-cad8b8668aa4/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:09:18,020 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 11:09:18,022 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-20 11:09:18,023 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 11:09:18,023 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 100 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 - 2 >= 0] [2019-11-20 11:09:18,205 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2019-11-20 11:09:18,213 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 11:09:18,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:18,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 11:09:18,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:09:18,287 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:18,287 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2019-11-20 11:09:18,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:18,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:18,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:18,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2019-11-20 11:09:18,353 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-20 11:09:18,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:18,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:18,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:18,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2019-11-20 11:09:18,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-20 11:09:18,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:18,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:18,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:18,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2019-11-20 11:09:18,405 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-20 11:09:18,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:18,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:18,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:18,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2019-11-20 11:09:18,433 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-20 11:09:18,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:18,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:18,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:18,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2019-11-20 11:09:18,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-20 11:09:18,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:18,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:18,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:18,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2019-11-20 11:09:18,533 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-20 11:09:18,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:18,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:18,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:18,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2019-11-20 11:09:18,565 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-20 11:09:18,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:09:18,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:09:18,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:09:18,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2019-11-20 11:09:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:18,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 11:09:18,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:09:18,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:18,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:18,660 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 3 loop predicates [2019-11-20 11:09:18,660 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 10 Second operand 13 states. [2019-11-20 11:09:18,928 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 10. Second operand 13 states. Result 58 states and 70 transitions. Complement of second has 17 states. [2019-11-20 11:09:18,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-20 11:09:18,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-20 11:09:18,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2019-11-20 11:09:18,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 46 transitions. Stem has 19 letters. Loop has 3 letters. [2019-11-20 11:09:18,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:09:18,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 46 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-20 11:09:18,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:09:18,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 46 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-20 11:09:18,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:09:18,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 70 transitions. [2019-11-20 11:09:18,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:18,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 34 states and 42 transitions. [2019-11-20 11:09:18,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-20 11:09:18,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-20 11:09:18,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2019-11-20 11:09:18,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:09:18,934 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-20 11:09:18,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2019-11-20 11:09:18,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-11-20 11:09:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-20 11:09:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-11-20 11:09:18,938 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-20 11:09:18,938 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-20 11:09:18,938 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-20 11:09:18,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2019-11-20 11:09:18,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:18,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:09:18,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:09:18,940 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:09:18,940 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:09:18,940 INFO L794 eck$LassoCheckResult]: Stem: 1683#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1679#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1680#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1682#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1664#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 1665#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1672#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 1684#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1666#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 1667#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1673#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 1686#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1668#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post30;havoc main_#t~mem29; 1669#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1687#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1688#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1670#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1671#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1678#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 1681#L598-4 [2019-11-20 11:09:18,940 INFO L796 eck$LassoCheckResult]: Loop: 1681#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1674#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1675#L598-2 assume !!main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1681#L598-4 [2019-11-20 11:09:18,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:18,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1913077182, now seen corresponding path program 1 times [2019-11-20 11:09:18,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:18,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753154439] [2019-11-20 11:09:18,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:18,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753154439] [2019-11-20 11:09:18,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:18,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 11:09:18,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075052044] [2019-11-20 11:09:18,984 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:09:18,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:18,984 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 11 times [2019-11-20 11:09:18,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:18,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181001344] [2019-11-20 11:09:18,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:18,998 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:19,132 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-20 11:09:19,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:19,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:09:19,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:09:19,195 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-20 11:09:19,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:19,283 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2019-11-20 11:09:19,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 11:09:19,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 38 transitions. [2019-11-20 11:09:19,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:19,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 38 transitions. [2019-11-20 11:09:19,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-11-20 11:09:19,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-11-20 11:09:19,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 38 transitions. [2019-11-20 11:09:19,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:09:19,285 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-20 11:09:19,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 38 transitions. [2019-11-20 11:09:19,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-11-20 11:09:19,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-20 11:09:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-20 11:09:19,286 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-20 11:09:19,287 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-20 11:09:19,287 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-20 11:09:19,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 36 transitions. [2019-11-20 11:09:19,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:19,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:09:19,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:09:19,288 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:09:19,288 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:09:19,288 INFO L794 eck$LassoCheckResult]: Stem: 1758#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1755#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1756#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1757#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1739#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 1740#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1748#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post17;havoc main_#t~mem16; 1759#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1741#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 1742#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1760#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 1761#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1744#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post30;havoc main_#t~mem29; 1745#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1752#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1762#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1746#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1747#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1753#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 1754#L598-4 [2019-11-20 11:09:19,288 INFO L796 eck$LassoCheckResult]: Loop: 1754#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1749#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1750#L598-2 assume !!main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1754#L598-4 [2019-11-20 11:09:19,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:19,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1326271168, now seen corresponding path program 1 times [2019-11-20 11:09:19,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:19,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733041810] [2019-11-20 11:09:19,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:19,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733041810] [2019-11-20 11:09:19,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:19,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:09:19,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710966388] [2019-11-20 11:09:19,328 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:09:19,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:19,328 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 12 times [2019-11-20 11:09:19,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:19,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216275526] [2019-11-20 11:09:19,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:19,353 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:19,532 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-20 11:09:19,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:19,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:09:19,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:09:19,587 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-11-20 11:09:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:19,694 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-11-20 11:09:19,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:09:19,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2019-11-20 11:09:19,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:19,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 35 transitions. [2019-11-20 11:09:19,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-20 11:09:19,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-20 11:09:19,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 35 transitions. [2019-11-20 11:09:19,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:09:19,696 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-11-20 11:09:19,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 35 transitions. [2019-11-20 11:09:19,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-11-20 11:09:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 11:09:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-20 11:09:19,697 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-20 11:09:19,698 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-20 11:09:19,698 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-20 11:09:19,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2019-11-20 11:09:19,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:19,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:09:19,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:09:19,699 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:09:19,699 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:09:19,699 INFO L794 eck$LassoCheckResult]: Stem: 1829#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1826#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1827#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1828#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1811#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 1812#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1819#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post17;havoc main_#t~mem16; 1830#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1813#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 1814#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1822#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post25;havoc main_#t~mem24; 1831#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1815#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post30;havoc main_#t~mem29; 1816#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1823#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1833#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1817#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1818#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1824#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 1825#L598-4 [2019-11-20 11:09:19,699 INFO L796 eck$LassoCheckResult]: Loop: 1825#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1820#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1821#L598-2 assume !!main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1825#L598-4 [2019-11-20 11:09:19,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:19,699 INFO L82 PathProgramCache]: Analyzing trace with hash 2027335746, now seen corresponding path program 1 times [2019-11-20 11:09:19,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:19,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40433933] [2019-11-20 11:09:19,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:19,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40433933] [2019-11-20 11:09:19,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:19,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:09:19,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892860370] [2019-11-20 11:09:19,740 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:09:19,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:19,740 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 13 times [2019-11-20 11:09:19,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:19,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661411777] [2019-11-20 11:09:19,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:19,764 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:19,907 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-20 11:09:19,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:19,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:09:19,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:09:19,942 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-11-20 11:09:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:20,034 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-11-20 11:09:20,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:09:20,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2019-11-20 11:09:20,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:20,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2019-11-20 11:09:20,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-20 11:09:20,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-20 11:09:20,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2019-11-20 11:09:20,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:09:20,036 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-20 11:09:20,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2019-11-20 11:09:20,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-20 11:09:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 11:09:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-20 11:09:20,038 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-20 11:09:20,038 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-20 11:09:20,038 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-20 11:09:20,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. [2019-11-20 11:09:20,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:20,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:09:20,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:09:20,039 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:09:20,039 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:09:20,039 INFO L794 eck$LassoCheckResult]: Stem: 1898#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1895#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1896#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1897#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1879#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 1880#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1888#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post17;havoc main_#t~mem16; 1899#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1881#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 1882#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1889#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 1900#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1883#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post30;havoc main_#t~mem29; 1884#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1892#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1901#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1886#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1887#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1893#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 1894#L598-4 [2019-11-20 11:09:20,039 INFO L796 eck$LassoCheckResult]: Loop: 1894#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1890#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1891#L598-2 assume !!main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1894#L598-4 [2019-11-20 11:09:20,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:20,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1587573180, now seen corresponding path program 1 times [2019-11-20 11:09:20,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:20,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582861977] [2019-11-20 11:09:20,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:20,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582861977] [2019-11-20 11:09:20,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:20,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 11:09:20,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207619053] [2019-11-20 11:09:20,089 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:09:20,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:20,089 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 14 times [2019-11-20 11:09:20,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:20,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183105929] [2019-11-20 11:09:20,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:20,102 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:20,282 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-20 11:09:20,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:20,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:09:20,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:09:20,330 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-11-20 11:09:20,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:20,468 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-11-20 11:09:20,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:09:20,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 32 transitions. [2019-11-20 11:09:20,469 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 11:09:20,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 30 transitions. [2019-11-20 11:09:20,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-20 11:09:20,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-20 11:09:20,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 30 transitions. [2019-11-20 11:09:20,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:09:20,470 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-20 11:09:20,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 30 transitions. [2019-11-20 11:09:20,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-11-20 11:09:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-20 11:09:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-20 11:09:20,471 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-20 11:09:20,472 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-20 11:09:20,472 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-20 11:09:20,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2019-11-20 11:09:20,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:09:20,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:09:20,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:09:20,473 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:09:20,473 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:09:20,473 INFO L794 eck$LassoCheckResult]: Stem: 1968#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1964#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1965#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1966#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1949#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 1950#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1957#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post17;havoc main_#t~mem16; 1967#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1951#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~post22; 1952#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1958#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem26;havoc main_#t~post27; 1969#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1953#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post32;havoc main_#t~mem31; 1954#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1961#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post37;havoc main_#t~mem36; 1970#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1955#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 1956#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1962#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 1963#L598-4 [2019-11-20 11:09:20,473 INFO L796 eck$LassoCheckResult]: Loop: 1963#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1959#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1960#L598-2 assume !!main_#t~short50;havoc main_#t~mem49;havoc main_#t~mem48;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem53;havoc main_#t~mem54; 1963#L598-4 [2019-11-20 11:09:20,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:20,473 INFO L82 PathProgramCache]: Analyzing trace with hash 189283146, now seen corresponding path program 1 times [2019-11-20 11:09:20,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:20,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250345014] [2019-11-20 11:09:20,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:20,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250345014] [2019-11-20 11:09:20,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:20,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 11:09:20,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139188015] [2019-11-20 11:09:20,531 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:09:20,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:20,532 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 15 times [2019-11-20 11:09:20,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:20,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797071532] [2019-11-20 11:09:20,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:09:20,545 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:09:20,720 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-20 11:09:20,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:20,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 11:09:20,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:09:20,751 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-11-20 11:09:20,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:20,820 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2019-11-20 11:09:20,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:09:20,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 18 transitions. [2019-11-20 11:09:20,821 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 11:09:20,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-11-20 11:09:20,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-20 11:09:20,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-20 11:09:20,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-20 11:09:20,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:09:20,822 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 11:09:20,822 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 11:09:20,822 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 11:09:20,822 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-20 11:09:20,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-20 11:09:20,822 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 11:09:20,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-20 11:09:20,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 11:09:20 BoogieIcfgContainer [2019-11-20 11:09:20,828 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 11:09:20,829 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 11:09:20,829 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 11:09:20,829 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 11:09:20,829 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:08:59" (3/4) ... [2019-11-20 11:09:20,832 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 11:09:20,833 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 11:09:20,834 INFO L168 Benchmark]: Toolchain (without parser) took 22143.19 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 351.3 MB). Free memory was 946.1 MB in the beginning and 879.9 MB in the end (delta: 66.2 MB). Peak memory consumption was 417.5 MB. Max. memory is 11.5 GB. [2019-11-20 11:09:20,834 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:09:20,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 512.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-20 11:09:20,835 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-20 11:09:20,835 INFO L168 Benchmark]: Boogie Preprocessor took 29.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:09:20,836 INFO L168 Benchmark]: RCFGBuilder took 584.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. [2019-11-20 11:09:20,836 INFO L168 Benchmark]: BuchiAutomizer took 20959.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 226.5 MB). Free memory was 1.1 GB in the beginning and 890.2 MB in the end (delta: 174.1 MB). Peak memory consumption was 400.6 MB. Max. memory is 11.5 GB. [2019-11-20 11:09:20,836 INFO L168 Benchmark]: Witness Printer took 4.25 ms. Allocated memory is still 1.4 GB. Free memory is still 879.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:09:20,838 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 512.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 584.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20959.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 226.5 MB). Free memory was 1.1 GB in the beginning and 890.2 MB in the end (delta: 174.1 MB). Peak memory consumption was 400.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.25 ms. Allocated memory is still 1.4 GB. Free memory is still 879.9 MB. 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (13 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z][z] + 100 and consists of 14 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y][y] + 100 and consists of 14 locations. 13 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.9s and 16 iterations. TraceHistogramMax:1. Analysis of lassos took 16.9s. Construction of modules took 1.7s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 15. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 117 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 263 SDtfs, 245 SDslu, 308 SDs, 0 SdLazy, 2106 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU13 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital352 mio100 ax105 hnf100 lsp90 ukn55 mio100 lsp37 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...