./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/reducercommutativity/sum05_true-unreach-call_true-termination.i --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_f25573cd-77c0-4b8c-bb49-4636c11b325d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/sum05_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/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 48db2505a59cdca75fbfbfb4403b26f347fcdcda ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 15:46:39,827 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:46:39,828 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:46:39,838 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:46:39,843 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:46:39,844 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:46:39,851 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:46:39,853 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:46:39,854 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:46:39,854 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:46:39,855 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:46:39,855 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:46:39,855 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:46:39,856 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:46:39,857 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:46:39,857 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:46:39,870 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:46:39,872 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:46:39,873 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:46:39,904 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:46:39,905 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:46:39,905 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:46:39,907 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:46:39,907 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:46:39,907 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:46:39,908 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:46:39,909 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:46:39,909 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:46:39,930 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:46:39,931 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:46:39,931 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:46:39,932 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:46:39,932 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:46:39,932 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:46:39,933 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:46:39,933 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:46:39,935 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 15:46:39,979 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:46:39,980 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:46:39,981 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:46:39,989 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:46:39,990 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 15:46:39,990 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 15:46:39,991 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 15:46:39,991 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 15:46:39,991 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 15:46:39,991 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 15:46:39,992 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 15:46:39,992 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:46:39,992 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:46:39,992 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 15:46:39,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:46:39,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:46:39,993 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:46:39,993 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 15:46:39,993 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 15:46:39,993 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 15:46:39,993 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:46:39,993 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:46:39,993 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 15:46:39,993 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:46:39,994 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 15:46:39,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:46:39,994 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:46:39,994 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 15:46:39,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:46:39,994 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 15:46:39,994 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 15:46:39,995 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 15:46:39,995 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_f25573cd-77c0-4b8c-bb49-4636c11b325d/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 -> 48db2505a59cdca75fbfbfb4403b26f347fcdcda [2018-11-18 15:46:40,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:46:40,075 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:46:40,078 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:46:40,080 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:46:40,086 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:46:40,086 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/sum05_true-unreach-call_true-termination.i [2018-11-18 15:46:40,170 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/bin-2019/uautomizer/data/a91fd627e/ba9a29884c64426bb539a530a0031240/FLAG18a6d4e3d [2018-11-18 15:46:40,579 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:46:40,579 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/sv-benchmarks/c/reducercommutativity/sum05_true-unreach-call_true-termination.i [2018-11-18 15:46:40,584 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/bin-2019/uautomizer/data/a91fd627e/ba9a29884c64426bb539a530a0031240/FLAG18a6d4e3d [2018-11-18 15:46:40,980 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/bin-2019/uautomizer/data/a91fd627e/ba9a29884c64426bb539a530a0031240 [2018-11-18 15:46:40,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:46:40,985 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:46:40,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:46:40,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:46:40,988 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:46:40,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:46:40" (1/1) ... [2018-11-18 15:46:40,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a3e495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:40, skipping insertion in model container [2018-11-18 15:46:40,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:46:40" (1/1) ... [2018-11-18 15:46:41,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:46:41,022 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:46:41,228 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:46:41,237 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:46:41,254 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:46:41,264 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:46:41,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:41 WrapperNode [2018-11-18 15:46:41,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:46:41,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:46:41,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:46:41,265 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:46:41,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:41" (1/1) ... [2018-11-18 15:46:41,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:41" (1/1) ... [2018-11-18 15:46:41,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:46:41,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:46:41,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:46:41,298 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:46:41,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:41" (1/1) ... [2018-11-18 15:46:41,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:41" (1/1) ... [2018-11-18 15:46:41,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:41" (1/1) ... [2018-11-18 15:46:41,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:41" (1/1) ... [2018-11-18 15:46:41,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:41" (1/1) ... [2018-11-18 15:46:41,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:41" (1/1) ... [2018-11-18 15:46:41,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:41" (1/1) ... [2018-11-18 15:46:41,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:46:41,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:46:41,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:46:41,325 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:46:41,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/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 15:46:41,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 15:46:41,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:46:41,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:46:41,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:46:41,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 15:46:41,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 15:46:41,670 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:46:41,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:46:41 BoogieIcfgContainer [2018-11-18 15:46:41,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:46:41,671 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 15:46:41,671 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 15:46:41,681 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 15:46:41,682 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:46:41,682 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 03:46:40" (1/3) ... [2018-11-18 15:46:41,683 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d1bf31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:46:41, skipping insertion in model container [2018-11-18 15:46:41,683 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:46:41,683 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:41" (2/3) ... [2018-11-18 15:46:41,684 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d1bf31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:46:41, skipping insertion in model container [2018-11-18 15:46:41,684 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:46:41,684 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:46:41" (3/3) ... [2018-11-18 15:46:41,685 INFO L375 chiAutomizerObserver]: Analyzing ICFG sum05_true-unreach-call_true-termination.i [2018-11-18 15:46:41,734 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:46:41,735 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 15:46:41,735 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 15:46:41,735 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 15:46:41,735 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:46:41,735 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:46:41,736 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 15:46:41,736 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:46:41,736 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 15:46:41,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-18 15:46:41,761 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2018-11-18 15:46:41,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:46:41,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:46:41,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:46:41,768 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:46:41,768 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 15:46:41,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-18 15:46:41,770 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2018-11-18 15:46:41,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:46:41,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:46:41,771 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:46:41,771 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:46:41,777 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 26#L23-4true [2018-11-18 15:46:41,778 INFO L796 eck$LassoCheckResult]: Loop: 26#L23-4true assume true; 13#L23-1true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 29#L23-3true main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26#L23-4true [2018-11-18 15:46:41,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:41,782 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 15:46:41,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:41,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:41,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:41,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:41,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:41,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:41,859 INFO L82 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2018-11-18 15:46:41,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:41,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:41,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:41,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:41,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:41,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:41,879 INFO L82 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2018-11-18 15:46:41,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:41,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:41,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:41,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:41,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:42,069 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:46:42,070 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:46:42,070 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:46:42,070 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:46:42,070 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:46:42,071 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:46:42,071 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:46:42,071 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:46:42,071 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum05_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-18 15:46:42,071 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:46:42,071 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:46:42,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 15:46:42,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 15:46:42,105 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 15:46:42,107 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 15:46:42,109 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 15:46:42,123 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 15:46:42,130 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 15:46:42,134 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 15:46:42,172 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 15:46:42,176 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 15:46:42,178 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 15:46:42,186 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 15:46:42,196 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 15:46:42,202 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 15:46:42,204 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 15:46:42,210 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 15:46:42,214 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 15:46:42,216 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 15:46:42,452 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:46:42,455 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:46:42,457 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 15:46:42,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:42,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:46:42,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:42,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:42,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:42,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:46:42,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:46:42,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:42,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:46:42,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:42,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:46:42,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:42,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:42,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:42,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:46:42,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:46:42,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:42,469 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 15:46:42,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:42,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:46:42,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:42,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:42,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:42,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:46:42,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:46:42,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:42,475 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 15:46:42,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:42,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:46:42,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:42,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:42,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:42,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:46:42,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:46:42,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:42,482 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 15:46:42,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:42,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:42,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:42,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:42,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:46:42,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:46:42,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:42,499 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 15:46:42,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:42,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:46:42,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:42,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:42,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:42,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:46:42,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:46:42,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:42,506 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 15:46:42,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:42,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:46:42,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:42,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:42,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:42,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:46:42,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:46:42,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:42,513 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 15:46:42,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:42,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:46:42,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:42,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:42,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:42,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:46:42,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:46:42,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:42,517 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 15:46:42,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:42,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:42,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:42,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:42,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:46:42,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:46:42,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:42,531 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 15:46:42,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:42,531 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:46:42,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:42,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:42,533 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:46:42,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:46:42,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:42,554 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 15:46:42,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:42,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:42,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:42,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:42,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:46:42,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:46:42,615 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:46:42,648 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 15:46:42,648 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 15:46:42,651 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:46:42,655 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:46:42,656 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:46:42,656 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_main_~i~1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-18 15:46:42,663 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-18 15:46:42,669 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 15:46:42,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:42,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:42,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:42,771 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 15:46:42,782 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 15:46:42,784 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 4 states. [2018-11-18 15:46:42,884 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states.. Second operand 4 states. Result 80 states and 104 transitions. Complement of second has 8 states. [2018-11-18 15:46:42,884 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 15:46:42,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:46:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2018-11-18 15:46:42,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-18 15:46:42,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:46:42,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 15:46:42,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:46:42,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 15:46:42,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:46:42,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 104 transitions. [2018-11-18 15:46:42,893 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 15:46:42,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 25 states and 30 transitions. [2018-11-18 15:46:42,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-18 15:46:42,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-18 15:46:42,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2018-11-18 15:46:42,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:46:42,898 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-18 15:46:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2018-11-18 15:46:42,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-18 15:46:42,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 15:46:42,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2018-11-18 15:46:42,917 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-18 15:46:42,917 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-18 15:46:42,917 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 15:46:42,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2018-11-18 15:46:42,918 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 15:46:42,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:46:42,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:46:42,918 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 15:46:42,918 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:46:42,919 INFO L794 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 176#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 169#L23-4 assume true; 171#L23-1 assume !(main_~i~1 < 5); 166#L23-5 assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 159#L9-4 [2018-11-18 15:46:42,919 INFO L796 eck$LassoCheckResult]: Loop: 159#L9-4 assume true; 160#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 162#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 159#L9-4 [2018-11-18 15:46:42,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:42,919 INFO L82 PathProgramCache]: Analyzing trace with hash 28694795, now seen corresponding path program 1 times [2018-11-18 15:46:42,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:42,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:42,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:42,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:42,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:42,951 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 15:46:42,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:42,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:46:42,954 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:46:42,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:42,955 INFO L82 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 1 times [2018-11-18 15:46:42,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:42,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:42,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:42,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:42,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:42,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:46:42,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:42,989 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-18 15:46:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:43,002 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-18 15:46:43,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:46:43,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2018-11-18 15:46:43,004 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 15:46:43,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 31 transitions. [2018-11-18 15:46:43,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-18 15:46:43,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-18 15:46:43,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-11-18 15:46:43,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:46:43,005 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-18 15:46:43,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-11-18 15:46:43,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-18 15:46:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 15:46:43,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-18 15:46:43,007 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-18 15:46:43,007 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-18 15:46:43,007 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 15:46:43,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2018-11-18 15:46:43,007 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 15:46:43,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:46:43,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:46:43,008 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:43,008 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:46:43,008 INFO L794 eck$LassoCheckResult]: Stem: 239#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 237#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 228#L23-4 assume true; 229#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 234#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 230#L23-4 assume true; 231#L23-1 assume !(main_~i~1 < 5); 225#L23-5 assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 218#L9-4 [2018-11-18 15:46:43,008 INFO L796 eck$LassoCheckResult]: Loop: 218#L9-4 assume true; 219#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 221#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 218#L9-4 [2018-11-18 15:46:43,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:43,008 INFO L82 PathProgramCache]: Analyzing trace with hash 149879881, now seen corresponding path program 1 times [2018-11-18 15:46:43,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:43,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:43,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:43,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:43,035 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 15:46:43,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:46:43,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/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 15:46:43,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:43,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:43,062 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 15:46:43,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:46:43,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 15:46:43,093 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:46:43,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:43,093 INFO L82 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 2 times [2018-11-18 15:46:43,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:43,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:43,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:43,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:43,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:46:43,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:46:43,140 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-18 15:46:43,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:43,172 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-18 15:46:43,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:46:43,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-11-18 15:46:43,173 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 15:46:43,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 34 transitions. [2018-11-18 15:46:43,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-18 15:46:43,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-18 15:46:43,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2018-11-18 15:46:43,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:46:43,174 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-18 15:46:43,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2018-11-18 15:46:43,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-18 15:46:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 15:46:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-18 15:46:43,176 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-18 15:46:43,176 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-18 15:46:43,176 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 15:46:43,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2018-11-18 15:46:43,177 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 15:46:43,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:46:43,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:46:43,178 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2018-11-18 15:46:43,178 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:46:43,178 INFO L794 eck$LassoCheckResult]: Stem: 323#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~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 313#L23-4 assume true; 314#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 319#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 315#L23-4 assume true; 316#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 326#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 328#L23-4 assume true; 325#L23-1 assume !(main_~i~1 < 5); 310#L23-5 assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 303#L9-4 [2018-11-18 15:46:43,178 INFO L796 eck$LassoCheckResult]: Loop: 303#L9-4 assume true; 304#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 306#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 303#L9-4 [2018-11-18 15:46:43,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:43,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1692719029, now seen corresponding path program 2 times [2018-11-18 15:46:43,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:43,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:43,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:46:43,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:43,208 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 15:46:43,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:46:43,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/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 15:46:43,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 15:46:43,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 15:46:43,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:46:43,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:43,238 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 15:46:43,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:46:43,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 15:46:43,264 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:46:43,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:43,265 INFO L82 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 3 times [2018-11-18 15:46:43,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:43,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:43,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:46:43,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:43,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:46:43,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:46:43,327 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-18 15:46:43,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:43,396 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-18 15:46:43,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:46:43,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 38 transitions. [2018-11-18 15:46:43,397 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 15:46:43,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 37 transitions. [2018-11-18 15:46:43,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-18 15:46:43,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-18 15:46:43,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2018-11-18 15:46:43,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:46:43,399 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-18 15:46:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2018-11-18 15:46:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-18 15:46:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 15:46:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-18 15:46:43,401 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-18 15:46:43,401 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-18 15:46:43,401 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 15:46:43,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2018-11-18 15:46:43,401 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 15:46:43,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:46:43,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:46:43,402 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1, 1] [2018-11-18 15:46:43,402 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:46:43,402 INFO L794 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 423#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 414#L23-4 assume true; 415#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 432#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 431#L23-4 assume true; 430#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 420#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 416#L23-4 assume true; 417#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 427#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 429#L23-4 assume true; 426#L23-1 assume !(main_~i~1 < 5); 411#L23-5 assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 404#L9-4 [2018-11-18 15:46:43,402 INFO L796 eck$LassoCheckResult]: Loop: 404#L9-4 assume true; 405#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 407#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 404#L9-4 [2018-11-18 15:46:43,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:43,402 INFO L82 PathProgramCache]: Analyzing trace with hash -579836663, now seen corresponding path program 3 times [2018-11-18 15:46:43,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:43,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:43,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:46:43,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:43,456 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 15:46:43,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:46:43,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/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 15:46:43,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 15:46:43,478 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 15:46:43,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:46:43,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:43,492 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 15:46:43,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:46:43,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 15:46:43,511 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:46:43,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:43,511 INFO L82 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 4 times [2018-11-18 15:46:43,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:43,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:43,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:46:43,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:43,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:46:43,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:46:43,555 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-18 15:46:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:43,581 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-18 15:46:43,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:46:43,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2018-11-18 15:46:43,584 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 15:46:43,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 40 transitions. [2018-11-18 15:46:43,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-18 15:46:43,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-18 15:46:43,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 40 transitions. [2018-11-18 15:46:43,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:46:43,586 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-18 15:46:43,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 40 transitions. [2018-11-18 15:46:43,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-18 15:46:43,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 15:46:43,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-18 15:46:43,588 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-18 15:46:43,588 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-18 15:46:43,588 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 15:46:43,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 38 transitions. [2018-11-18 15:46:43,589 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 15:46:43,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:46:43,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:46:43,590 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1, 1] [2018-11-18 15:46:43,590 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:46:43,590 INFO L794 eck$LassoCheckResult]: Stem: 542#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 539#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 531#L23-4 assume true; 532#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 552#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 533#L23-4 assume true; 534#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 537#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 538#L23-4 assume true; 551#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 550#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 549#L23-4 assume true; 547#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 548#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 546#L23-4 assume true; 544#L23-1 assume !(main_~i~1 < 5); 528#L23-5 assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 521#L9-4 [2018-11-18 15:46:43,590 INFO L796 eck$LassoCheckResult]: Loop: 521#L9-4 assume true; 522#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 524#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 521#L9-4 [2018-11-18 15:46:43,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:43,590 INFO L82 PathProgramCache]: Analyzing trace with hash 446171019, now seen corresponding path program 4 times [2018-11-18 15:46:43,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:43,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:43,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:46:43,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:43,689 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 15:46:43,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:46:43,689 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/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 15:46:43,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 15:46:43,707 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 15:46:43,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:46:43,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:43,730 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 15:46:43,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:46:43,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 15:46:43,747 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:46:43,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:43,747 INFO L82 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 5 times [2018-11-18 15:46:43,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:43,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:43,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:46:43,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:43,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:46:43,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:46:43,788 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-11-18 15:46:43,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:43,813 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-18 15:46:43,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:46:43,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 43 transitions. [2018-11-18 15:46:43,815 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 15:46:43,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 38 states and 42 transitions. [2018-11-18 15:46:43,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-18 15:46:43,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-18 15:46:43,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 42 transitions. [2018-11-18 15:46:43,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:46:43,816 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-18 15:46:43,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 42 transitions. [2018-11-18 15:46:43,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-18 15:46:43,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 15:46:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-18 15:46:43,818 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-18 15:46:43,818 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-18 15:46:43,818 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 15:46:43,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2018-11-18 15:46:43,818 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 15:46:43,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:46:43,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:46:43,819 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1, 1] [2018-11-18 15:46:43,819 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:46:43,819 INFO L794 eck$LassoCheckResult]: Stem: 675#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 671#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 663#L23-4 assume true; 664#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 687#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 665#L23-4 assume true; 666#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 669#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 670#L23-4 assume true; 686#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 685#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 684#L23-4 assume true; 683#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 682#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 681#L23-4 assume true; 679#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 680#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 678#L23-4 assume true; 676#L23-1 assume !(main_~i~1 < 5); 660#L23-5 assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 653#L9-4 [2018-11-18 15:46:43,819 INFO L796 eck$LassoCheckResult]: Loop: 653#L9-4 assume true; 654#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 656#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 653#L9-4 [2018-11-18 15:46:43,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:43,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1041220151, now seen corresponding path program 5 times [2018-11-18 15:46:43,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:43,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:43,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:46:43,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:43,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:43,838 INFO L82 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 6 times [2018-11-18 15:46:43,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:43,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:43,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:46:43,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:43,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:43,846 INFO L82 PathProgramCache]: Analyzing trace with hash -735685714, now seen corresponding path program 1 times [2018-11-18 15:46:43,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:43,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:43,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:46:43,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:44,384 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 100 [2018-11-18 15:46:44,465 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:46:44,465 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:46:44,465 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:46:44,465 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:46:44,465 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:46:44,465 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:46:44,465 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:46:44,465 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:46:44,465 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum05_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-18 15:46:44,465 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:46:44,465 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:46:44,468 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 15:46:44,486 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 15:46:44,487 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 15:46:44,489 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 15:46:44,491 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 15:46:44,492 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 15:46:44,493 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 15:46:44,594 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 15:46:44,596 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 15:46:44,602 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 15:46:44,605 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 15:46:44,607 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 15:46:44,608 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 15:46:44,610 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 15:46:44,611 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 15:46:44,613 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 15:46:44,614 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 15:46:44,616 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 15:46:44,617 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 15:46:44,618 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 15:46:44,620 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 15:46:44,622 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 15:46:44,623 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 15:46:44,854 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:46:44,854 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:46:44,854 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 15:46:44,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:44,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:46:44,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:44,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:44,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:44,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:46:44,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:46:44,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:44,856 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 15:46:44,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:44,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:46:44,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:44,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:44,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:44,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:46:44,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:46:44,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:44,862 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 15:46:44,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:44,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:44,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:44,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:44,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:46:44,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:46:44,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:44,866 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 15:46:44,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:44,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:46:44,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:44,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:44,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:44,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:46:44,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:46:44,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:44,867 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 15:46:44,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:44,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:46:44,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:44,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:44,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:44,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:46:44,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:46:44,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:44,869 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 15:46:44,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:44,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:46:44,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:44,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:44,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:44,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:46:44,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:46:44,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:44,871 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 15:46:44,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:44,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:44,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:44,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:44,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:46:44,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:46:44,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:44,882 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 15:46:44,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:44,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:44,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:44,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:44,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:46:44,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:46:44,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:44,889 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 15:46:44,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:44,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:44,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:44,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:44,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:46:44,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:46:44,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:44,893 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 15:46:44,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:44,893 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:46:44,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:44,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:44,895 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:46:44,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:46:44,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:46:44,901 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 15:46:44,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:46:44,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:46:44,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:46:44,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:46:44,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:46:44,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:46:44,934 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:46:44,951 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 15:46:44,951 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 15:46:44,952 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:46:44,953 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:46:44,953 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:46:44,953 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0) = -2*ULTIMATE.start_sum_~i~0 + 9 Supporting invariants [] [2018-11-18 15:46:45,004 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 15:46:45,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:45,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:45,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:45,043 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 15:46:45,043 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 15:46:45,043 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-18 15:46:45,056 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 42 states and 47 transitions. Complement of second has 7 states. [2018-11-18 15:46:45,057 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 15:46:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:46:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-18 15:46:45,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-18 15:46:45,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:46:45,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 23 letters. Loop has 3 letters. [2018-11-18 15:46:45,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:46:45,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 20 letters. Loop has 6 letters. [2018-11-18 15:46:45,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:46:45,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 47 transitions. [2018-11-18 15:46:45,060 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-18 15:46:45,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 39 states and 44 transitions. [2018-11-18 15:46:45,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 15:46:45,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-18 15:46:45,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 44 transitions. [2018-11-18 15:46:45,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:46:45,060 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-18 15:46:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 44 transitions. [2018-11-18 15:46:45,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-18 15:46:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 15:46:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-18 15:46:45,062 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-18 15:46:45,062 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-18 15:46:45,062 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 15:46:45,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. [2018-11-18 15:46:45,063 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-18 15:46:45,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:46:45,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:46:45,063 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:45,063 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:46:45,064 INFO L794 eck$LassoCheckResult]: Stem: 859#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 856#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 849#L23-4 assume true; 850#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 855#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 851#L23-4 assume true; 852#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 873#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 872#L23-4 assume true; 871#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 870#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 869#L23-4 assume true; 868#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 867#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 866#L23-4 assume true; 864#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 865#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 863#L23-4 assume true; 861#L23-1 assume !(main_~i~1 < 5); 846#L23-5 assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 837#L9-4 assume true; 839#L9-1 assume !(sum_~i~0 < 5); 848#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 862#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 857#L9-10 [2018-11-18 15:46:45,064 INFO L796 eck$LassoCheckResult]: Loop: 857#L9-10 assume true; 858#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 860#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 857#L9-10 [2018-11-18 15:46:45,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:45,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1331422418, now seen corresponding path program 1 times [2018-11-18 15:46:45,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:45,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:45,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:45,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:45,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 15:46:45,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:45,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:46:45,094 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:46:45,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:45,095 INFO L82 PathProgramCache]: Analyzing trace with hash 67687, now seen corresponding path program 1 times [2018-11-18 15:46:45,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:45,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:45,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:45,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:45,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:45,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:46:45,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:45,221 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-18 15:46:45,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:45,246 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-18 15:46:45,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:46:45,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 52 transitions. [2018-11-18 15:46:45,247 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-18 15:46:45,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 51 transitions. [2018-11-18 15:46:45,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-18 15:46:45,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-18 15:46:45,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 51 transitions. [2018-11-18 15:46:45,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:46:45,248 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-18 15:46:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 51 transitions. [2018-11-18 15:46:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-11-18 15:46:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 15:46:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-18 15:46:45,250 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-18 15:46:45,250 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-18 15:46:45,250 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 15:46:45,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 45 transitions. [2018-11-18 15:46:45,251 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-18 15:46:45,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:46:45,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:46:45,252 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:45,252 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:46:45,252 INFO L794 eck$LassoCheckResult]: Stem: 954#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 951#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 942#L23-4 assume true; 943#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 948#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 944#L23-4 assume true; 945#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 968#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 967#L23-4 assume true; 966#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 965#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 964#L23-4 assume true; 963#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 962#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 960#L23-4 assume true; 958#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 959#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 957#L23-4 assume true; 955#L23-1 assume !(main_~i~1 < 5); 939#L23-5 assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 930#L9-4 assume true; 931#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 935#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 932#L9-4 assume true; 933#L9-1 assume !(sum_~i~0 < 5); 941#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 956#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 949#L9-10 assume true; 950#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 952#L9-9 [2018-11-18 15:46:45,252 INFO L796 eck$LassoCheckResult]: Loop: 952#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 953#L9-10 assume true; 961#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 952#L9-9 [2018-11-18 15:46:45,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:45,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1586455192, now seen corresponding path program 1 times [2018-11-18 15:46:45,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:45,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:45,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:45,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:45,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 15:46:45,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:46:45,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/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 15:46:45,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:45,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 15:46:45,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:46:45,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 15:46:45,420 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:46:45,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:45,420 INFO L82 PathProgramCache]: Analyzing trace with hash 74257, now seen corresponding path program 2 times [2018-11-18 15:46:45,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:45,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:45,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:45,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:45,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:45,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:46:45,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:46:45,529 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-18 15:46:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:45,564 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-18 15:46:45,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:46:45,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 61 transitions. [2018-11-18 15:46:45,566 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-18 15:46:45,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 60 transitions. [2018-11-18 15:46:45,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-18 15:46:45,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-18 15:46:45,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 60 transitions. [2018-11-18 15:46:45,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:46:45,567 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-18 15:46:45,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 60 transitions. [2018-11-18 15:46:45,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2018-11-18 15:46:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 15:46:45,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-18 15:46:45,570 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-18 15:46:45,570 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-18 15:46:45,570 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 15:46:45,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 51 transitions. [2018-11-18 15:46:45,570 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-18 15:46:45,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:46:45,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:46:45,571 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:45,571 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:46:45,572 INFO L794 eck$LassoCheckResult]: Stem: 1144#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1141#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1134#L23-4 assume true; 1135#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1140#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1136#L23-4 assume true; 1137#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1164#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1162#L23-4 assume true; 1161#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1159#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1156#L23-4 assume true; 1155#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1154#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1153#L23-4 assume true; 1150#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1152#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1149#L23-4 assume true; 1147#L23-1 assume !(main_~i~1 < 5); 1130#L23-5 assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1120#L9-4 assume true; 1121#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1151#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1122#L9-4 assume true; 1123#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1125#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1126#L9-4 assume true; 1132#L9-1 assume !(sum_~i~0 < 5); 1133#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1148#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1142#L9-10 assume true; 1143#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1145#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1146#L9-10 assume true; 1163#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1158#L9-9 [2018-11-18 15:46:45,572 INFO L796 eck$LassoCheckResult]: Loop: 1158#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1160#L9-10 assume true; 1157#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1158#L9-9 [2018-11-18 15:46:45,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:45,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1680438657, now seen corresponding path program 1 times [2018-11-18 15:46:45,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:45,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:45,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:45,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:46:45,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:45,687 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-18 15:46:45,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:46:45,687 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/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 15:46:45,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:45,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-18 15:46:45,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:46:45,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 15:46:45,807 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:46:45,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:45,807 INFO L82 PathProgramCache]: Analyzing trace with hash 74257, now seen corresponding path program 3 times [2018-11-18 15:46:45,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:45,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:45,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:45,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:45,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:45,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:46:45,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:46:45,983 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-18 15:46:46,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:46,233 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-18 15:46:46,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:46:46,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 70 transitions. [2018-11-18 15:46:46,235 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-18 15:46:46,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 65 states and 69 transitions. [2018-11-18 15:46:46,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-18 15:46:46,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-18 15:46:46,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 69 transitions. [2018-11-18 15:46:46,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:46:46,236 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-18 15:46:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 69 transitions. [2018-11-18 15:46:46,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-11-18 15:46:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 15:46:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-11-18 15:46:46,238 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-18 15:46:46,239 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-18 15:46:46,239 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 15:46:46,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 57 transitions. [2018-11-18 15:46:46,239 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-18 15:46:46,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:46:46,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:46:46,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:46,240 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:46:46,240 INFO L794 eck$LassoCheckResult]: Stem: 1370#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1367#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1358#L23-4 assume true; 1359#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1364#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1360#L23-4 assume true; 1361#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1372#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1389#L23-4 assume true; 1388#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1387#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1385#L23-4 assume true; 1383#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1382#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1381#L23-4 assume true; 1378#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1380#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1377#L23-4 assume true; 1371#L23-1 assume !(main_~i~1 < 5); 1353#L23-5 assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1344#L9-4 assume true; 1345#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1357#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1391#L9-4 assume true; 1392#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1349#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1346#L9-4 assume true; 1347#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1379#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1376#L9-4 assume true; 1355#L9-1 assume !(sum_~i~0 < 5); 1356#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1373#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1374#L9-10 assume true; 1390#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1368#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1369#L9-10 assume true; 1394#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1393#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1365#L9-10 assume true; 1366#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1375#L9-9 [2018-11-18 15:46:46,240 INFO L796 eck$LassoCheckResult]: Loop: 1375#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1386#L9-10 assume true; 1384#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1375#L9-9 [2018-11-18 15:46:46,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:46,240 INFO L82 PathProgramCache]: Analyzing trace with hash 797173112, now seen corresponding path program 2 times [2018-11-18 15:46:46,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:46,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:46,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:46,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:46:46,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 15:46:46,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:46:46,356 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/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 15:46:46,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 15:46:46,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 15:46:46,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:46:46,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 15:46:46,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:46:46,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 15:46:46,446 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:46:46,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:46,446 INFO L82 PathProgramCache]: Analyzing trace with hash 74257, now seen corresponding path program 4 times [2018-11-18 15:46:46,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:46,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:46,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:46,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:46:46,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:46,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:46:46,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:46:46,486 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-18 15:46:46,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:46,572 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-11-18 15:46:46,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:46:46,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 79 transitions. [2018-11-18 15:46:46,574 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-18 15:46:46,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 74 states and 78 transitions. [2018-11-18 15:46:46,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-18 15:46:46,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-18 15:46:46,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 78 transitions. [2018-11-18 15:46:46,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:46:46,575 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-11-18 15:46:46,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 78 transitions. [2018-11-18 15:46:46,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 59. [2018-11-18 15:46:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 15:46:46,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-18 15:46:46,577 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-18 15:46:46,578 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-18 15:46:46,578 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 15:46:46,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 63 transitions. [2018-11-18 15:46:46,578 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-18 15:46:46,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:46:46,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:46:46,579 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:46,579 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:46:46,579 INFO L794 eck$LassoCheckResult]: Stem: 1628#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1625#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1616#L23-4 assume true; 1617#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1622#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1618#L23-4 assume true; 1619#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1630#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1647#L23-4 assume true; 1646#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1645#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1643#L23-4 assume true; 1640#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1639#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1638#L23-4 assume true; 1635#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1637#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1634#L23-4 assume true; 1629#L23-1 assume !(main_~i~1 < 5); 1612#L23-5 assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1602#L9-4 assume true; 1603#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1658#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1604#L9-4 assume true; 1605#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1607#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1608#L9-4 assume true; 1657#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1656#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1655#L9-4 assume true; 1633#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1636#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1632#L9-4 assume true; 1614#L9-1 assume !(sum_~i~0 < 5); 1615#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1631#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1623#L9-10 assume true; 1624#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1626#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1627#L9-10 assume true; 1654#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1653#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1652#L9-10 assume true; 1651#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1650#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1649#L9-10 assume true; 1648#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1642#L9-9 [2018-11-18 15:46:46,579 INFO L796 eck$LassoCheckResult]: Loop: 1642#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1644#L9-10 assume true; 1641#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1642#L9-9 [2018-11-18 15:46:46,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:46,580 INFO L82 PathProgramCache]: Analyzing trace with hash -341234657, now seen corresponding path program 3 times [2018-11-18 15:46:46,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:46,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:46,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:46,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:46:46,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:46,724 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-18 15:46:46,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:46:46,725 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f25573cd-77c0-4b8c-bb49-4636c11b325d/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 15:46:46,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 15:46:46,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 15:46:46,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:46:46,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-18 15:46:46,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:46:46,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 15:46:46,805 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:46:46,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:46,806 INFO L82 PathProgramCache]: Analyzing trace with hash 74257, now seen corresponding path program 5 times [2018-11-18 15:46:46,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:46,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:46,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:46,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:46:46,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:46,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:46:46,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:46:46,849 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-11-18 15:46:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:46,932 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-11-18 15:46:46,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:46:46,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 85 transitions. [2018-11-18 15:46:46,933 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-18 15:46:46,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 80 states and 84 transitions. [2018-11-18 15:46:46,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-18 15:46:46,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-11-18 15:46:46,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 84 transitions. [2018-11-18 15:46:46,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:46:46,934 INFO L705 BuchiCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-11-18 15:46:46,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 84 transitions. [2018-11-18 15:46:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2018-11-18 15:46:46,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-18 15:46:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-18 15:46:46,936 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-18 15:46:46,936 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-18 15:46:46,936 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 15:46:46,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 69 transitions. [2018-11-18 15:46:46,936 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-18 15:46:46,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:46:46,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:46:46,937 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:46,937 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:46:46,937 INFO L794 eck$LassoCheckResult]: Stem: 1914#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1911#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1904#L23-4 assume true; 1905#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1910#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1906#L23-4 assume true; 1907#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1918#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1935#L23-4 assume true; 1934#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1932#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1929#L23-4 assume true; 1928#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1927#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1926#L23-4 assume true; 1923#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1925#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1922#L23-4 assume true; 1917#L23-1 assume !(main_~i~1 < 5); 1900#L23-5 assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1891#L9-4 assume true; 1892#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1896#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1893#L9-4 assume true; 1894#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1953#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1952#L9-4 assume true; 1951#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1950#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1949#L9-4 assume true; 1948#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1947#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1945#L9-4 assume true; 1921#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1924#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1920#L9-4 assume true; 1902#L9-1 assume !(sum_~i~0 < 5); 1903#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1919#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1912#L9-10 assume true; 1913#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1915#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1916#L9-10 assume true; 1946#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1944#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1943#L9-10 assume true; 1942#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1941#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1940#L9-10 assume true; 1939#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1938#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1937#L9-10 assume true; 1936#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1931#L9-9 [2018-11-18 15:46:46,937 INFO L796 eck$LassoCheckResult]: Loop: 1931#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1933#L9-10 assume true; 1930#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1931#L9-9 [2018-11-18 15:46:46,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:46,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1205563304, now seen corresponding path program 4 times [2018-11-18 15:46:46,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:46,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:46,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:46,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:46:46,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:47,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:47,017 INFO L82 PathProgramCache]: Analyzing trace with hash 74257, now seen corresponding path program 6 times [2018-11-18 15:46:47,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:47,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:47,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:47,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:46:47,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:47,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:47,021 INFO L82 PathProgramCache]: Analyzing trace with hash -419815846, now seen corresponding path program 5 times [2018-11-18 15:46:47,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:47,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:47,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:47,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:46:47,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 15:46:47,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:47,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 15:46:47,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 15:46:47,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-18 15:46:47,196 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-11-18 15:46:47,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:47,372 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-11-18 15:46:47,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:46:47,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 81 transitions. [2018-11-18 15:46:47,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 15:46:47,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 61 states and 62 transitions. [2018-11-18 15:46:47,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-18 15:46:47,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-18 15:46:47,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 62 transitions. [2018-11-18 15:46:47,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:46:47,374 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-11-18 15:46:47,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 62 transitions. [2018-11-18 15:46:47,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-18 15:46:47,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-18 15:46:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-11-18 15:46:47,377 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-11-18 15:46:47,377 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-11-18 15:46:47,377 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 15:46:47,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 62 transitions. [2018-11-18 15:46:47,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 15:46:47,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:46:47,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:46:47,378 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:47,378 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:46:47,378 INFO L794 eck$LassoCheckResult]: Stem: 2080#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2077#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2069#L23-4 assume true; 2070#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2114#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2071#L23-4 assume true; 2072#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2075#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2076#L23-4 assume true; 2109#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2106#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2103#L23-4 assume true; 2100#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2097#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2094#L23-4 assume true; 2088#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2090#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2087#L23-4 assume true; 2083#L23-1 assume !(main_~i~1 < 5); 2067#L23-5 assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2061#L9-4 assume true; 2062#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2063#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2064#L9-4 assume true; 2121#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2120#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2118#L9-4 assume true; 2116#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2115#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2112#L9-4 assume true; 2110#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2107#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2104#L9-4 assume true; 2101#L9-1 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2098#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2095#L9-4 assume true; 2092#L9-1 assume !(sum_~i~0 < 5); 2085#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2084#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sum } true;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2078#L9-10 assume true; 2079#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2081#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2082#L9-10 assume true; 2119#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2117#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2113#L9-10 assume true; 2111#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2108#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2105#L9-10 assume true; 2102#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2099#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2096#L9-10 assume true; 2093#L9-7 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2091#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2089#L9-10 assume true; 2086#L9-7 assume !(sum_~i~0 < 5); 2073#L9-11 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2074#L12-1 main_#t~ret7 := sum_#res;assume { :end_inline_sum } true;main_~ret2~0 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;main_~i~2 := 0; 2065#L32-4 [2018-11-18 15:46:47,378 INFO L796 eck$LassoCheckResult]: Loop: 2065#L32-4 assume true; 2066#L32-1 assume !!(main_~i~2 < 4);call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem10; 2068#L32-3 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 2065#L32-4 [2018-11-18 15:46:47,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:47,379 INFO L82 PathProgramCache]: Analyzing trace with hash 283897466, now seen corresponding path program 1 times [2018-11-18 15:46:47,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:47,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:47,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:47,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:46:47,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:47,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:47,472 INFO L82 PathProgramCache]: Analyzing trace with hash 84568, now seen corresponding path program 1 times [2018-11-18 15:46:47,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:47,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:47,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:47,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:47,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:47,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:47,476 INFO L82 PathProgramCache]: Analyzing trace with hash 798858559, now seen corresponding path program 1 times [2018-11-18 15:46:47,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:46:47,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:46:47,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:47,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:47,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:46:47,738 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-11-18 15:46:50,033 WARN L180 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 319 DAG size of output: 242 [2018-11-18 15:47:03,060 WARN L180 SmtUtils]: Spent 12.99 s on a formula simplification. DAG size of input: 134 DAG size of output: 130 [2018-11-18 15:47:03,061 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:47:03,062 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:47:03,062 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:47:03,062 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:47:03,062 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:47:03,062 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:47:03,062 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:47:03,062 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:47:03,062 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum05_true-unreach-call_true-termination.i_Iteration14_Lasso [2018-11-18 15:47:03,062 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:47:03,062 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:47:03,067 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 15:47:03,068 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 15:47:03,069 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 15:47:03,071 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 15:47:03,072 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 15:47:03,073 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 15:47:03,078 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 15:47:03,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 15:47:03,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 15:47:03,365 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:47:03,687 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 80 [2018-11-18 15:47:03,763 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 15:47:03,765 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 15:47:03,767 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 15:47:03,768 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 15:47:03,769 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 15:47:03,772 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 15:47:03,773 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 15:47:03,775 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 15:47:03,777 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 15:47:04,186 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2018-11-18 15:47:04,577 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2018-11-18 15:47:04,652 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:47:04,652 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:47:04,652 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 15:47:04,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:47:04,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:47:04,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:47:04,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:47:04,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:47:04,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:47:04,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:47:04,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:47:04,654 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 15:47:04,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:47:04,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:47:04,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:47:04,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:47:04,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:47:04,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:47:04,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:47:04,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:47:04,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 15:47:04,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:47:04,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:47:04,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:47:04,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:47:04,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:47:04,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:47:04,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:47:04,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 15:47:04,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:47:04,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:47:04,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:47:04,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:47:04,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:47:04,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:47:04,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:47:04,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:47:04,673 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 15:47:04,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:47:04,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:47:04,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:47:04,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:47:04,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:47:04,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:47:04,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:47:04,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:47:04,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 15:47:04,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:47:04,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:47:04,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:47:04,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:47:04,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:47:04,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:47:04,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:47:04,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:47:04,676 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 15:47:04,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:47:04,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:47:04,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:47:04,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:47:04,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:47:04,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:47:04,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:47:04,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 15:47:04,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:47:04,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:47:04,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:47:04,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:47:04,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:47:04,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:47:04,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:47:04,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:47:04,680 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 15:47:04,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:47:04,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:47:04,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:47:04,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:47:04,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:47:04,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:47:04,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:47:04,684 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 15:47:04,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:47:04,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:47:04,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:47:04,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:47:04,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:47:04,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:47:04,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:47:04,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:47:04,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 15:47:04,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:47:04,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:47:04,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:47:04,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:47:04,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:47:04,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:47:04,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:47:04,687 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 15:47:04,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:47:04,688 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:47:04,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:47:04,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:47:04,691 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:47:04,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:47:04,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:47:04,709 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 15:47:04,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:47:04,709 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:47:04,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:47:04,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:47:04,710 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:47:04,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:47:04,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:47:04,716 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 15:47:04,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:47:04,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:47:04,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:47:04,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:47:04,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:47:04,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:47:04,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:47:04,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:47:04,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 15:47:04,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:47:04,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:47:04,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:47:04,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:47:04,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:47:04,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:47:04,728 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:47:04,741 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 15:47:04,741 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 15:47:04,741 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:47:04,742 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:47:04,742 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:47:04,742 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 7 Supporting invariants [] [2018-11-18 15:47:05,024 INFO L297 tatePredicateManager]: 28 out of 28 supporting invariants were superfluous and have been removed [2018-11-18 15:47:05,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:47:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:47:05,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:47:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:47:05,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:47:05,108 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 15:47:05,109 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 15:47:05,109 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 62 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-18 15:47:05,122 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 62 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 64 states and 66 transitions. Complement of second has 6 states. [2018-11-18 15:47:05,122 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 15:47:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:47:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-18 15:47:05,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 58 letters. Loop has 3 letters. [2018-11-18 15:47:05,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:47:05,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 61 letters. Loop has 3 letters. [2018-11-18 15:47:05,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:47:05,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 58 letters. Loop has 6 letters. [2018-11-18 15:47:05,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:47:05,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 66 transitions. [2018-11-18 15:47:05,124 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:47:05,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2018-11-18 15:47:05,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 15:47:05,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 15:47:05,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 15:47:05,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:47:05,125 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:47:05,125 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:47:05,125 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:47:05,125 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-18 15:47:05,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:47:05,125 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:47:05,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 15:47:05,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 03:47:05 BoogieIcfgContainer [2018-11-18 15:47:05,131 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 15:47:05,131 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:47:05,131 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:47:05,131 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:47:05,132 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:46:41" (3/4) ... [2018-11-18 15:47:05,135 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 15:47:05,135 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:47:05,136 INFO L168 Benchmark]: Toolchain (without parser) took 24151.53 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.3 MB). Free memory was 959.6 MB in the beginning and 1.0 GB in the end (delta: -84.9 MB). Peak memory consumption was 138.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:47:05,136 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:47:05,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.14 ms. Allocated memory is still 1.0 GB. Free memory was 959.6 MB in the beginning and 948.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:47:05,137 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.49 ms. Allocated memory is still 1.0 GB. Free memory was 948.9 MB in the beginning and 946.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:47:05,137 INFO L168 Benchmark]: Boogie Preprocessor took 26.45 ms. Allocated memory is still 1.0 GB. Free memory was 946.2 MB in the beginning and 943.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:47:05,137 INFO L168 Benchmark]: RCFGBuilder took 345.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -205.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-18 15:47:05,138 INFO L168 Benchmark]: BuchiAutomizer took 23460.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.3 MB). Peak memory consumption was 158.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:47:05,138 INFO L168 Benchmark]: Witness Printer took 4.00 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:47:05,140 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 279.14 ms. Allocated memory is still 1.0 GB. Free memory was 959.6 MB in the beginning and 948.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.49 ms. Allocated memory is still 1.0 GB. Free memory was 948.9 MB in the beginning and 946.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.45 ms. Allocated memory is still 1.0 GB. Free memory was 946.2 MB in the beginning and 943.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 345.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -205.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 23460.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.3 MB). Peak memory consumption was 158.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.00 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 7 and consists of 4 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.4s and 15 iterations. TraceHistogramMax:6. Analysis of lassos took 22.0s. Construction of modules took 0.6s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 13. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 66 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 65 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 308 SDtfs, 209 SDslu, 575 SDs, 0 SdLazy, 355 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital371 mio100 ax100 hnf99 lsp112 ukn47 mio100 lsp66 div104 bol100 ite100 ukn100 eq160 hnf85 smp86 dnf262 smp75 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms 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...