./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/ldv-regression/test27_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/test27_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/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 8d15e59fd1b84d7219285b33cc166f567d0bcf3e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:37:22,961 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:37:22,962 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:37:22,969 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:37:22,970 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:37:22,970 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:37:22,971 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:37:22,972 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:37:22,973 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:37:22,974 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:37:22,974 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:37:22,974 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:37:22,975 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:37:22,976 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:37:22,976 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:37:22,977 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:37:22,977 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:37:22,978 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:37:22,980 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:37:22,981 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:37:22,982 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:37:22,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:37:22,984 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:37:22,984 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:37:22,984 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:37:22,985 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:37:22,985 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:37:22,986 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:37:22,987 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:37:22,987 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:37:22,988 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:37:22,988 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:37:22,988 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:37:22,988 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:37:22,989 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:37:22,989 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:37:22,990 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 08:37:23,000 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:37:23,001 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:37:23,001 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:37:23,002 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:37:23,002 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:37:23,002 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 08:37:23,002 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 08:37:23,002 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 08:37:23,002 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 08:37:23,002 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 08:37:23,002 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 08:37:23,003 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:37:23,003 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:37:23,003 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:37:23,003 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:37:23,003 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:37:23,003 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:37:23,003 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 08:37:23,003 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 08:37:23,004 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 08:37:23,004 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:37:23,004 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:37:23,004 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 08:37:23,004 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:37:23,004 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 08:37:23,004 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:37:23,004 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:37:23,004 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 08:37:23,005 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:37:23,005 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:37:23,005 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 08:37:23,006 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 08:37:23,006 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/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 -> 8d15e59fd1b84d7219285b33cc166f567d0bcf3e [2018-11-18 08:37:23,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:37:23,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:37:23,036 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:37:23,037 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:37:23,037 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:37:23,038 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test27_false-unreach-call_true-termination.c [2018-11-18 08:37:23,073 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/data/d44b29d63/f58c76635ef54af5abf90fea2c56c9c6/FLAG44e890e07 [2018-11-18 08:37:23,371 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:37:23,372 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/sv-benchmarks/c/ldv-regression/test27_false-unreach-call_true-termination.c [2018-11-18 08:37:23,375 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/data/d44b29d63/f58c76635ef54af5abf90fea2c56c9c6/FLAG44e890e07 [2018-11-18 08:37:23,384 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/data/d44b29d63/f58c76635ef54af5abf90fea2c56c9c6 [2018-11-18 08:37:23,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:37:23,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:37:23,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:37:23,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:37:23,390 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:37:23,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:37:23" (1/1) ... [2018-11-18 08:37:23,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@602e9054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:23, skipping insertion in model container [2018-11-18 08:37:23,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:37:23" (1/1) ... [2018-11-18 08:37:23,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:37:23,411 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:37:23,521 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:37:23,526 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:37:23,541 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:37:23,550 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:37:23,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:23 WrapperNode [2018-11-18 08:37:23,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:37:23,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:37:23,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:37:23,551 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:37:23,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:23" (1/1) ... [2018-11-18 08:37:23,566 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:23" (1/1) ... [2018-11-18 08:37:23,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:37:23,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:37:23,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:37:23,620 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:37:23,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:23" (1/1) ... [2018-11-18 08:37:23,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:23" (1/1) ... [2018-11-18 08:37:23,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:23" (1/1) ... [2018-11-18 08:37:23,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:23" (1/1) ... [2018-11-18 08:37:23,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:23" (1/1) ... [2018-11-18 08:37:23,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:23" (1/1) ... [2018-11-18 08:37:23,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:23" (1/1) ... [2018-11-18 08:37:23,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:37:23,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:37:23,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:37:23,642 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:37:23,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/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 [2018-11-18 08:37:23,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 08:37:23,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 08:37:23,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 08:37:23,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:37:23,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:37:23,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:37:23,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 08:37:23,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 08:37:23,875 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:37:23,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:37:23 BoogieIcfgContainer [2018-11-18 08:37:23,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:37:23,876 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 08:37:23,876 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 08:37:23,879 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 08:37:23,880 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:37:23,880 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:37:23" (1/3) ... [2018-11-18 08:37:23,881 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50027389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:37:23, skipping insertion in model container [2018-11-18 08:37:23,881 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:37:23,881 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:23" (2/3) ... [2018-11-18 08:37:23,881 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50027389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:37:23, skipping insertion in model container [2018-11-18 08:37:23,881 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:37:23,882 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:37:23" (3/3) ... [2018-11-18 08:37:23,883 INFO L375 chiAutomizerObserver]: Analyzing ICFG test27_false-unreach-call_true-termination.c [2018-11-18 08:37:23,930 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:37:23,930 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 08:37:23,930 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 08:37:23,931 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 08:37:23,931 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:37:23,931 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:37:23,931 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 08:37:23,931 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:37:23,931 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 08:37:23,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-18 08:37:23,957 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 08:37:23,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:37:23,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:37:23,961 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:37:23,961 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:37:23,961 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 08:37:23,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-18 08:37:23,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 08:37:23,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:37:23,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:37:23,963 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:37:23,963 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:37:23,969 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 16#L28-4true [2018-11-18 08:37:23,969 INFO L796 eck$LassoCheckResult]: Loop: 16#L28-4true assume true; 3#L28-1true assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 19#L28-3true main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16#L28-4true [2018-11-18 08:37:23,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:23,974 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 08:37:23,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:23,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:24,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:24,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:37:24,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:24,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:24,056 INFO L82 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2018-11-18 08:37:24,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:24,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:24,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:24,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:37:24,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:24,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:24,082 INFO L82 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2018-11-18 08:37:24,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:24,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:24,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:24,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:37:24,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:24,306 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:37:24,307 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:37:24,308 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:37:24,308 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:37:24,308 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:37:24,308 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:37:24,308 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:37:24,308 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:37:24,308 INFO L131 ssoRankerPreferences]: Filename of dumped script: test27_false-unreach-call_true-termination.c_Iteration1_Lasso [2018-11-18 08:37:24,308 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:37:24,309 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:37:24,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:24,645 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:37:24,648 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:37:24,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:24,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:24,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:24,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:24,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:24,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:24,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:24,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:24,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:24,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:24,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:24,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:24,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:37:24,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:37:24,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:24,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:24,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:24,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:24,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:24,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:24,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:24,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:24,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:24,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:37:24,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:37:24,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:37:24,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:37:24,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:37:24,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:37:24,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,705 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:37:24,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,706 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:37:24,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:37:24,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:37:24,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:37:24,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:24,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:24,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:24,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:37:24,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:37:24,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,725 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:37:24,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,726 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:37:24,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:37:24,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:37:24,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:37:24,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:24,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:24,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:24,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:37:24,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:37:24,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:24,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:24,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:24,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,751 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:37:24,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,753 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:37:24,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:37:24,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:24,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:37:24,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:24,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:24,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:24,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:24,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:37:24,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:37:24,795 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:37:24,813 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 08:37:24,813 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 08:37:24,815 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:37:24,817 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:37:24,817 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:37:24,817 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 19 Supporting invariants [] [2018-11-18 08:37:24,853 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2018-11-18 08:37:24,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:24,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:24,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:24,919 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 [2018-11-18 08:37:24,920 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2018-11-18 08:37:24,949 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 47 states and 62 transitions. Complement of second has 7 states. [2018-11-18 08:37:24,950 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 [2018-11-18 08:37:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:37:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2018-11-18 08:37:24,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-18 08:37:24,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:37:24,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 08:37:24,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:37:24,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 08:37:24,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:37:24,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 62 transitions. [2018-11-18 08:37:24,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:24,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 12 states and 14 transitions. [2018-11-18 08:37:24,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 08:37:24,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 08:37:24,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2018-11-18 08:37:24,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:37:24,960 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-18 08:37:24,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2018-11-18 08:37:24,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-18 08:37:24,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 08:37:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-11-18 08:37:24,976 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-18 08:37:24,976 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-18 08:37:24,976 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 08:37:24,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2018-11-18 08:37:24,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:24,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:37:24,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:37:24,977 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 08:37:24,977 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:37:24,977 INFO L794 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 148#L28-4 assume true; 150#L28-1 assume !(main_~j~0 < 10); 151#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + 4 * main_~i~0, 4);call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + 4 * main_~i~0;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 154#L38 assume main_#t~mem11 > 0;havoc main_#t~mem11;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem14;havoc main_#t~mem13.base, main_#t~mem13.offset; 155#L40-4 [2018-11-18 08:37:24,978 INFO L796 eck$LassoCheckResult]: Loop: 155#L40-4 assume true; 157#L40-1 call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 156#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre16; 155#L40-4 [2018-11-18 08:37:24,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:24,978 INFO L82 PathProgramCache]: Analyzing trace with hash 889538729, now seen corresponding path program 1 times [2018-11-18 08:37:24,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:24,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:24,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:24,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:37:24,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:25,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:37:25,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:37:25,042 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:37:25,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:25,043 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 1 times [2018-11-18 08:37:25,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:25,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:25,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:37:25,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:25,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:37:25,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:37:25,068 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-18 08:37:25,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:37:25,075 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-18 08:37:25,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:37:25,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2018-11-18 08:37:25,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:25,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 15 transitions. [2018-11-18 08:37:25,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 08:37:25,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 08:37:25,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2018-11-18 08:37:25,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:37:25,077 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-18 08:37:25,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2018-11-18 08:37:25,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-11-18 08:37:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 08:37:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-18 08:37:25,078 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-18 08:37:25,078 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-18 08:37:25,078 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 08:37:25,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2018-11-18 08:37:25,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:25,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:37:25,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:37:25,079 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:37:25,079 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:37:25,079 INFO L794 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 180#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 181#L28-4 assume true; 185#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 186#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 191#L28-4 assume true; 183#L28-1 assume !(main_~j~0 < 10); 184#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + 4 * main_~i~0, 4);call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + 4 * main_~i~0;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 187#L38 assume main_#t~mem11 > 0;havoc main_#t~mem11;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem14;havoc main_#t~mem13.base, main_#t~mem13.offset; 188#L40-4 [2018-11-18 08:37:25,079 INFO L796 eck$LassoCheckResult]: Loop: 188#L40-4 assume true; 190#L40-1 call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 189#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre16; 188#L40-4 [2018-11-18 08:37:25,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:25,080 INFO L82 PathProgramCache]: Analyzing trace with hash 351309099, now seen corresponding path program 1 times [2018-11-18 08:37:25,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:25,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:25,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:37:25,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:25,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:37:25,104 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:37:25,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:37:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:25,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:25,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:37:25,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 08:37:25,177 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:37:25,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:25,178 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 2 times [2018-11-18 08:37:25,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:25,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:25,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:37:25,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:25,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:37:25,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:37:25,215 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-18 08:37:25,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:37:25,232 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-18 08:37:25,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:37:25,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2018-11-18 08:37:25,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:25,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 18 transitions. [2018-11-18 08:37:25,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 08:37:25,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 08:37:25,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2018-11-18 08:37:25,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:37:25,234 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-18 08:37:25,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2018-11-18 08:37:25,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-11-18 08:37:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 08:37:25,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-18 08:37:25,236 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-18 08:37:25,236 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-18 08:37:25,236 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 08:37:25,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-11-18 08:37:25,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:25,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:37:25,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:37:25,237 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 08:37:25,237 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:37:25,237 INFO L794 eck$LassoCheckResult]: Stem: 244#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 242#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 243#L28-4 assume true; 253#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 256#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 254#L28-4 assume true; 247#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 248#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 255#L28-4 assume true; 245#L28-1 assume !(main_~j~0 < 10); 246#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + 4 * main_~i~0, 4);call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + 4 * main_~i~0;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 249#L38 assume main_#t~mem11 > 0;havoc main_#t~mem11;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem14;havoc main_#t~mem13.base, main_#t~mem13.offset; 250#L40-4 [2018-11-18 08:37:25,237 INFO L796 eck$LassoCheckResult]: Loop: 250#L40-4 assume true; 252#L40-1 call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 251#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre16; 250#L40-4 [2018-11-18 08:37:25,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:25,238 INFO L82 PathProgramCache]: Analyzing trace with hash -934682263, now seen corresponding path program 2 times [2018-11-18 08:37:25,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:25,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:25,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:25,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:25,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:37:25,267 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:37:25,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 08:37:25,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 08:37:25,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:37:25,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:25,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:37:25,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 08:37:25,338 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:37:25,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:25,338 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 3 times [2018-11-18 08:37:25,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:25,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:25,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:25,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:25,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:37:25,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:37:25,387 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-18 08:37:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:37:25,400 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-18 08:37:25,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:37:25,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2018-11-18 08:37:25,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:25,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 21 transitions. [2018-11-18 08:37:25,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 08:37:25,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 08:37:25,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2018-11-18 08:37:25,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:37:25,402 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-18 08:37:25,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2018-11-18 08:37:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-11-18 08:37:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 08:37:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-18 08:37:25,403 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-18 08:37:25,403 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-18 08:37:25,403 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 08:37:25,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 19 transitions. [2018-11-18 08:37:25,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:25,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:37:25,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:37:25,404 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1, 1, 1] [2018-11-18 08:37:25,404 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:37:25,405 INFO L794 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 320#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 321#L28-4 assume true; 331#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 337#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 332#L28-4 assume true; 325#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 326#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 333#L28-4 assume true; 335#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 336#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 334#L28-4 assume true; 323#L28-1 assume !(main_~j~0 < 10); 324#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + 4 * main_~i~0, 4);call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + 4 * main_~i~0;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 327#L38 assume main_#t~mem11 > 0;havoc main_#t~mem11;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem14;havoc main_#t~mem13.base, main_#t~mem13.offset; 328#L40-4 [2018-11-18 08:37:25,405 INFO L796 eck$LassoCheckResult]: Loop: 328#L40-4 assume true; 330#L40-1 call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 329#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre16; 328#L40-4 [2018-11-18 08:37:25,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:25,405 INFO L82 PathProgramCache]: Analyzing trace with hash -795067285, now seen corresponding path program 3 times [2018-11-18 08:37:25,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:25,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:25,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:25,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:25,448 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:25,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:37:25,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:37:25,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 08:37:25,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 08:37:25,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:37:25,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:25,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:37:25,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 08:37:25,523 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:37:25,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:25,524 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 4 times [2018-11-18 08:37:25,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:25,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:25,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:25,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:25,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 08:37:25,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:37:25,539 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-18 08:37:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:37:25,555 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-18 08:37:25,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:37:25,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2018-11-18 08:37:25,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:25,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 24 transitions. [2018-11-18 08:37:25,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 08:37:25,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 08:37:25,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2018-11-18 08:37:25,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:37:25,560 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-18 08:37:25,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2018-11-18 08:37:25,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-18 08:37:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 08:37:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-18 08:37:25,561 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-18 08:37:25,561 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-18 08:37:25,562 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 08:37:25,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2018-11-18 08:37:25,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:25,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:37:25,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:37:25,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1, 1, 1] [2018-11-18 08:37:25,563 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:37:25,563 INFO L794 eck$LassoCheckResult]: Stem: 416#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 414#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 415#L28-4 assume true; 419#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 420#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 425#L28-4 assume true; 426#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 434#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 433#L28-4 assume true; 432#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 431#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 430#L28-4 assume true; 428#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 429#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 427#L28-4 assume true; 417#L28-1 assume !(main_~j~0 < 10); 418#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + 4 * main_~i~0, 4);call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + 4 * main_~i~0;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 421#L38 assume main_#t~mem11 > 0;havoc main_#t~mem11;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem14;havoc main_#t~mem13.base, main_#t~mem13.offset; 422#L40-4 [2018-11-18 08:37:25,563 INFO L796 eck$LassoCheckResult]: Loop: 422#L40-4 assume true; 424#L40-1 call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 423#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre16; 422#L40-4 [2018-11-18 08:37:25,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:25,563 INFO L82 PathProgramCache]: Analyzing trace with hash 946399785, now seen corresponding path program 4 times [2018-11-18 08:37:25,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:25,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:25,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:25,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:25,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:37:25,645 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:37:25,659 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 08:37:25,711 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 08:37:25,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:37:25,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:25,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:37:25,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 08:37:25,753 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:37:25,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:25,754 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 5 times [2018-11-18 08:37:25,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:25,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:25,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:25,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:25,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 08:37:25,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 08:37:25,782 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-11-18 08:37:25,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:37:25,817 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-18 08:37:25,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 08:37:25,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2018-11-18 08:37:25,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:25,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 26 states and 27 transitions. [2018-11-18 08:37:25,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 08:37:25,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 08:37:25,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2018-11-18 08:37:25,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:37:25,820 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-18 08:37:25,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2018-11-18 08:37:25,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-18 08:37:25,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 08:37:25,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-18 08:37:25,822 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-18 08:37:25,822 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-18 08:37:25,822 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 08:37:25,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 25 transitions. [2018-11-18 08:37:25,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:25,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:37:25,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:37:25,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1, 1, 1] [2018-11-18 08:37:25,827 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:37:25,827 INFO L794 eck$LassoCheckResult]: Stem: 526#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 524#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 525#L28-4 assume true; 529#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 530#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 535#L28-4 assume true; 536#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 547#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 546#L28-4 assume true; 545#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 544#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 543#L28-4 assume true; 542#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 541#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 540#L28-4 assume true; 538#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 539#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 537#L28-4 assume true; 527#L28-1 assume !(main_~j~0 < 10); 528#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + 4 * main_~i~0, 4);call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + 4 * main_~i~0;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 531#L38 assume main_#t~mem11 > 0;havoc main_#t~mem11;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem14;havoc main_#t~mem13.base, main_#t~mem13.offset; 532#L40-4 [2018-11-18 08:37:25,827 INFO L796 eck$LassoCheckResult]: Loop: 532#L40-4 assume true; 534#L40-1 call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 533#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre16; 532#L40-4 [2018-11-18 08:37:25,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:25,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2081913771, now seen corresponding path program 5 times [2018-11-18 08:37:25,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:25,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:25,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:25,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:25,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:37:25,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:37:25,910 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 08:37:26,263 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 08:37:26,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:37:26,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:26,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:37:26,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 08:37:26,306 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:37:26,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:26,307 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 6 times [2018-11-18 08:37:26,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:26,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:26,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:26,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:26,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:26,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 08:37:26,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 08:37:26,326 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. cyclomatic complexity: 3 Second operand 9 states. [2018-11-18 08:37:26,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:37:26,349 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-18 08:37:26,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 08:37:26,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 31 transitions. [2018-11-18 08:37:26,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:26,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 30 transitions. [2018-11-18 08:37:26,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 08:37:26,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 08:37:26,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2018-11-18 08:37:26,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:37:26,354 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-18 08:37:26,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2018-11-18 08:37:26,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-18 08:37:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 08:37:26,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-18 08:37:26,355 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-18 08:37:26,355 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-18 08:37:26,355 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 08:37:26,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2018-11-18 08:37:26,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:26,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:37:26,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:37:26,356 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 1, 1, 1, 1, 1] [2018-11-18 08:37:26,357 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:37:26,357 INFO L794 eck$LassoCheckResult]: Stem: 652#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 650#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 651#L28-4 assume true; 655#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 656#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 661#L28-4 assume true; 662#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 676#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 675#L28-4 assume true; 674#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 673#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 672#L28-4 assume true; 671#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 670#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 669#L28-4 assume true; 668#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 667#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 666#L28-4 assume true; 664#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 665#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 663#L28-4 assume true; 653#L28-1 assume !(main_~j~0 < 10); 654#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + 4 * main_~i~0, 4);call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + 4 * main_~i~0;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 657#L38 assume main_#t~mem11 > 0;havoc main_#t~mem11;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem14;havoc main_#t~mem13.base, main_#t~mem13.offset; 658#L40-4 [2018-11-18 08:37:26,357 INFO L796 eck$LassoCheckResult]: Loop: 658#L40-4 assume true; 660#L40-1 call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 659#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre16; 658#L40-4 [2018-11-18 08:37:26,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:26,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1278319895, now seen corresponding path program 6 times [2018-11-18 08:37:26,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:26,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:26,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:26,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:26,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:26,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:37:26,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:37:26,430 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 08:37:26,796 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 08:37:26,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:37:26,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:26,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:37:26,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 08:37:26,823 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:37:26,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:26,823 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 7 times [2018-11-18 08:37:26,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:26,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:26,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:26,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:26,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:26,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 08:37:26,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 08:37:26,847 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 10 states. [2018-11-18 08:37:26,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:37:26,867 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-18 08:37:26,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 08:37:26,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 34 transitions. [2018-11-18 08:37:26,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:26,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 33 transitions. [2018-11-18 08:37:26,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 08:37:26,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 08:37:26,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 33 transitions. [2018-11-18 08:37:26,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:37:26,869 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-18 08:37:26,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 33 transitions. [2018-11-18 08:37:26,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-18 08:37:26,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 08:37:26,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-18 08:37:26,870 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-18 08:37:26,871 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-18 08:37:26,871 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 08:37:26,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 31 transitions. [2018-11-18 08:37:26,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:26,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:37:26,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:37:26,872 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 1, 1, 1, 1, 1] [2018-11-18 08:37:26,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:37:26,872 INFO L794 eck$LassoCheckResult]: Stem: 794#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 792#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 793#L28-4 assume true; 797#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 798#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 803#L28-4 assume true; 804#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 821#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 820#L28-4 assume true; 819#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 818#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 817#L28-4 assume true; 816#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 815#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 814#L28-4 assume true; 813#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 812#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 811#L28-4 assume true; 810#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 809#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 808#L28-4 assume true; 806#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 807#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 805#L28-4 assume true; 795#L28-1 assume !(main_~j~0 < 10); 796#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + 4 * main_~i~0, 4);call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + 4 * main_~i~0;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 799#L38 assume main_#t~mem11 > 0;havoc main_#t~mem11;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem14;havoc main_#t~mem13.base, main_#t~mem13.offset; 800#L40-4 [2018-11-18 08:37:26,872 INFO L796 eck$LassoCheckResult]: Loop: 800#L40-4 assume true; 802#L40-1 call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 801#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre16; 800#L40-4 [2018-11-18 08:37:26,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:26,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1098271467, now seen corresponding path program 7 times [2018-11-18 08:37:26,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:26,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:26,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:26,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:37:26,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:26,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:37:26,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:37:26,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:37:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:26,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:27,001 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:27,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:37:27,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 08:37:27,029 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:37:27,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:27,029 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 8 times [2018-11-18 08:37:27,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:27,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:27,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:27,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:37:27,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:27,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 08:37:27,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 08:37:27,055 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. cyclomatic complexity: 3 Second operand 11 states. [2018-11-18 08:37:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:37:27,083 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-18 08:37:27,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 08:37:27,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 37 transitions. [2018-11-18 08:37:27,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:27,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 36 transitions. [2018-11-18 08:37:27,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 08:37:27,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 08:37:27,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 36 transitions. [2018-11-18 08:37:27,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:37:27,085 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-18 08:37:27,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 36 transitions. [2018-11-18 08:37:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-18 08:37:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 08:37:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-18 08:37:27,086 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-18 08:37:27,087 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-18 08:37:27,087 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 08:37:27,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 34 transitions. [2018-11-18 08:37:27,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:27,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:37:27,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:37:27,088 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 1, 1, 1, 1, 1] [2018-11-18 08:37:27,088 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:37:27,088 INFO L794 eck$LassoCheckResult]: Stem: 952#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 950#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 951#L28-4 assume true; 955#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 956#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 961#L28-4 assume true; 962#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 982#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 981#L28-4 assume true; 980#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 979#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 978#L28-4 assume true; 977#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 976#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 975#L28-4 assume true; 974#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 973#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 972#L28-4 assume true; 971#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 970#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 969#L28-4 assume true; 968#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 967#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 966#L28-4 assume true; 964#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 965#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 963#L28-4 assume true; 953#L28-1 assume !(main_~j~0 < 10); 954#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + 4 * main_~i~0, 4);call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + 4 * main_~i~0;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 957#L38 assume main_#t~mem11 > 0;havoc main_#t~mem11;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem14;havoc main_#t~mem13.base, main_#t~mem13.offset; 958#L40-4 [2018-11-18 08:37:27,088 INFO L796 eck$LassoCheckResult]: Loop: 958#L40-4 assume true; 960#L40-1 call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 959#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre16; 958#L40-4 [2018-11-18 08:37:27,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:27,088 INFO L82 PathProgramCache]: Analyzing trace with hash -404337751, now seen corresponding path program 8 times [2018-11-18 08:37:27,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:27,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:27,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:27,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:27,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:27,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:37:27,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:37:27,174 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 08:37:27,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 08:37:27,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:37:27,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:27,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:37:27,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 08:37:27,218 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:37:27,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:27,218 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 9 times [2018-11-18 08:37:27,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:27,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:27,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:27,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:27,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:27,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 08:37:27,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 08:37:27,245 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-18 08:37:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:37:27,271 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-18 08:37:27,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 08:37:27,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 40 transitions. [2018-11-18 08:37:27,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:27,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 38 states and 39 transitions. [2018-11-18 08:37:27,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 08:37:27,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 08:37:27,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 39 transitions. [2018-11-18 08:37:27,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:37:27,274 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-18 08:37:27,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 39 transitions. [2018-11-18 08:37:27,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-18 08:37:27,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 08:37:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-18 08:37:27,276 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-18 08:37:27,276 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-18 08:37:27,276 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 08:37:27,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 37 transitions. [2018-11-18 08:37:27,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:27,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:37:27,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:37:27,277 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 1, 1, 1, 1, 1] [2018-11-18 08:37:27,277 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:37:27,277 INFO L794 eck$LassoCheckResult]: Stem: 1126#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1124#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 1125#L28-4 assume true; 1129#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1130#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1135#L28-4 assume true; 1136#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1159#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1158#L28-4 assume true; 1157#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1156#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1155#L28-4 assume true; 1154#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1153#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1152#L28-4 assume true; 1151#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1150#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1149#L28-4 assume true; 1148#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1147#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1146#L28-4 assume true; 1145#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1144#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1143#L28-4 assume true; 1142#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1141#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1140#L28-4 assume true; 1138#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1139#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1137#L28-4 assume true; 1127#L28-1 assume !(main_~j~0 < 10); 1128#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + 4 * main_~i~0, 4);call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + 4 * main_~i~0;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1131#L38 assume main_#t~mem11 > 0;havoc main_#t~mem11;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem14;havoc main_#t~mem13.base, main_#t~mem13.offset; 1132#L40-4 [2018-11-18 08:37:27,277 INFO L796 eck$LassoCheckResult]: Loop: 1132#L40-4 assume true; 1134#L40-1 call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 1133#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre16; 1132#L40-4 [2018-11-18 08:37:27,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:27,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1808575019, now seen corresponding path program 9 times [2018-11-18 08:37:27,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:27,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:27,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:27,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:27,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:27,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:37:27,345 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b37dadf2-553c-413d-88d5-940f97aa8455/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:37:27,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 08:37:29,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-18 08:37:29,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:37:29,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:29,901 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:29,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:37:29,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-18 08:37:29,919 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:37:29,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:29,919 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 10 times [2018-11-18 08:37:29,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:29,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:29,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:29,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:29,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:29,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 08:37:29,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 08:37:29,946 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. cyclomatic complexity: 3 Second operand 13 states. [2018-11-18 08:37:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:37:29,974 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-18 08:37:29,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 08:37:29,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 42 transitions. [2018-11-18 08:37:29,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:29,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 41 transitions. [2018-11-18 08:37:29,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 08:37:29,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 08:37:29,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 41 transitions. [2018-11-18 08:37:29,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:37:29,976 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-18 08:37:29,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 41 transitions. [2018-11-18 08:37:29,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-18 08:37:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 08:37:29,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-18 08:37:29,978 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-18 08:37:29,978 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-18 08:37:29,979 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 08:37:29,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 40 transitions. [2018-11-18 08:37:29,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:37:29,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:37:29,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:37:29,980 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1, 1, 1] [2018-11-18 08:37:29,980 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:37:29,980 INFO L794 eck$LassoCheckResult]: Stem: 1315#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1313#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 1314#L28-4 assume true; 1318#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1319#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1324#L28-4 assume true; 1325#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1351#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1350#L28-4 assume true; 1349#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1348#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1347#L28-4 assume true; 1346#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1345#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1344#L28-4 assume true; 1343#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1342#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1341#L28-4 assume true; 1340#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1339#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1338#L28-4 assume true; 1337#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1336#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1335#L28-4 assume true; 1334#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1333#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1332#L28-4 assume true; 1331#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1330#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1329#L28-4 assume true; 1327#L28-1 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1328#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1326#L28-4 assume true; 1316#L28-1 assume !(main_~j~0 < 10); 1317#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + 4 * main_~i~0, 4);call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + 4 * main_~i~0;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1320#L38 assume main_#t~mem11 > 0;havoc main_#t~mem11;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem14;havoc main_#t~mem13.base, main_#t~mem13.offset; 1321#L40-4 [2018-11-18 08:37:29,980 INFO L796 eck$LassoCheckResult]: Loop: 1321#L40-4 assume true; 1323#L40-1 call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 1322#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre16; 1321#L40-4 [2018-11-18 08:37:29,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:29,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1055087511, now seen corresponding path program 10 times [2018-11-18 08:37:29,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:29,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:29,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:29,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:29,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:30,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:30,040 INFO L82 PathProgramCache]: Analyzing trace with hash 55678, now seen corresponding path program 11 times [2018-11-18 08:37:30,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:30,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:30,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:30,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:30,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:30,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:30,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1541342186, now seen corresponding path program 1 times [2018-11-18 08:37:30,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:30,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:30,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:30,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:30,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:40:09,380 WARN L180 SmtUtils]: Spent 2.65 m on a formula simplification. DAG size of input: 492 DAG size of output: 380 [2018-11-18 08:40:16,071 WARN L180 SmtUtils]: Spent 6.67 s on a formula simplification that was a NOOP. DAG size: 228 [2018-11-18 08:40:16,074 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:40:16,074 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:40:16,074 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:40:16,075 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:40:16,075 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:40:16,075 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:40:16,075 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:40:16,075 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:40:16,075 INFO L131 ssoRankerPreferences]: Filename of dumped script: test27_false-unreach-call_true-termination.c_Iteration12_Lasso [2018-11-18 08:40:16,075 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:40:16,075 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:40:16,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:16,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:23,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:40:23,199 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:40:23,199 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:40:23,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:40:23,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:40:23,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:40:23,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:40:23,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:40:23,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:40:23,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,244 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:40:23,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,245 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:40:23,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:40:23,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:40:23,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:40:23,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:40:23,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:40:23,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:40:23,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:40:23,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:40:23,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:40:23,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:40:23,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:40:23,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:40:23,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:40:23,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,273 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:40:23,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,274 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:40:23,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:40:23,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:40:23,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:40:23,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:40:23,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:40:23,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:40:23,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:40:23,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,293 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:40:23,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,294 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:40:23,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:40:23,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:40:23,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:40:23,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:40:23,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:40:23,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:40:23,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:40:23,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:40:23,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:40:23,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:40:23,303 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:40:23,304 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 08:40:23,304 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:40:23,305 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:40:23,305 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:40:23,305 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:40:23,305 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)_1, ULTIMATE.start_main_~i~0) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)_1 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-18 08:40:23,356 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 08:40:23,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 08:40:23,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:40:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:40:23,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:40:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:40:23,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:40:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:40:23,404 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 [2018-11-18 08:40:23,404 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 40 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-18 08:40:23,412 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 40 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 42 states and 44 transitions. Complement of second has 6 states. [2018-11-18 08:40:23,412 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 [2018-11-18 08:40:23,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:40:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-18 08:40:23,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 36 letters. Loop has 3 letters. [2018-11-18 08:40:23,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:40:23,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 39 letters. Loop has 3 letters. [2018-11-18 08:40:23,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:40:23,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 36 letters. Loop has 6 letters. [2018-11-18 08:40:23,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:40:23,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 44 transitions. [2018-11-18 08:40:23,415 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:40:23,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2018-11-18 08:40:23,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 08:40:23,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 08:40:23,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 08:40:23,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:40:23,415 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:40:23,415 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:40:23,415 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:40:23,415 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 08:40:23,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:40:23,416 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:40:23,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 08:40:23,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 08:40:23 BoogieIcfgContainer [2018-11-18 08:40:23,421 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 08:40:23,421 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:40:23,421 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:40:23,422 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:40:23,422 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:37:23" (3/4) ... [2018-11-18 08:40:23,425 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 08:40:23,425 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:40:23,426 INFO L168 Benchmark]: Toolchain (without parser) took 180039.29 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 345.5 MB). Free memory was 959.2 MB in the beginning and 922.6 MB in the end (delta: 36.6 MB). Peak memory consumption was 382.2 MB. Max. memory is 11.5 GB. [2018-11-18 08:40:23,426 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:40:23,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.94 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.6 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-18 08:40:23,427 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 943.6 MB in the beginning and 1.2 GB in the end (delta: -210.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:40:23,427 INFO L168 Benchmark]: Boogie Preprocessor took 22.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:40:23,428 INFO L168 Benchmark]: RCFGBuilder took 233.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:40:23,428 INFO L168 Benchmark]: BuchiAutomizer took 179545.07 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 922.6 MB in the end (delta: 210.7 MB). Peak memory consumption was 396.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:40:23,428 INFO L168 Benchmark]: Witness Printer took 3.71 ms. Allocated memory is still 1.4 GB. Free memory is still 922.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:40:23,431 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 162.94 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.6 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 943.6 MB in the beginning and 1.2 GB in the end (delta: -210.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 233.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 179545.07 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 922.6 MB in the end (delta: 210.7 MB). Peak memory consumption was 396.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.71 ms. Allocated memory is still 1.4 GB. Free memory is still 922.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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 -2 * j + 19 and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[pa][pa] + -1 * i and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 179.5s and 13 iterations. TraceHistogramMax:11. Analysis of lassos took 178.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 19 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 11. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 117 SDtfs, 82 SDslu, 315 SDs, 0 SdLazy, 183 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU10 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1067 mio100 ax100 hnf99 lsp97 ukn26 mio100 lsp38 div100 bol100 ite100 ukn100 eq158 hnf92 smp100 dnf100 smp100 tf102 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...