./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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.25-f470102 [2019-12-07 10:22:28,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:22:28,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:22:28,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:22:28,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:22:28,927 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:22:28,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:22:28,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:22:28,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:22:28,931 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:22:28,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:22:28,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:22:28,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:22:28,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:22:28,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:22:28,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:22:28,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:22:28,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:22:28,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:22:28,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:22:28,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:22:28,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:22:28,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:22:28,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:22:28,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:22:28,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:22:28,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:22:28,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:22:28,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:22:28,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:22:28,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:22:28,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:22:28,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:22:28,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:22:28,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:22:28,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:22:28,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:22:28,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:22:28,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:22:28,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:22:28,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:22:28,949 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 10:22:28,960 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:22:28,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:22:28,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:22:28,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:22:28,961 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:22:28,961 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 10:22:28,961 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 10:22:28,961 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 10:22:28,961 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 10:22:28,961 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 10:22:28,961 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 10:22:28,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:22:28,962 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:22:28,962 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 10:22:28,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:22:28,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:22:28,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:22:28,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 10:22:28,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 10:22:28,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 10:22:28,962 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:22:28,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:22:28,963 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 10:22:28,963 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:22:28,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 10:22:28,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:22:28,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:22:28,963 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 10:22:28,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:22:28,963 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:22:28,964 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:22:28,964 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 10:22:28,964 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 10:22:28,964 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_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:22:29,062 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:22:29,070 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:22:29,072 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:22:29,073 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:22:29,074 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:22:29,074 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/bin/uautomizer/../../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2019-12-07 10:22:29,111 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/bin/uautomizer/data/d9783d5e4/bb445d8ed03247df93ec8f347fb83158/FLAG74bfb4b01 [2019-12-07 10:22:29,616 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:22:29,617 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2019-12-07 10:22:29,621 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/bin/uautomizer/data/d9783d5e4/bb445d8ed03247df93ec8f347fb83158/FLAG74bfb4b01 [2019-12-07 10:22:30,110 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/bin/uautomizer/data/d9783d5e4/bb445d8ed03247df93ec8f347fb83158 [2019-12-07 10:22:30,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:22:30,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:22:30,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:22:30,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:22:30,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:22:30,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:22:30" (1/1) ... [2019-12-07 10:22:30,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3120301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:22:30, skipping insertion in model container [2019-12-07 10:22:30,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:22:30" (1/1) ... [2019-12-07 10:22:30,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:22:30,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:22:30,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:22:30,274 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:22:30,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:22:30,303 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:22:30,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:22:30 WrapperNode [2019-12-07 10:22:30,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:22:30,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:22:30,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:22:30,304 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:22:30,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:22:30" (1/1) ... [2019-12-07 10:22:30,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:22:30" (1/1) ... [2019-12-07 10:22:30,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:22:30,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:22:30,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:22:30,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:22:30,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:22:30" (1/1) ... [2019-12-07 10:22:30,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:22:30" (1/1) ... [2019-12-07 10:22:30,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:22:30" (1/1) ... [2019-12-07 10:22:30,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:22:30" (1/1) ... [2019-12-07 10:22:30,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:22:30" (1/1) ... [2019-12-07 10:22:30,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:22:30" (1/1) ... [2019-12-07 10:22:30,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:22:30" (1/1) ... [2019-12-07 10:22:30,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:22:30,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:22:30,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:22:30,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:22:30,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:22:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:22:30,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 10:22:30,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 10:22:30,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 10:22:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 10:22:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:22:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:22:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:22:30,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:22:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:22:30,625 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:22:30,625 INFO L287 CfgBuilder]: Removed 27 assume(true) statements. [2019-12-07 10:22:30,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:22:30 BoogieIcfgContainer [2019-12-07 10:22:30,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:22:30,626 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 10:22:30,626 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 10:22:30,628 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 10:22:30,629 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 10:22:30,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 10:22:30" (1/3) ... [2019-12-07 10:22:30,630 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64fdafcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 10:22:30, skipping insertion in model container [2019-12-07 10:22:30,630 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 10:22:30,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:22:30" (2/3) ... [2019-12-07 10:22:30,630 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64fdafcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 10:22:30, skipping insertion in model container [2019-12-07 10:22:30,630 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 10:22:30,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:22:30" (3/3) ... [2019-12-07 10:22:30,631 INFO L371 chiAutomizerObserver]: Analyzing ICFG ex3_forlist.i [2019-12-07 10:22:30,659 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 10:22:30,659 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 10:22:30,659 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 10:22:30,659 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:22:30,659 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:22:30,659 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 10:22:30,659 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:22:30,659 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 10:22:30,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-12-07 10:22:30,682 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2019-12-07 10:22:30,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:22:30,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:22:30,687 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 10:22:30,687 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 10:22:30,687 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 10:22:30,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-12-07 10:22:30,689 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2019-12-07 10:22:30,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:22:30,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:22:30,689 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 10:22:30,689 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 10:22:30,694 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-12-07 10:22:30,694 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-12-07 10:22:30,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:30,698 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-12-07 10:22:30,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:30,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449342752] [2019-12-07 10:22:30,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:30,789 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:22:30,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:30,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-12-07 10:22:30,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:30,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980708325] [2019-12-07 10:22:30,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:30,809 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:22:30,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:30,810 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-12-07 10:22:30,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:30,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789032080] [2019-12-07 10:22:30,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:30,851 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:22:30,951 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:22:31,013 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:22:31,014 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:22:31,015 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:185, output treesize:186 [2019-12-07 10:22:31,210 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 10:22:31,211 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 10:22:31,211 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 10:22:31,211 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 10:22:31,211 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 10:22:31,211 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:22:31,212 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 10:22:31,212 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 10:22:31,212 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration1_Lasso [2019-12-07 10:22:31,212 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 10:22:31,212 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 10:22:31,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:22:31,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:22:31,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:22:31,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:22:31,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:22:31,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:22:31,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:22:31,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:22:31,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:22:31,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:22:31,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:22:31,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:22:31,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:22:31,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:22:31,650 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 10:22:31,653 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:22:31,657 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-12-07 10:22:31,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:22:31,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:22:31,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:22:31,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:22:31,667 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-12-07 10:22:31,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:22:31,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:22:31,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:22:31,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:22:31,676 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-12-07 10:22:31,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:22:31,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:22:31,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:22:31,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:22:31,683 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-12-07 10:22:31,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:22:31,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:22:31,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:22:31,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:22:31,691 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-12-07 10:22:31,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:22:31,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:22:31,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:22:31,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:22:31,699 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-12-07 10:22:31,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:22:31,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:22:31,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:22:31,710 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-12-07 10:22:31,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:22:31,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:22:31,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:22:31,714 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:22:31,719 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-12-07 10:22:31,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:22:31,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:22:31,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:22:31,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:22:31,727 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-12-07 10:22:31,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:22:31,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:22:31,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:22:31,738 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-12-07 10:22:31,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:22:31,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:22:31,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:22:31,751 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-12-07 10:22:31,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:22:31,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:22:31,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:22:31,763 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-12-07 10:22:31,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:22:31,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:22:31,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:22:31,772 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-12-07 10:22:31,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:22:31,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:22:31,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:22:31,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:22:31,785 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-12-07 10:22:31,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:22:31,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:22:31,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:22:31,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:22:31,792 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-12-07 10:22:31,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:22:31,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:22:31,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:22:31,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 10:22:31,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:22:31,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:22:31,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:22:31,819 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-12-07 10:22:31,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:22:31,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:22:31,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:22:31,831 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-12-07 10:22:31,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:22:31,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:22:31,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:22:31,843 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-12-07 10:22:31,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:22:31,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:22:31,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:22:31,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:22:31,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:22:31,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:22:31,857 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 10:22:31,882 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-12-07 10:22:31,882 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_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:22:31,886 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 10:22:31,890 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 10:22:31,890 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 10:22:31,891 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-12-07 10:22:31,911 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-12-07 10:22:31,919 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 10:22:31,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:22:31,946 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:22:31,947 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:22:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:22:31,957 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:22:31,958 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:22:31,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:22:31,980 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-12-07 10:22:31,981 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 3 states. [2019-12-07 10:22:32,064 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-12-07 10:22:32,065 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-12-07 10:22:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 10:22:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2019-12-07 10:22:32,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 2 letters. Loop has 2 letters. [2019-12-07 10:22:32,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:22:32,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 4 letters. Loop has 2 letters. [2019-12-07 10:22:32,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:22:32,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 2 letters. Loop has 4 letters. [2019-12-07 10:22:32,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:22:32,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 136 transitions. [2019-12-07 10:22:32,073 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-12-07 10:22:32,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 28 states and 37 transitions. [2019-12-07 10:22:32,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-12-07 10:22:32,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-12-07 10:22:32,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2019-12-07 10:22:32,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:22:32,078 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-12-07 10:22:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2019-12-07 10:22:32,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-07 10:22:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 10:22:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-12-07 10:22:32,098 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-12-07 10:22:32,098 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-12-07 10:22:32,098 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 10:22:32,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-12-07 10:22:32,099 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-12-07 10:22:32,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:22:32,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:22:32,100 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:22:32,100 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 10:22:32,100 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-12-07 10:22:32,100 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-12-07 10:22:32,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:32,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2019-12-07 10:22:32,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:32,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336959152] [2019-12-07 10:22:32,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:22:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:22:32,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336959152] [2019-12-07 10:22:32,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:22:32,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:22:32,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878823089] [2019-12-07 10:22:32,139 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:22:32,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:32,139 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2019-12-07 10:22:32,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:32,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234146205] [2019-12-07 10:22:32,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:32,148 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:22:32,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:22:32,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:22:32,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:22:32,188 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-12-07 10:22:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:22:32,201 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2019-12-07 10:22:32,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:22:32,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2019-12-07 10:22:32,203 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-12-07 10:22:32,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2019-12-07 10:22:32,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-12-07 10:22:32,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-12-07 10:22:32,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2019-12-07 10:22:32,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:22:32,204 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-12-07 10:22:32,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2019-12-07 10:22:32,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-12-07 10:22:32,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 10:22:32,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-12-07 10:22:32,207 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-12-07 10:22:32,207 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-12-07 10:22:32,207 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 10:22:32,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-12-07 10:22:32,208 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-12-07 10:22:32,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:22:32,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:22:32,209 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:22:32,209 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 10:22:32,209 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-12-07 10:22:32,209 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-12-07 10:22:32,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:32,209 INFO L82 PathProgramCache]: Analyzing trace with hash -369325334, now seen corresponding path program 1 times [2019-12-07 10:22:32,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:32,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156731417] [2019-12-07 10:22:32,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:22:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:22:32,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156731417] [2019-12-07 10:22:32,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821441751] [2019-12-07 10:22:32,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:22:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:22:32,277 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:22:32,278 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:22:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:22:32,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:22:32,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-07 10:22:32,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452047491] [2019-12-07 10:22:32,284 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:22:32,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:32,284 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2019-12-07 10:22:32,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:32,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614864284] [2019-12-07 10:22:32,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:32,290 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:22:32,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:22:32,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:22:32,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:22:32,328 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-12-07 10:22:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:22:32,341 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-12-07 10:22:32,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:22:32,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2019-12-07 10:22:32,342 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-12-07 10:22:32,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2019-12-07 10:22:32,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-12-07 10:22:32,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-12-07 10:22:32,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2019-12-07 10:22:32,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:22:32,343 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-12-07 10:22:32,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2019-12-07 10:22:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-07 10:22:32,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 10:22:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-12-07 10:22:32,345 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-12-07 10:22:32,345 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-12-07 10:22:32,345 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 10:22:32,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2019-12-07 10:22:32,346 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-12-07 10:22:32,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:22:32,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:22:32,346 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:22:32,346 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 10:22:32,346 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-12-07 10:22:32,346 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-12-07 10:22:32,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:32,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 2 times [2019-12-07 10:22:32,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:32,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896231469] [2019-12-07 10:22:32,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:32,402 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:22:32,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:32,402 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 3 times [2019-12-07 10:22:32,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:32,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749337269] [2019-12-07 10:22:32,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:32,410 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:22:32,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:32,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2019-12-07 10:22:32,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:32,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525533100] [2019-12-07 10:22:32,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:22:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:22:32,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525533100] [2019-12-07 10:22:32,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160640878] [2019-12-07 10:22:32,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:22:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:22:32,707 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 10:22:32,708 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:22:32,719 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-12-07 10:22:32,720 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:22:32,730 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 10:22:32,731 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:22:32,731 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-12-07 10:22:32,758 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-12-07 10:22:32,759 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:22:32,769 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:22:32,772 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-12-07 10:22:32,772 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:22:32,780 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:22:32,780 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:22:32,780 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:36 [2019-12-07 10:22:32,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:22:32,821 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-12-07 10:22:32,822 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:22:32,837 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:22:32,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:22:32,841 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-12-07 10:22:32,842 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:22:32,854 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:22:32,854 INFO L534 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-12-07 10:22:32,855 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:122, output treesize:46 [2019-12-07 10:22:32,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:22:32,987 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-12-07 10:22:32,987 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:22:32,993 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:22:32,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:22:32,996 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:22:32,996 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-12-07 10:22:32,997 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:22:33,000 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:22:33,000 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:22:33,001 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:7 [2019-12-07 10:22:33,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:22:33,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:22:33,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2019-12-07 10:22:33,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608809186] [2019-12-07 10:22:33,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:22:33,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 10:22:33,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:22:33,040 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 13 Second operand 18 states. [2019-12-07 10:22:33,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:22:33,427 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-12-07 10:22:33,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:22:33,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2019-12-07 10:22:33,428 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-12-07 10:22:33,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2019-12-07 10:22:33,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-12-07 10:22:33,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-12-07 10:22:33,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2019-12-07 10:22:33,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:22:33,429 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-12-07 10:22:33,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2019-12-07 10:22:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-12-07 10:22:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 10:22:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-12-07 10:22:33,430 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-12-07 10:22:33,430 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-12-07 10:22:33,430 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 10:22:33,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2019-12-07 10:22:33,431 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-12-07 10:22:33,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:22:33,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:22:33,431 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:22:33,431 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 10:22:33,431 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-12-07 10:22:33,432 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-12-07 10:22:33,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:33,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2019-12-07 10:22:33,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:33,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276387691] [2019-12-07 10:22:33,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:33,465 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:22:33,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:33,465 INFO L82 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2019-12-07 10:22:33,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:33,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786997687] [2019-12-07 10:22:33,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:33,469 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:22:33,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:33,470 INFO L82 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2019-12-07 10:22:33,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:33,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402057290] [2019-12-07 10:22:33,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:22:33,504 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:23:00,137 WARN L192 SmtUtils]: Spent 26.60 s on a formula simplification. DAG size of input: 278 DAG size of output: 228 [2019-12-07 10:23:00,146 INFO L430 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-12-07 10:23:00,213 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:23:09,207 WARN L192 SmtUtils]: Spent 8.99 s on a formula simplification that was a NOOP. DAG size: 176 [2019-12-07 10:23:09,207 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:23:09,235 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:23:18,339 WARN L192 SmtUtils]: Spent 9.10 s on a formula simplification that was a NOOP. DAG size: 173 [2019-12-07 10:23:18,339 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:23:18,389 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:23:28,234 WARN L192 SmtUtils]: Spent 9.84 s on a formula simplification that was a NOOP. DAG size: 170 [2019-12-07 10:23:28,234 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:23:28,267 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:23:37,204 WARN L192 SmtUtils]: Spent 8.94 s on a formula simplification that was a NOOP. DAG size: 167 [2019-12-07 10:23:37,204 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:23:37,233 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:23:46,172 WARN L192 SmtUtils]: Spent 8.94 s on a formula simplification that was a NOOP. DAG size: 164 [2019-12-07 10:23:46,173 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:23:46,201 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:23:54,555 WARN L192 SmtUtils]: Spent 8.35 s on a formula simplification that was a NOOP. DAG size: 161 [2019-12-07 10:23:54,555 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:23:54,575 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:24:02,771 WARN L192 SmtUtils]: Spent 8.20 s on a formula simplification that was a NOOP. DAG size: 158 [2019-12-07 10:24:02,772 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:24:02,773 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-12-07 10:24:02,773 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:462, output treesize:1765 [2019-12-07 10:24:11,057 WARN L192 SmtUtils]: Spent 8.28 s on a formula simplification that was a NOOP. DAG size: 158 [2019-12-07 10:24:11,060 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 10:24:11,060 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 10:24:11,060 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 10:24:11,060 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 10:24:11,060 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 10:24:11,060 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:24:11,060 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 10:24:11,060 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 10:24:11,060 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration5_Lasso [2019-12-07 10:24:11,060 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 10:24:11,060 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 10:24:11,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:24:11,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:24:11,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:24:11,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:24:11,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:24:11,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:24:11,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:24:11,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:24:11,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:24:11,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:24:11,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:24:11,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:24:11,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:24:11,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:24:12,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:24:12,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:24:12,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:24:12,349 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 10:24:12,349 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,352 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-12-07 10:24:12,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:24:12,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:24:12,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:24:12,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,358 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-12-07 10:24:12,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:24:12,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:24:12,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:24:12,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,365 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-12-07 10:24:12,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:24:12,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:24:12,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:24:12,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,372 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-12-07 10:24:12,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:24:12,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:24:12,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:24:12,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,378 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-12-07 10:24:12,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,386 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-12-07 10:24:12,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:24:12,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:24:12,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:24:12,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,393 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-12-07 10:24:12,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,402 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-12-07 10:24:12,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:24:12,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:24:12,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:24:12,405 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:24:12,409 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-12-07 10:24:12,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,417 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-12-07 10:24:12,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,432 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-12-07 10:24:12,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,440 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-12-07 10:24:12,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:24:12,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:24:12,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:24:12,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,446 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-12-07 10:24:12,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:24:12,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:24:12,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:24:12,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,452 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-12-07 10:24:12,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,457 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:24:12,461 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-12-07 10:24:12,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,466 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:24:12,470 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-12-07 10:24:12,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:24:12,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:24:12,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:24:12,473 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:24:12,477 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-12-07 10:24:12,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:24:12,486 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-12-07 10:24:12,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,501 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-12-07 10:24:12,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,503 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,505 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:24:12,509 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-12-07 10:24:12,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,514 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,517 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-12-07 10:24:12,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,525 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-12-07 10:24:12,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,528 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,534 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-12-07 10:24:12,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,539 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,543 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-12-07 10:24:12,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,551 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-12-07 10:24:12,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,555 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,559 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-12-07 10:24:12,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:24:12,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:24:12,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:24:12,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,565 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-12-07 10:24:12,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,570 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:24:12,573 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-12-07 10:24:12,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,581 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-12-07 10:24:12,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:24:12,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:24:12,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:24:12,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:24:12,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:24:12,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:24:12,595 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 10:24:12,619 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-12-07 10:24:12,619 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_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:12,621 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 10:24:12,624 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 10:24:12,624 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 10:24:12,624 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-12-07 10:24:12,654 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-12-07 10:24:12,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:12,676 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:24:12,676 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:24:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:12,681 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:24:12,681 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:24:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:24:12,687 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-12-07 10:24:12,687 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-12-07 10:24:12,700 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-12-07 10:24:12,700 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-12-07 10:24:12,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 10:24:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2019-12-07 10:24:12,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 3 letters. [2019-12-07 10:24:12,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:24:12,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 17 letters. Loop has 3 letters. [2019-12-07 10:24:12,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:24:12,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 6 letters. [2019-12-07 10:24:12,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:24:12,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2019-12-07 10:24:12,703 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2019-12-07 10:24:12,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 43 states and 54 transitions. [2019-12-07 10:24:12,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-12-07 10:24:12,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-12-07 10:24:12,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2019-12-07 10:24:12,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 10:24:12,704 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-12-07 10:24:12,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2019-12-07 10:24:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-12-07 10:24:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 10:24:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-12-07 10:24:12,706 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-12-07 10:24:12,706 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-12-07 10:24:12,706 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 10:24:12,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2019-12-07 10:24:12,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-12-07 10:24:12,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:24:12,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:24:12,707 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:24:12,707 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 10:24:12,707 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-12-07 10:24:12,707 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-12-07 10:24:12,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:12,707 INFO L82 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2019-12-07 10:24:12,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:12,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616361299] [2019-12-07 10:24:12,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:24:12,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616361299] [2019-12-07 10:24:12,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:24:12,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:24:12,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39371476] [2019-12-07 10:24:12,729 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:24:12,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:12,729 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 1 times [2019-12-07 10:24:12,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:12,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550749487] [2019-12-07 10:24:12,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:12,734 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:24:12,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:24:12,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:24:12,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:24:12,772 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-12-07 10:24:12,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:24:12,786 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-12-07 10:24:12,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:24:12,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2019-12-07 10:24:12,788 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2019-12-07 10:24:12,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2019-12-07 10:24:12,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-12-07 10:24:12,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-12-07 10:24:12,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2019-12-07 10:24:12,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 10:24:12,789 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-12-07 10:24:12,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2019-12-07 10:24:12,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-12-07 10:24:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 10:24:12,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-12-07 10:24:12,791 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-12-07 10:24:12,791 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-12-07 10:24:12,791 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 10:24:12,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2019-12-07 10:24:12,792 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-12-07 10:24:12,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:24:12,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:24:12,793 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:24:12,793 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 10:24:12,793 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-12-07 10:24:12,793 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-12-07 10:24:12,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:12,793 INFO L82 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2019-12-07 10:24:12,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:12,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902063538] [2019-12-07 10:24:12,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:24:13,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902063538] [2019-12-07 10:24:13,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311292283] [2019-12-07 10:24:13,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:13,102 INFO L264 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 10:24:13,103 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:24:13,107 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-12-07 10:24:13,107 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:13,115 INFO L614 ElimStorePlain]: treesize reduction 12, result has 47.8 percent of original size [2019-12-07 10:24:13,116 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:24:13,116 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-12-07 10:24:13,164 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-12-07 10:24:13,164 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:13,170 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:24:13,171 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:24:13,171 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:18 [2019-12-07 10:24:13,203 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-12-07 10:24:13,203 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:13,205 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:24:13,206 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:24:13,206 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-12-07 10:24:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:24:13,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:24:13,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2019-12-07 10:24:13,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86802005] [2019-12-07 10:24:13,222 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:24:13,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:13,222 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 2 times [2019-12-07 10:24:13,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:13,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639720843] [2019-12-07 10:24:13,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:13,226 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:24:13,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:24:13,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:24:13,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:24:13,262 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 11 Second operand 9 states. [2019-12-07 10:24:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:24:13,445 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-12-07 10:24:13,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:24:13,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2019-12-07 10:24:13,445 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2019-12-07 10:24:13,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 54 transitions. [2019-12-07 10:24:13,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-12-07 10:24:13,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-12-07 10:24:13,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2019-12-07 10:24:13,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 10:24:13,446 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-12-07 10:24:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2019-12-07 10:24:13,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2019-12-07 10:24:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 10:24:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-12-07 10:24:13,448 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-12-07 10:24:13,448 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-12-07 10:24:13,448 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 10:24:13,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2019-12-07 10:24:13,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-12-07 10:24:13,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:24:13,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:24:13,449 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:24:13,449 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 10:24:13,449 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-12-07 10:24:13,449 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-12-07 10:24:13,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:13,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1566375042, now seen corresponding path program 1 times [2019-12-07 10:24:13,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:13,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188899635] [2019-12-07 10:24:13,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:24:13,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188899635] [2019-12-07 10:24:13,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358917607] [2019-12-07 10:24:13,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:13,512 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:24:13,513 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:24:13,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:24:13,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:24:13,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-07 10:24:13,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142584819] [2019-12-07 10:24:13,519 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:24:13,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:13,519 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 3 times [2019-12-07 10:24:13,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:13,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892220374] [2019-12-07 10:24:13,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:13,523 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:24:13,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:24:13,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:24:13,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:24:13,560 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-12-07 10:24:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:24:13,589 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-12-07 10:24:13,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:24:13,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2019-12-07 10:24:13,590 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2019-12-07 10:24:13,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2019-12-07 10:24:13,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-12-07 10:24:13,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-12-07 10:24:13,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2019-12-07 10:24:13,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 10:24:13,591 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-12-07 10:24:13,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2019-12-07 10:24:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2019-12-07 10:24:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 10:24:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-12-07 10:24:13,593 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-12-07 10:24:13,593 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-12-07 10:24:13,593 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-12-07 10:24:13,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2019-12-07 10:24:13,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-12-07 10:24:13,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:24:13,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:24:13,595 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:24:13,595 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 10:24:13,595 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-12-07 10:24:13,595 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-12-07 10:24:13,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:13,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2019-12-07 10:24:13,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:13,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831856517] [2019-12-07 10:24:13,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:13,637 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:24:13,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:13,637 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 4 times [2019-12-07 10:24:13,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:13,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101006051] [2019-12-07 10:24:13,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:13,642 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:24:13,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:13,643 INFO L82 PathProgramCache]: Analyzing trace with hash 951949666, now seen corresponding path program 1 times [2019-12-07 10:24:13,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:13,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779655497] [2019-12-07 10:24:13,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:13,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:24:13,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779655497] [2019-12-07 10:24:13,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167985503] [2019-12-07 10:24:13,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:14,044 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 10:24:14,045 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:24:14,049 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-12-07 10:24:14,050 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:14,059 INFO L614 ElimStorePlain]: treesize reduction 13, result has 45.8 percent of original size [2019-12-07 10:24:14,059 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:24:14,059 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-12-07 10:24:14,073 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-12-07 10:24:14,073 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:14,089 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:24:14,092 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-12-07 10:24:14,093 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:14,104 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:24:14,105 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:24:14,105 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:35 [2019-12-07 10:24:14,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:24:14,143 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-12-07 10:24:14,143 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:14,162 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:24:14,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:24:14,166 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-12-07 10:24:14,167 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:14,179 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:24:14,179 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:24:14,180 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:125, output treesize:24 [2019-12-07 10:24:14,193 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-12-07 10:24:14,194 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:14,198 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:24:14,200 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-12-07 10:24:14,200 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:14,203 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:24:14,203 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:24:14,203 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2019-12-07 10:24:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:24:14,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:24:14,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-12-07 10:24:14,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879885824] [2019-12-07 10:24:14,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:24:14,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:24:14,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:24:14,241 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 11 Second operand 14 states. [2019-12-07 10:24:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:24:14,477 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-12-07 10:24:14,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:24:14,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2019-12-07 10:24:14,478 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-12-07 10:24:14,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 46 transitions. [2019-12-07 10:24:14,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-12-07 10:24:14,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-12-07 10:24:14,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2019-12-07 10:24:14,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 10:24:14,479 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-12-07 10:24:14,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2019-12-07 10:24:14,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-12-07 10:24:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 10:24:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-12-07 10:24:14,481 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-12-07 10:24:14,481 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-12-07 10:24:14,481 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-12-07 10:24:14,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2019-12-07 10:24:14,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-12-07 10:24:14,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:24:14,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:24:14,482 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-12-07 10:24:14,482 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 10:24:14,482 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-12-07 10:24:14,482 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-12-07 10:24:14,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:14,482 INFO L82 PathProgramCache]: Analyzing trace with hash -939123286, now seen corresponding path program 1 times [2019-12-07 10:24:14,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:14,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936649162] [2019-12-07 10:24:14,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:14,528 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:24:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:14,528 INFO L82 PathProgramCache]: Analyzing trace with hash 102329555, now seen corresponding path program 1 times [2019-12-07 10:24:14,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:14,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412486582] [2019-12-07 10:24:14,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:14,535 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:24:14,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:14,536 INFO L82 PathProgramCache]: Analyzing trace with hash -289378102, now seen corresponding path program 1 times [2019-12-07 10:24:14,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:14,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975521822] [2019-12-07 10:24:14,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:24:15,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975521822] [2019-12-07 10:24:15,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141112832] [2019-12-07 10:24:15,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:15,058 INFO L264 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 10:24:15,060 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:24:15,065 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-12-07 10:24:15,065 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:15,078 INFO L614 ElimStorePlain]: treesize reduction 12, result has 47.8 percent of original size [2019-12-07 10:24:15,079 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:24:15,079 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-12-07 10:24:15,186 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-12-07 10:24:15,186 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:15,190 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:24:15,190 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:24:15,191 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:20 [2019-12-07 10:24:15,237 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-12-07 10:24:15,238 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:15,252 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:24:15,253 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:24:15,253 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:19 [2019-12-07 10:24:15,303 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-12-07 10:24:15,303 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:15,305 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:24:15,306 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:24:15,306 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-12-07 10:24:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:24:15,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:24:15,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 25 [2019-12-07 10:24:15,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933482358] [2019-12-07 10:24:15,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:24:15,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 10:24:15,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2019-12-07 10:24:15,444 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 11 Second operand 27 states. [2019-12-07 10:24:17,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:24:17,162 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-12-07 10:24:17,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 10:24:17,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 83 transitions. [2019-12-07 10:24:17,163 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 26 [2019-12-07 10:24:17,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 83 transitions. [2019-12-07 10:24:17,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2019-12-07 10:24:17,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2019-12-07 10:24:17,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 83 transitions. [2019-12-07 10:24:17,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 10:24:17,164 INFO L688 BuchiCegarLoop]: Abstraction has 72 states and 83 transitions. [2019-12-07 10:24:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 83 transitions. [2019-12-07 10:24:17,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2019-12-07 10:24:17,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 10:24:17,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-12-07 10:24:17,166 INFO L711 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-12-07 10:24:17,166 INFO L591 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-12-07 10:24:17,166 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-12-07 10:24:17,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2019-12-07 10:24:17,167 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-12-07 10:24:17,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:24:17,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:24:17,167 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-12-07 10:24:17,167 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 10:24:17,167 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-12-07 10:24:17,168 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-12-07 10:24:17,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:17,168 INFO L82 PathProgramCache]: Analyzing trace with hash -501415375, now seen corresponding path program 1 times [2019-12-07 10:24:17,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:17,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408993520] [2019-12-07 10:24:17,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:17,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:24:17,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408993520] [2019-12-07 10:24:17,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655483719] [2019-12-07 10:24:17,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:17,583 INFO L264 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 10:24:17,584 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:24:17,587 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-12-07 10:24:17,588 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:24:17,598 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 10:24:17,598 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:24:17,598 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-12-07 10:24:17,634 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-12-07 10:24:17,634 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:17,643 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:24:17,645 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-12-07 10:24:17,645 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:17,651 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:24:17,652 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:24:17,652 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:29 [2019-12-07 10:24:17,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:24:17,725 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-12-07 10:24:17,725 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:17,738 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:24:17,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:24:17,741 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-12-07 10:24:17,741 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:17,750 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:24:17,750 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:24:17,750 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:123, output treesize:22 [2019-12-07 10:24:17,805 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-12-07 10:24:17,805 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:17,810 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:24:17,812 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-12-07 10:24:17,812 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:24:17,815 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:24:17,815 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:24:17,816 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-12-07 10:24:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:24:17,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:24:17,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2019-12-07 10:24:17,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433602268] [2019-12-07 10:24:17,838 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:24:17,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:17,838 INFO L82 PathProgramCache]: Analyzing trace with hash 102329555, now seen corresponding path program 2 times [2019-12-07 10:24:17,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:17,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897847271] [2019-12-07 10:24:17,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:17,844 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:24:17,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:24:17,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 10:24:17,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2019-12-07 10:24:17,968 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 13 Second operand 24 states. [2019-12-07 10:24:18,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:24:18,468 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-12-07 10:24:18,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:24:18,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2019-12-07 10:24:18,469 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-12-07 10:24:18,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 39 transitions. [2019-12-07 10:24:18,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-12-07 10:24:18,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-12-07 10:24:18,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 39 transitions. [2019-12-07 10:24:18,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:24:18,469 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-12-07 10:24:18,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 39 transitions. [2019-12-07 10:24:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-12-07 10:24:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 10:24:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-12-07 10:24:18,471 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-12-07 10:24:18,471 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-12-07 10:24:18,471 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-12-07 10:24:18,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2019-12-07 10:24:18,471 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-12-07 10:24:18,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:24:18,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:24:18,472 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-12-07 10:24:18,472 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 10:24:18,472 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-12-07 10:24:18,472 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-12-07 10:24:18,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:18,472 INFO L82 PathProgramCache]: Analyzing trace with hash -147882112, now seen corresponding path program 2 times [2019-12-07 10:24:18,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:18,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936335954] [2019-12-07 10:24:18,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:18,511 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:24:18,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:18,511 INFO L82 PathProgramCache]: Analyzing trace with hash 115236, now seen corresponding path program 5 times [2019-12-07 10:24:18,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:18,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738621109] [2019-12-07 10:24:18,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:18,515 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:24:18,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:18,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1080532549, now seen corresponding path program 1 times [2019-12-07 10:24:18,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:18,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406782695] [2019-12-07 10:24:18,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:24:18,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406782695] [2019-12-07 10:24:18,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60231192] [2019-12-07 10:24:18,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c6230b-4e7a-4fc1-a481-eb5c588c911a/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-12-07 10:24:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:18,591 INFO L264 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:24:18,592 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:24:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:24:18,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:24:18,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-12-07 10:24:18,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985580600] [2019-12-07 10:24:18,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:24:18,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:24:18,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:24:18,622 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-12-07 10:24:18,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:24:18,644 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-12-07 10:24:18,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:24:18,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2019-12-07 10:24:18,645 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 10:24:18,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-12-07 10:24:18,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-12-07 10:24:18,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-12-07 10:24:18,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-12-07 10:24:18,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:24:18,645 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:24:18,645 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:24:18,645 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:24:18,645 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-12-07 10:24:18,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:24:18,645 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 10:24:18,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-12-07 10:24:18,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.12 10:24:18 BoogieIcfgContainer [2019-12-07 10:24:18,649 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-12-07 10:24:18,650 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:24:18,650 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:24:18,650 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:24:18,650 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:22:30" (3/4) ... [2019-12-07 10:24:18,653 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 10:24:18,653 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:24:18,654 INFO L168 Benchmark]: Toolchain (without parser) took 108541.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 939.8 MB in the beginning and 947.1 MB in the end (delta: -7.3 MB). Peak memory consumption was 108.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:24:18,654 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:24:18,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -147.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:24:18,655 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:24:18,655 INFO L168 Benchmark]: Boogie Preprocessor took 21.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:24:18,655 INFO L168 Benchmark]: RCFGBuilder took 272.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:24:18,656 INFO L168 Benchmark]: BuchiAutomizer took 108023.26 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.6 MB). Free memory was 1.1 GB in the beginning and 947.1 MB in the end (delta: 106.2 MB). Peak memory consumption was 129.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:24:18,656 INFO L168 Benchmark]: Witness Printer took 3.43 ms. Allocated memory is still 1.1 GB. Free memory is still 947.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:24:18,657 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 189.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -147.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 272.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 108023.26 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.6 MB). Free memory was 1.1 GB in the beginning and 947.1 MB in the end (delta: 106.2 MB). Peak memory consumption was 129.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.43 ms. Allocated memory is still 1.1 GB. Free memory is still 947.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 107.9s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 104.5s. Construction of modules took 1.2s. Büchi inclusion checks took 2.1s. 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.2s 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: 10ms 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...