./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 32bit --witnessprinter.graph.data.programhash 35d30cdccac93bddd26c3755048a0b29ad39c8fa ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:40:22,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:40:22,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:40:22,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:40:22,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:40:22,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:40:22,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:40:22,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:40:22,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:40:22,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:40:22,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:40:22,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:40:22,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:40:22,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:40:22,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:40:22,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:40:22,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:40:22,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:40:22,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:40:22,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:40:22,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:40:22,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:40:22,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:40:22,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:40:22,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:40:22,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:40:22,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:40:22,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:40:22,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:40:22,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:40:22,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:40:22,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:40:22,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:40:22,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:40:22,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:40:22,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:40:22,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:40:22,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:40:22,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:40:22,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:40:22,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:40:22,546 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 03:40:22,583 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:40:22,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:40:22,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:40:22,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:40:22,584 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:40:22,585 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 03:40:22,585 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 03:40:22,585 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 03:40:22,585 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 03:40:22,586 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 03:40:22,586 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 03:40:22,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:40:22,586 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:40:22,587 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 03:40:22,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:40:22,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:40:22,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:40:22,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 03:40:22,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 03:40:22,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 03:40:22,588 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:40:22,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:40:22,589 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 03:40:22,589 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:40:22,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 03:40:22,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:40:22,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:40:22,590 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 03:40:22,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:40:22,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:40:22,591 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 03:40:22,592 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 03:40:22,592 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_28f64df7-ba72-46c9-a11c-95170a9e3940/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35d30cdccac93bddd26c3755048a0b29ad39c8fa [2019-11-20 03:40:22,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:40:22,820 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:40:22,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:40:22,826 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:40:22,826 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:40:22,827 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/../../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2019-11-20 03:40:22,892 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/data/97e90a7bb/6428c3cdabc9412aaff6c4d224745909/FLAG377c1ab39 [2019-11-20 03:40:23,401 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:40:23,402 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2019-11-20 03:40:23,412 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/data/97e90a7bb/6428c3cdabc9412aaff6c4d224745909/FLAG377c1ab39 [2019-11-20 03:40:23,712 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/data/97e90a7bb/6428c3cdabc9412aaff6c4d224745909 [2019-11-20 03:40:23,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:40:23,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:40:23,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:40:23,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:40:23,723 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:40:23,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:40:23" (1/1) ... [2019-11-20 03:40:23,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a6131f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:40:23, skipping insertion in model container [2019-11-20 03:40:23,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:40:23" (1/1) ... [2019-11-20 03:40:23,733 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:40:23,754 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:40:24,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:40:24,044 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:40:24,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:40:24,094 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:40:24,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:40:24 WrapperNode [2019-11-20 03:40:24,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:40:24,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:40:24,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:40:24,096 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:40:24,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:40:24" (1/1) ... [2019-11-20 03:40:24,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:40:24" (1/1) ... [2019-11-20 03:40:24,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:40:24,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:40:24,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:40:24,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:40:24,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:40:24" (1/1) ... [2019-11-20 03:40:24,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:40:24" (1/1) ... [2019-11-20 03:40:24,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:40:24" (1/1) ... [2019-11-20 03:40:24,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:40:24" (1/1) ... [2019-11-20 03:40:24,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:40:24" (1/1) ... [2019-11-20 03:40:24,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:40:24" (1/1) ... [2019-11-20 03:40:24,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:40:24" (1/1) ... [2019-11-20 03:40:24,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:40:24,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:40:24,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:40:24,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:40:24,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:40:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:40:24,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 03:40:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 03:40:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-20 03:40:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 03:40:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 03:40:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 03:40:24,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:40:24,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:40:24,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 03:40:24,902 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:40:24,903 INFO L285 CfgBuilder]: Removed 27 assume(true) statements. [2019-11-20 03:40:24,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:40:24 BoogieIcfgContainer [2019-11-20 03:40:24,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:40:24,904 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 03:40:24,905 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 03:40:24,908 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 03:40:24,909 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 03:40:24,909 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 03:40:23" (1/3) ... [2019-11-20 03:40:24,910 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61849044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 03:40:24, skipping insertion in model container [2019-11-20 03:40:24,910 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 03:40:24,910 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:40:24" (2/3) ... [2019-11-20 03:40:24,911 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61849044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 03:40:24, skipping insertion in model container [2019-11-20 03:40:24,911 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 03:40:24,911 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:40:24" (3/3) ... [2019-11-20 03:40:24,913 INFO L371 chiAutomizerObserver]: Analyzing ICFG ex3_forlist.i [2019-11-20 03:40:24,963 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 03:40:24,963 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 03:40:24,964 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 03:40:24,964 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:40:24,964 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:40:24,964 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 03:40:24,964 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:40:24,964 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 03:40:24,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-11-20 03:40:25,004 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2019-11-20 03:40:25,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:40:25,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:40:25,012 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 03:40:25,013 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 03:40:25,013 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 03:40:25,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-11-20 03:40:25,017 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2019-11-20 03:40:25,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:40:25,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:40:25,018 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 03:40:25,018 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 03:40:25,028 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 4#L-1true havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 31#L17-3true [2019-11-20 03:40:25,028 INFO L796 eck$LassoCheckResult]: Loop: 31#L17-3true assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 17#L17-2true init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 31#L17-3true [2019-11-20 03:40:25,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:40:25,035 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-20 03:40:25,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:40:25,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039339654] [2019-11-20 03:40:25,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:40:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:25,191 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:40:25,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:40:25,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-20 03:40:25,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:40:25,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227686748] [2019-11-20 03:40:25,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:40:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:25,227 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:40:25,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:40:25,229 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-20 03:40:25,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:40:25,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048994561] [2019-11-20 03:40:25,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:40:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:25,308 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:40:25,463 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-20 03:40:25,524 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:40:25,644 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-20 03:40:25,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:40:25,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:40:25,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:185, output treesize:186 [2019-11-20 03:40:25,759 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-20 03:40:25,996 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-20 03:40:26,104 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 03:40:26,122 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 03:40:26,123 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 03:40:26,123 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 03:40:26,124 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 03:40:26,124 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 03:40:26,124 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:40:26,125 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 03:40:26,125 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 03:40:26,125 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration1_Lasso [2019-11-20 03:40:26,125 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 03:40:26,126 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 03:40:26,172 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 03:40:26,179 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 03:40:26,183 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 03:40:26,186 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 03:40:26,190 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 03:40:26,194 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 03:40:26,199 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 03:40:26,203 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 03:40:26,206 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 03:40:26,503 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-11-20 03:40:26,665 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 03:40:26,669 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 03:40:26,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:40:26,681 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 03:40:26,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:40:27,105 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 03:40:27,111 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:40:27,126 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 03:40:27,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:40:27,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:40:27,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:40:27,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:40:27,139 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:40:27,156 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 03:40:27,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:40:27,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:40:27,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:40:27,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:40:27,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:40:27,180 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 03:40:27,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:40:27,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:40:27,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:40:27,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:40:27,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:40:27,196 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 03:40:27,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:40:27,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:40:27,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:40:27,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:40:27,202 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:40:27,215 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:40:27,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:40:27,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:40:27,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:40:27,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:40:27,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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) [2019-11-20 03:40:27,241 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 03:40:27,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:40:27,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:40:27,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:40:27,253 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:40:27,268 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 03:40:27,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:40:27,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:40:27,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:40:27,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:40:27,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:40:27,288 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 03:40:27,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:40:27,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:40:27,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:40:27,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:40:27,295 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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) [2019-11-20 03:40:27,314 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 03:40:27,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:40:27,322 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:40:27,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:40:27,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:40:27,335 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 03:40:27,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:40:27,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:40:27,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:40:27,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:40:27,370 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 03:40:27,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:40:27,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:40:27,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:40:27,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:40:27,398 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 03:40:27,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:40:27,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:40:27,404 INFO L402 nArgumentSynthesizer]: A total of 2 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 03:40:27,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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) [2019-11-20 03:40:27,422 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:40:27,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:40:27,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:40:27,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:40:27,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:40:27,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:40:27,441 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 03:40:27,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:40:27,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:40:27,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:40:27,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:40:27,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:40:27,451 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 03:40:27,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:40:27,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:40:27,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:40:27,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:40:27,484 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 03:40:27,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:40:27,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:40:27,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:40:27,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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) [2019-11-20 03:40:27,516 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 03:40:27,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:40:27,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:40:27,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:40:27,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:40:27,548 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 03:40:27,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:40:27,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:40:27,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:40:27,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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) [2019-11-20 03:40:27,605 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 03:40:27,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:40:27,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:40:27,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:40:27,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:40:27,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:40:27,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:40:27,635 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 03:40:27,857 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-20 03:40:27,857 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:40:27,908 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 03:40:27,914 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 03:40:27,915 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 03:40:27,915 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~#pp~0.base)_1, ULTIMATE.start_init_~i~0) = 3*v_rep(select #length ~#pp~0.base)_1 - 8*ULTIMATE.start_init_~i~0 Supporting invariants [] [2019-11-20 03:40:27,975 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-20 03:40:27,986 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 03:40:28,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:40:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:40:28,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:40:28,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:40:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:40:28,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 03:40:28,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:40:28,080 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 03:40:28,094 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-20 03:40:28,096 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 3 states. [2019-11-20 03:40:28,233 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 3 states. Result 93 states and 136 transitions. Complement of second has 7 states. [2019-11-20 03:40:28,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 03:40:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 03:40:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2019-11-20 03:40:28,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-20 03:40:28,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:40:28,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-20 03:40:28,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:40:28,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-20 03:40:28,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:40:28,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 136 transitions. [2019-11-20 03:40:28,249 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-11-20 03:40:28,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 28 states and 37 transitions. [2019-11-20 03:40:28,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-20 03:40:28,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-20 03:40:28,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2019-11-20 03:40:28,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 03:40:28,257 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-20 03:40:28,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2019-11-20 03:40:28,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-20 03:40:28,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 03:40:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-11-20 03:40:28,286 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-20 03:40:28,286 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-20 03:40:28,286 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 03:40:28,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-11-20 03:40:28,287 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-11-20 03:40:28,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:40:28,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:40:28,288 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:40:28,288 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 03:40:28,289 INFO L794 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 191#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 192#L17-3 assume !(init_~i~0 < 2); 205#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 189#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 190#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 204#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 195#L25-3 [2019-11-20 03:40:28,289 INFO L796 eck$LassoCheckResult]: Loop: 195#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 196#L26 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 200#L25-2 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 195#L25-3 [2019-11-20 03:40:28,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:40:28,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2019-11-20 03:40:28,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:40:28,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041142946] [2019-11-20 03:40:28,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:40:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:40:28,369 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 03:40:28,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041142946] [2019-11-20 03:40:28,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:40:28,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:40:28,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070680391] [2019-11-20 03:40:28,373 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 03:40:28,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:40:28,374 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2019-11-20 03:40:28,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:40:28,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003748175] [2019-11-20 03:40:28,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:40:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:28,387 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:40:28,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:40:28,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:40:28,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:40:28,487 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-11-20 03:40:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:40:28,510 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2019-11-20 03:40:28,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:40:28,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2019-11-20 03:40:28,513 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-11-20 03:40:28,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2019-11-20 03:40:28,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-20 03:40:28,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-20 03:40:28,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2019-11-20 03:40:28,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 03:40:28,516 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-11-20 03:40:28,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2019-11-20 03:40:28,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-20 03:40:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 03:40:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-11-20 03:40:28,520 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-20 03:40:28,520 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-20 03:40:28,520 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 03:40:28,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-11-20 03:40:28,521 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-11-20 03:40:28,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:40:28,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:40:28,522 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:40:28,522 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 03:40:28,523 INFO L794 eck$LassoCheckResult]: Stem: 279#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 254#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 255#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 268#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 269#L17-3 assume !(init_~i~0 < 2); 270#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 252#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 253#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 267#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 256#L25-3 [2019-11-20 03:40:28,523 INFO L796 eck$LassoCheckResult]: Loop: 256#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 257#L26 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 264#L25-2 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 256#L25-3 [2019-11-20 03:40:28,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:40:28,523 INFO L82 PathProgramCache]: Analyzing trace with hash -369325334, now seen corresponding path program 1 times [2019-11-20 03:40:28,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:40:28,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862368738] [2019-11-20 03:40:28,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:40:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:40:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:40:28,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862368738] [2019-11-20 03:40:28,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804297646] [2019-11-20 03:40:28,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:40:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:40:28,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:40:28,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:40:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:40:28,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:40:28,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-20 03:40:28,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192986687] [2019-11-20 03:40:28,664 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 03:40:28,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:40:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2019-11-20 03:40:28,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:40:28,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262230369] [2019-11-20 03:40:28,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:40:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:28,697 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:40:28,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:40:28,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:40:28,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:40:28,770 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-20 03:40:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:40:28,799 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-11-20 03:40:28,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:40:28,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2019-11-20 03:40:28,803 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-11-20 03:40:28,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2019-11-20 03:40:28,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-20 03:40:28,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-20 03:40:28,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2019-11-20 03:40:28,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 03:40:28,804 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-11-20 03:40:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2019-11-20 03:40:28,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-20 03:40:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-20 03:40:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-11-20 03:40:28,816 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-11-20 03:40:28,816 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-11-20 03:40:28,816 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 03:40:28,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2019-11-20 03:40:28,817 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-11-20 03:40:28,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:40:28,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:40:28,820 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:40:28,820 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 03:40:28,820 INFO L794 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 344#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 345#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 358#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 359#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 370#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 371#L17-3 assume !(init_~i~0 < 2); 360#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 342#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 343#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 357#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 346#L25-3 [2019-11-20 03:40:28,820 INFO L796 eck$LassoCheckResult]: Loop: 346#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 347#L26 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 354#L25-2 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 346#L25-3 [2019-11-20 03:40:28,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:40:28,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 2 times [2019-11-20 03:40:28,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:40:28,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115551766] [2019-11-20 03:40:28,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:40:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:28,916 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:40:28,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:40:28,916 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 3 times [2019-11-20 03:40:28,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:40:28,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299485283] [2019-11-20 03:40:28,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:40:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:28,938 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:40:28,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:40:28,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2019-11-20 03:40:28,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:40:28,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851952394] [2019-11-20 03:40:28,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:40:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:40:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:40:29,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851952394] [2019-11-20 03:40:29,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704979009] [2019-11-20 03:40:29,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:40:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:40:29,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 03:40:29,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:40:29,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-11-20 03:40:29,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 03:40:29,636 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 03:40:29,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:40:29,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-11-20 03:40:29,709 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 47 treesize of output 11 [2019-11-20 03:40:29,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:40:29,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:40:29,750 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 47 treesize of output 11 [2019-11-20 03:40:29,750 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:40:29,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:40:29,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:40:29,766 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:36 [2019-11-20 03:40:29,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:40:29,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 22 [2019-11-20 03:40:29,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:40:29,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:40:29,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:40:29,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 22 [2019-11-20 03:40:29,907 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:40:29,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:40:29,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:40:29,939 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:122, output treesize:46 [2019-11-20 03:40:30,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:40:30,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-11-20 03:40:30,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:40:30,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:40:30,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:40:30,229 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:40:30,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-20 03:40:30,230 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:40:30,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:40:30,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:40:30,239 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:7 [2019-11-20 03:40:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:40:30,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:40:30,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2019-11-20 03:40:30,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138411003] [2019-11-20 03:40:30,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:40:30,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 03:40:30,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-11-20 03:40:30,320 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 13 Second operand 18 states. [2019-11-20 03:40:30,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:40:30,992 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-20 03:40:30,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 03:40:30,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2019-11-20 03:40:30,994 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-20 03:40:30,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2019-11-20 03:40:30,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-20 03:40:30,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-20 03:40:30,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2019-11-20 03:40:30,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 03:40:30,996 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-11-20 03:40:30,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2019-11-20 03:40:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-20 03:40:30,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-20 03:40:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-11-20 03:40:30,999 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-11-20 03:40:30,999 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-11-20 03:40:30,999 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 03:40:30,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2019-11-20 03:40:31,000 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-20 03:40:31,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:40:31,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:40:31,001 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:40:31,001 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 03:40:31,001 INFO L794 eck$LassoCheckResult]: Stem: 503#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 479#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 480#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 492#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 493#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 504#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 505#L17-3 assume !(init_~i~0 < 2); 494#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 477#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 478#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 491#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 481#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 482#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 487#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 488#L25-7 [2019-11-20 03:40:31,002 INFO L796 eck$LassoCheckResult]: Loop: 488#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 499#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 501#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 488#L25-7 [2019-11-20 03:40:31,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:40:31,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2019-11-20 03:40:31,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:40:31,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713670767] [2019-11-20 03:40:31,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:40:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:31,122 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:40:31,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:40:31,123 INFO L82 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2019-11-20 03:40:31,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:40:31,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100612462] [2019-11-20 03:40:31,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:40:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:31,141 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:40:31,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:40:31,142 INFO L82 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2019-11-20 03:40:31,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:40:31,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598688913] [2019-11-20 03:40:31,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:40:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:40:31,220 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-11-20 03:41:09,363 WARN L191 SmtUtils]: Spent 38.06 s on a formula simplification. DAG size of input: 278 DAG size of output: 228 [2019-11-20 03:41:09,385 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_50|], 4=[|v_#memory_$Pointer$.offset_54|, |v_#memory_$Pointer$.base_53|, |v_#memory_int_52|, |v_#memory_$Pointer$.offset_53|, |v_#memory_int_54|, |v_#memory_$Pointer$.base_54|]} [2019-11-20 03:41:09,483 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:41:22,173 WARN L191 SmtUtils]: Spent 12.69 s on a formula simplification that was a NOOP. DAG size: 176 [2019-11-20 03:41:22,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:41:22,211 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:41:35,186 WARN L191 SmtUtils]: Spent 12.97 s on a formula simplification that was a NOOP. DAG size: 173 [2019-11-20 03:41:35,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:41:35,256 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:41:48,560 WARN L191 SmtUtils]: Spent 13.30 s on a formula simplification that was a NOOP. DAG size: 170 [2019-11-20 03:41:48,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:41:48,603 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:42:00,668 WARN L191 SmtUtils]: Spent 12.06 s on a formula simplification that was a NOOP. DAG size: 167 [2019-11-20 03:42:00,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:00,716 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:42:12,894 WARN L191 SmtUtils]: Spent 12.18 s on a formula simplification that was a NOOP. DAG size: 164 [2019-11-20 03:42:12,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:12,937 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:42:24,556 WARN L191 SmtUtils]: Spent 11.62 s on a formula simplification that was a NOOP. DAG size: 161 [2019-11-20 03:42:24,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:24,584 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 03:42:36,146 WARN L191 SmtUtils]: Spent 11.56 s on a formula simplification that was a NOOP. DAG size: 158 [2019-11-20 03:42:36,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:36,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-20 03:42:36,148 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:462, output treesize:1765 [2019-11-20 03:42:47,886 WARN L191 SmtUtils]: Spent 11.74 s on a formula simplification that was a NOOP. DAG size: 158 [2019-11-20 03:42:47,889 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 03:42:47,889 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 03:42:47,890 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 03:42:47,890 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 03:42:47,890 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 03:42:47,890 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:42:47,890 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 03:42:47,890 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 03:42:47,890 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration5_Lasso [2019-11-20 03:42:47,890 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 03:42:47,890 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 03:42:47,894 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 03:42:47,897 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 03:42:47,900 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 03:42:47,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:42:47,904 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 03:42:47,907 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 03:42:47,908 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 03:42:47,923 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 03:42:47,925 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 03:42:47,929 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 03:42:47,943 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 03:42:47,947 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 03:42:47,949 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 03:42:47,952 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 03:42:49,443 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-11-20 03:42:49,509 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 03:42:49,520 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 03:42:49,522 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 03:42:49,944 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 03:42:49,944 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:42:49,955 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 03:42:49,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:49,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:42:49,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:49,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:49,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:49,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:42:49,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:42:49,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:42:49,968 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 03:42:49,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:49,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:42:49,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:49,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:49,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:49,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:42:49,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:42:49,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:42:49,977 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 03:42:49,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:49,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:42:49,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:49,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:49,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:49,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:42:49,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:42:49,980 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:42:49,987 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 03:42:49,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:49,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:42:49,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:49,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:49,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:49,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:42:49,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:42:49,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:42:49,996 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 03:42:49,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:49,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:49,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:49,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:49,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:49,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:42:50,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:42:50,008 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 03:42:50,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:42:50,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:42:50,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:42:50,012 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:42:50,021 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 03:42:50,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:50,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:42:50,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:42:50,034 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 03:42:50,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:42:50,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:42:50,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:42:50,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:42:50,045 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 03:42:50,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:42:50,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:50,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:42:50,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:42:50,058 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 03:42:50,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:50,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:42:50,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:42:50,075 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 03:42:50,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:50,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:42:50,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:42:50,088 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 03:42:50,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:42:50,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:42:50,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:42:50,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:42:50,097 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 03:42:50,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:42:50,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:42:50,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:42:50,103 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/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 03:42:50,116 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 03:42:50,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:50,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:42:50,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 03:42:50,141 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 03:42:50,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:50,146 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:42:50,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 03:42:50,161 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 03:42:50,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:42:50,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:42:50,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:42:50,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 03:42:50,176 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 03:42:50,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:50,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:42:50,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 03:42:50,196 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:42:50,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:50,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:42:50,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:42:50,208 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 03:42:50,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:50,212 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:42:50,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 03:42:50,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 03:42:50,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:50,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:42:50,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:42:50,251 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 03:42:50,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:50,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:42:50,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:42:50,269 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 03:42:50,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:50,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:42:50,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:42:50,281 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 03:42:50,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:50,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:42:50,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_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:42:50,296 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 03:42:50,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:50,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:42:50,303 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:42:50,308 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 03:42:50,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:50,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:42:50,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:42:50,319 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 03:42:50,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,322 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:50,322 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:42:50,325 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:42:50,331 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 03:42:50,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:42:50,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:42:50,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:42:50,334 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 03:42:50,340 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:42:50,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:50,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:42:50,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:42:50,359 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 03:42:50,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:42:50,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:42:50,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:42:50,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:42:50,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:42:50,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:42:50,391 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 03:42:50,439 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-20 03:42:50,440 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:42:50,443 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 03:42:50,446 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 03:42:50,446 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 03:42:50,446 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~i~1) = -2*ULTIMATE.start_f_~i~1 + 3 Supporting invariants [] [2019-11-20 03:42:50,479 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-20 03:42:50,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:42:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:42:50,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:42:50,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:42:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:42:50,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:42:50,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:42:50,540 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 03:42:50,540 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-20 03:42:50,540 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-20 03:42:50,569 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 68 states and 88 transitions. Complement of second has 6 states. [2019-11-20 03:42:50,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 03:42:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 03:42:50,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2019-11-20 03:42:50,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-20 03:42:50,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:42:50,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 17 letters. Loop has 3 letters. [2019-11-20 03:42:50,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:42:50,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-20 03:42:50,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:42:50,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2019-11-20 03:42:50,575 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2019-11-20 03:42:50,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 43 states and 54 transitions. [2019-11-20 03:42:50,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-20 03:42:50,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-20 03:42:50,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2019-11-20 03:42:50,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 03:42:50,577 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-11-20 03:42:50,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2019-11-20 03:42:50,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-11-20 03:42:50,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 03:42:50,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-11-20 03:42:50,581 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-11-20 03:42:50,581 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-11-20 03:42:50,581 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 03:42:50,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2019-11-20 03:42:50,582 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-20 03:42:50,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:42:50,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:42:50,583 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:42:50,583 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 03:42:50,584 INFO L794 eck$LassoCheckResult]: Stem: 712#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 686#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 687#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 699#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 700#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 713#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 714#L17-3 assume !(init_~i~0 < 2); 701#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 684#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 685#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 698#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 688#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 689#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 694#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 695#L25-7 assume !(f_~i~1 < 2); 690#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 691#L36-3 [2019-11-20 03:42:50,584 INFO L796 eck$LassoCheckResult]: Loop: 691#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 693#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 697#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 691#L36-3 [2019-11-20 03:42:50,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:42:50,585 INFO L82 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2019-11-20 03:42:50,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:42:50,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046629380] [2019-11-20 03:42:50,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:42:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:42:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 03:42:50,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046629380] [2019-11-20 03:42:50,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:42:50,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:42:50,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675631196] [2019-11-20 03:42:50,619 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 03:42:50,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:42:50,619 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 1 times [2019-11-20 03:42:50,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:42:50,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133769772] [2019-11-20 03:42:50,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:42:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:42:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:42:50,625 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:42:50,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:42:50,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:42:50,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:42:50,701 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-20 03:42:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:42:50,721 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-11-20 03:42:50,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:42:50,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2019-11-20 03:42:50,723 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2019-11-20 03:42:50,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2019-11-20 03:42:50,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-11-20 03:42:50,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-11-20 03:42:50,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2019-11-20 03:42:50,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 03:42:50,724 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-11-20 03:42:50,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2019-11-20 03:42:50,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-11-20 03:42:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 03:42:50,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-20 03:42:50,728 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-20 03:42:50,728 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-20 03:42:50,728 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 03:42:50,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2019-11-20 03:42:50,729 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-20 03:42:50,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:42:50,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:42:50,730 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:42:50,730 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 03:42:50,731 INFO L794 eck$LassoCheckResult]: Stem: 795#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 769#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 770#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 782#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 783#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 796#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 797#L17-3 assume !(init_~i~0 < 2); 784#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 767#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 768#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 781#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 771#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 772#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 777#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 778#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 790#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 773#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 774#L36-3 [2019-11-20 03:42:50,731 INFO L796 eck$LassoCheckResult]: Loop: 774#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 776#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 780#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 774#L36-3 [2019-11-20 03:42:50,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:42:50,731 INFO L82 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2019-11-20 03:42:50,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:42:50,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621799610] [2019-11-20 03:42:50,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:42:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:42:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 03:42:51,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621799610] [2019-11-20 03:42:51,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541329640] [2019-11-20 03:42:51,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:42:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:42:51,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 03:42:51,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:42:51,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-11-20 03:42:51,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:51,282 INFO L567 ElimStorePlain]: treesize reduction 12, result has 47.8 percent of original size [2019-11-20 03:42:51,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:42:51,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-11-20 03:42:51,399 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 31 treesize of output 7 [2019-11-20 03:42:51,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:51,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:51,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:42:51,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:18 [2019-11-20 03:42:51,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 03:42:51,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:51,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:51,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:42:51,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-11-20 03:42:51,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 03:42:51,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:42:51,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2019-11-20 03:42:51,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532714915] [2019-11-20 03:42:51,500 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 03:42:51,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:42:51,501 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 2 times [2019-11-20 03:42:51,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:42:51,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249790360] [2019-11-20 03:42:51,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:42:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:42:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:42:51,511 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:42:51,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:42:51,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 03:42:51,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-11-20 03:42:51,596 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 11 Second operand 9 states. [2019-11-20 03:42:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:42:51,908 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-11-20 03:42:51,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 03:42:51,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2019-11-20 03:42:51,909 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2019-11-20 03:42:51,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 54 transitions. [2019-11-20 03:42:51,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-20 03:42:51,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-20 03:42:51,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2019-11-20 03:42:51,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 03:42:51,910 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-20 03:42:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2019-11-20 03:42:51,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2019-11-20 03:42:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 03:42:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-11-20 03:42:51,913 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-20 03:42:51,913 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-20 03:42:51,913 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 03:42:51,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2019-11-20 03:42:51,914 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-20 03:42:51,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:42:51,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:42:51,915 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:42:51,915 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 03:42:51,916 INFO L794 eck$LassoCheckResult]: Stem: 952#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 926#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 927#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 939#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 940#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 953#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 954#L17-3 assume !(init_~i~0 < 2); 941#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 924#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 925#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 938#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 930#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 931#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 934#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 935#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 946#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 950#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 947#L25-7 assume !(f_~i~1 < 2); 928#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 929#L36-3 [2019-11-20 03:42:51,916 INFO L796 eck$LassoCheckResult]: Loop: 929#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 933#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 937#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 929#L36-3 [2019-11-20 03:42:51,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:42:51,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1566375042, now seen corresponding path program 1 times [2019-11-20 03:42:51,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:42:51,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549656044] [2019-11-20 03:42:51,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:42:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:42:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 03:42:51,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549656044] [2019-11-20 03:42:51,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930665131] [2019-11-20 03:42:51,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:42:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:42:52,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:42:52,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:42:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 03:42:52,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:42:52,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-20 03:42:52,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166222973] [2019-11-20 03:42:52,048 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 03:42:52,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:42:52,048 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 3 times [2019-11-20 03:42:52,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:42:52,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871267368] [2019-11-20 03:42:52,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:42:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:42:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:42:52,054 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:42:52,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:42:52,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:42:52,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:42:52,129 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-20 03:42:52,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:42:52,163 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-11-20 03:42:52,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:42:52,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2019-11-20 03:42:52,164 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2019-11-20 03:42:52,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2019-11-20 03:42:52,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-20 03:42:52,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-20 03:42:52,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2019-11-20 03:42:52,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 03:42:52,166 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-11-20 03:42:52,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2019-11-20 03:42:52,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2019-11-20 03:42:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-20 03:42:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-11-20 03:42:52,169 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-11-20 03:42:52,170 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-11-20 03:42:52,170 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-20 03:42:52,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2019-11-20 03:42:52,171 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-20 03:42:52,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:42:52,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:42:52,172 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:42:52,172 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 03:42:52,172 INFO L794 eck$LassoCheckResult]: Stem: 1093#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1065#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1066#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1079#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1080#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1094#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1095#L17-3 assume !(init_~i~0 < 2); 1078#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1063#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1064#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1077#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1067#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1068#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1073#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1074#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1085#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1096#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1086#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1088#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1069#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1070#L36-3 [2019-11-20 03:42:52,172 INFO L796 eck$LassoCheckResult]: Loop: 1070#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1072#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 1076#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1070#L36-3 [2019-11-20 03:42:52,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:42:52,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2019-11-20 03:42:52,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:42:52,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366690792] [2019-11-20 03:42:52,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:42:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:42:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:42:52,229 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:42:52,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:42:52,230 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 4 times [2019-11-20 03:42:52,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:42:52,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403361268] [2019-11-20 03:42:52,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:42:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:42:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:42:52,236 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:42:52,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:42:52,236 INFO L82 PathProgramCache]: Analyzing trace with hash 951949666, now seen corresponding path program 1 times [2019-11-20 03:42:52,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:42:52,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673917637] [2019-11-20 03:42:52,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:42:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:42:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 03:42:52,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673917637] [2019-11-20 03:42:52,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341265652] [2019-11-20 03:42:52,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:42:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:42:52,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-20 03:42:52,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:42:52,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-11-20 03:42:52,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:52,917 INFO L567 ElimStorePlain]: treesize reduction 13, result has 45.8 percent of original size [2019-11-20 03:42:52,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:42:52,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-11-20 03:42:52,937 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 31 treesize of output 7 [2019-11-20 03:42:52,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:52,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:52,960 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 31 treesize of output 7 [2019-11-20 03:42:52,961 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:52,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:52,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:42:52,975 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:35 [2019-11-20 03:42:53,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:42:53,045 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 22 [2019-11-20 03:42:53,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:53,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:53,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:42:53,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 22 [2019-11-20 03:42:53,088 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:53,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:53,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:42:53,112 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:125, output treesize:24 [2019-11-20 03:42:53,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 03:42:53,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:53,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:53,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 03:42:53,145 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:53,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:53,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:42:53,151 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2019-11-20 03:42:53,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 03:42:53,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:42:53,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-11-20 03:42:53,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675035660] [2019-11-20 03:42:53,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:42:53,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 03:42:53,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-11-20 03:42:53,215 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 11 Second operand 14 states. [2019-11-20 03:42:53,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:42:53,680 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-11-20 03:42:53,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 03:42:53,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2019-11-20 03:42:53,681 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-20 03:42:53,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 46 transitions. [2019-11-20 03:42:53,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-20 03:42:53,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-20 03:42:53,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2019-11-20 03:42:53,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 03:42:53,683 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-11-20 03:42:53,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2019-11-20 03:42:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-11-20 03:42:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 03:42:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-11-20 03:42:53,686 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-11-20 03:42:53,687 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-11-20 03:42:53,687 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-20 03:42:53,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2019-11-20 03:42:53,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-20 03:42:53,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:42:53,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:42:53,689 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:42:53,689 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 03:42:53,689 INFO L794 eck$LassoCheckResult]: Stem: 1257#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1229#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1230#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1258#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1259#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1243#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1244#L17-3 assume !(init_~i~0 < 2); 1245#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1227#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1228#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1242#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1231#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1232#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1236#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1237#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1250#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1255#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1251#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1252#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1233#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1234#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1235#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1246#L39 [2019-11-20 03:42:53,690 INFO L796 eck$LassoCheckResult]: Loop: 1246#L39 assume 1 == g_#t~mem5; 1249#L4 havoc g_#t~mem5;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1240#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1241#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1262#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1246#L39 [2019-11-20 03:42:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:42:53,690 INFO L82 PathProgramCache]: Analyzing trace with hash -939123286, now seen corresponding path program 1 times [2019-11-20 03:42:53,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:42:53,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558278815] [2019-11-20 03:42:53,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:42:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:42:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:42:53,750 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:42:53,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:42:53,751 INFO L82 PathProgramCache]: Analyzing trace with hash 102329555, now seen corresponding path program 1 times [2019-11-20 03:42:53,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:42:53,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43139917] [2019-11-20 03:42:53,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:42:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:42:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:42:53,760 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:42:53,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:42:53,761 INFO L82 PathProgramCache]: Analyzing trace with hash -289378102, now seen corresponding path program 1 times [2019-11-20 03:42:53,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:42:53,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493818154] [2019-11-20 03:42:53,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:42:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:42:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:42:54,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493818154] [2019-11-20 03:42:54,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738144606] [2019-11-20 03:42:54,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:42:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:42:54,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-20 03:42:54,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:42:54,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-11-20 03:42:54,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:54,683 INFO L567 ElimStorePlain]: treesize reduction 12, result has 47.8 percent of original size [2019-11-20 03:42:54,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:42:54,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-11-20 03:42:54,846 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 39 treesize of output 9 [2019-11-20 03:42:54,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:54,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:54,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:42:54,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:20 [2019-11-20 03:42:54,940 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 33 treesize of output 13 [2019-11-20 03:42:54,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:54,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:54,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:42:54,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:19 [2019-11-20 03:42:55,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 03:42:55,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:55,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:55,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:42:55,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-20 03:42:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 03:42:55,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:42:55,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 25 [2019-11-20 03:42:55,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002165275] [2019-11-20 03:42:55,254 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-11-20 03:42:55,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:42:55,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-20 03:42:55,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2019-11-20 03:42:55,320 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 11 Second operand 27 states. [2019-11-20 03:42:56,101 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-11-20 03:42:56,901 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-20 03:42:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:42:57,577 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-11-20 03:42:57,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-20 03:42:57,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 83 transitions. [2019-11-20 03:42:57,578 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 26 [2019-11-20 03:42:57,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 83 transitions. [2019-11-20 03:42:57,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2019-11-20 03:42:57,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2019-11-20 03:42:57,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 83 transitions. [2019-11-20 03:42:57,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 03:42:57,580 INFO L688 BuchiCegarLoop]: Abstraction has 72 states and 83 transitions. [2019-11-20 03:42:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 83 transitions. [2019-11-20 03:42:57,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2019-11-20 03:42:57,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-20 03:42:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-11-20 03:42:57,584 INFO L711 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-11-20 03:42:57,584 INFO L591 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-11-20 03:42:57,585 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-20 03:42:57,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2019-11-20 03:42:57,585 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-20 03:42:57,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:42:57,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:42:57,586 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:42:57,586 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 03:42:57,587 INFO L794 eck$LassoCheckResult]: Stem: 1518#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1487#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1488#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1501#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1502#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1519#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1521#L17-3 assume !(init_~i~0 < 2); 1503#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1485#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1486#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1500#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1491#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1492#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1494#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1495#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1510#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1524#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1511#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1513#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1515#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1516#L25-7 assume !(f_~i~1 < 2); 1522#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1532#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1531#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1530#L39 [2019-11-20 03:42:57,587 INFO L796 eck$LassoCheckResult]: Loop: 1530#L39 assume 1 == g_#t~mem5; 1529#L4 havoc g_#t~mem5;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1528#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1525#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1526#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1530#L39 [2019-11-20 03:42:57,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:42:57,587 INFO L82 PathProgramCache]: Analyzing trace with hash -501415375, now seen corresponding path program 1 times [2019-11-20 03:42:57,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:42:57,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340439524] [2019-11-20 03:42:57,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:42:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:42:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:42:58,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340439524] [2019-11-20 03:42:58,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923403750] [2019-11-20 03:42:58,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:42:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:42:58,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 03:42:58,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:42:58,412 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-11-20 03:42:58,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 03:42:58,454 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 03:42:58,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:42:58,454 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-11-20 03:42:58,514 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 39 treesize of output 9 [2019-11-20 03:42:58,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:58,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:58,533 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 39 treesize of output 9 [2019-11-20 03:42:58,533 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:58,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:58,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:42:58,549 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:29 [2019-11-20 03:42:58,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:42:58,700 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 24 [2019-11-20 03:42:58,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:58,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:58,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:42:58,735 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 24 [2019-11-20 03:42:58,736 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:58,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:58,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:42:58,751 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:123, output treesize:22 [2019-11-20 03:42:58,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 03:42:58,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:58,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:58,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 03:42:58,839 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:42:58,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:42:58,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:42:58,847 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-20 03:42:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:42:58,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:42:58,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2019-11-20 03:42:58,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788594521] [2019-11-20 03:42:58,871 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 03:42:58,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:42:58,871 INFO L82 PathProgramCache]: Analyzing trace with hash 102329555, now seen corresponding path program 2 times [2019-11-20 03:42:58,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:42:58,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600194917] [2019-11-20 03:42:58,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:42:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:42:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:42:58,881 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:42:59,055 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-11-20 03:42:59,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:42:59,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-20 03:42:59,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2019-11-20 03:42:59,130 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 13 Second operand 24 states. [2019-11-20 03:43:00,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:00,107 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-11-20 03:43:00,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 03:43:00,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2019-11-20 03:43:00,109 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-20 03:43:00,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 39 transitions. [2019-11-20 03:43:00,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-20 03:43:00,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-20 03:43:00,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 39 transitions. [2019-11-20 03:43:00,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 03:43:00,110 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-11-20 03:43:00,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 39 transitions. [2019-11-20 03:43:00,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-11-20 03:43:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-20 03:43:00,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-11-20 03:43:00,113 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-11-20 03:43:00,114 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-11-20 03:43:00,114 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-20 03:43:00,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2019-11-20 03:43:00,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-20 03:43:00,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:43:00,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:43:00,116 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:43:00,116 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 03:43:00,116 INFO L794 eck$LassoCheckResult]: Stem: 1714#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1688#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1689#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1702#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1703#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1715#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1720#L17-3 assume !(init_~i~0 < 2); 1704#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1686#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1687#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1701#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1692#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1693#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1695#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1696#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1719#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1712#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1709#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1710#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1690#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1691#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1694#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1705#L39 assume 1 == g_#t~mem5; 1708#L4 havoc g_#t~mem5;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1697#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1698#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1717#L37 [2019-11-20 03:43:00,117 INFO L796 eck$LassoCheckResult]: Loop: 1717#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 1718#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1716#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1717#L37 [2019-11-20 03:43:00,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:00,118 INFO L82 PathProgramCache]: Analyzing trace with hash -147882112, now seen corresponding path program 2 times [2019-11-20 03:43:00,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:00,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297515022] [2019-11-20 03:43:00,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:43:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:43:00,221 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:43:00,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:00,222 INFO L82 PathProgramCache]: Analyzing trace with hash 115236, now seen corresponding path program 5 times [2019-11-20 03:43:00,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:00,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588735347] [2019-11-20 03:43:00,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:43:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:43:00,232 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:43:00,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:00,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1080532549, now seen corresponding path program 1 times [2019-11-20 03:43:00,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:00,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877167087] [2019-11-20 03:43:00,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:00,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 03:43:00,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877167087] [2019-11-20 03:43:00,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691280824] [2019-11-20 03:43:00,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28f64df7-ba72-46c9-a11c-95170a9e3940/bin/uautomizer/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:43:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:00,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:43:00,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:43:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 03:43:00,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:43:00,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-20 03:43:00,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081050311] [2019-11-20 03:43:00,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:00,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:43:00,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:43:00,446 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-11-20 03:43:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:00,502 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-11-20 03:43:00,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:43:00,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2019-11-20 03:43:00,503 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 03:43:00,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-11-20 03:43:00,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-20 03:43:00,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-20 03:43:00,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-20 03:43:00,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 03:43:00,504 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:43:00,504 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:43:00,504 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:43:00,504 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-20 03:43:00,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-20 03:43:00,504 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 03:43:00,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-20 03:43:00,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 03:43:00 BoogieIcfgContainer [2019-11-20 03:43:00,511 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 03:43:00,511 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:43:00,511 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:43:00,512 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:43:00,512 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:40:24" (3/4) ... [2019-11-20 03:43:00,516 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 03:43:00,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:43:00,518 INFO L168 Benchmark]: Toolchain (without parser) took 156801.10 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 427.8 MB). Free memory was 950.1 MB in the beginning and 1.4 GB in the end (delta: -422.0 MB). Peak memory consumption was 5.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:43:00,518 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:43:00,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -208.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:43:00,519 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:43:00,519 INFO L168 Benchmark]: Boogie Preprocessor took 41.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 03:43:00,520 INFO L168 Benchmark]: RCFGBuilder took 702.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:43:00,520 INFO L168 Benchmark]: BuchiAutomizer took 155606.34 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 261.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -249.2 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:43:00,521 INFO L168 Benchmark]: Witness Printer took 5.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:43:00,522 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -208.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 702.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 155606.34 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 261.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -249.2 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 3 * unknown-#length-unknown[pp] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 27 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 155.5s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 150.1s. Construction of modules took 1.8s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 78 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 300 SDtfs, 693 SDslu, 828 SDs, 0 SdLazy, 1289 SolverSat, 262 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU6 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1077 mio100 ax100 hnf100 lsp96 ukn23 mio100 lsp47 div100 bol100 ite100 ukn100 eq169 hnf81 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms 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...