./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/array03-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/array03-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/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 64bit --witnessprinter.graph.data.programhash 987435cc8130e848f1b087d0b65ab8d71c3dfa3c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:25:05,180 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:25:05,181 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:25:05,188 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:25:05,188 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:25:05,189 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:25:05,190 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:25:05,191 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:25:05,192 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:25:05,192 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:25:05,193 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:25:05,193 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:25:05,194 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:25:05,194 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:25:05,195 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:25:05,196 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:25:05,196 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:25:05,198 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:25:05,199 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:25:05,200 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:25:05,201 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:25:05,202 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:25:05,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:25:05,204 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:25:05,204 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:25:05,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:25:05,205 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:25:05,206 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:25:05,206 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:25:05,207 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:25:05,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:25:05,208 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:25:05,208 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:25:05,208 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:25:05,208 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:25:05,209 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:25:05,209 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 12:25:05,219 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:25:05,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:25:05,220 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:25:05,221 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:25:05,221 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:25:05,221 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:25:05,221 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:25:05,221 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:25:05,221 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:25:05,221 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:25:05,222 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:25:05,222 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:25:05,222 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:25:05,222 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:25:05,222 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:25:05,222 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:25:05,222 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:25:05,223 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:25:05,223 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:25:05,223 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:25:05,223 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:25:05,223 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:25:05,223 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:25:05,223 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:25:05,223 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:25:05,224 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:25:05,224 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:25:05,224 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:25:05,225 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:25:05,225 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_6f8d1f46-4c24-4c03-96ec-3695039d318a/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 987435cc8130e848f1b087d0b65ab8d71c3dfa3c [2018-11-28 12:25:05,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:25:05,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:25:05,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:25:05,262 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:25:05,262 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:25:05,263 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/array03-alloca_true-termination.c.i [2018-11-28 12:25:05,312 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/data/dbac56dc9/8d2bb493ee80414994cb64850f429fd1/FLAGdb21ea146 [2018-11-28 12:25:05,679 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:25:05,680 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/sv-benchmarks/c/termination-memory-alloca/array03-alloca_true-termination.c.i [2018-11-28 12:25:05,689 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/data/dbac56dc9/8d2bb493ee80414994cb64850f429fd1/FLAGdb21ea146 [2018-11-28 12:25:05,700 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/data/dbac56dc9/8d2bb493ee80414994cb64850f429fd1 [2018-11-28 12:25:05,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:25:05,704 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:25:05,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:25:05,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:25:05,708 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:25:05,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:05" (1/1) ... [2018-11-28 12:25:05,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:05, skipping insertion in model container [2018-11-28 12:25:05,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:05" (1/1) ... [2018-11-28 12:25:05,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:25:05,744 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:25:05,931 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:25:05,995 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:25:06,022 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:25:06,053 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:25:06,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:06 WrapperNode [2018-11-28 12:25:06,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:25:06,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:25:06,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:25:06,054 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:25:06,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:06" (1/1) ... [2018-11-28 12:25:06,068 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:06" (1/1) ... [2018-11-28 12:25:06,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:25:06,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:25:06,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:25:06,081 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:25:06,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:06" (1/1) ... [2018-11-28 12:25:06,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:06" (1/1) ... [2018-11-28 12:25:06,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:06" (1/1) ... [2018-11-28 12:25:06,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:06" (1/1) ... [2018-11-28 12:25:06,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:06" (1/1) ... [2018-11-28 12:25:06,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:06" (1/1) ... [2018-11-28 12:25:06,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:06" (1/1) ... [2018-11-28 12:25:06,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:25:06,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:25:06,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:25:06,097 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:25:06,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/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-28 12:25:06,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:25:06,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:25:06,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:25:06,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:25:06,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:25:06,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:25:06,283 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:25:06,283 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 12:25:06,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:06 BoogieIcfgContainer [2018-11-28 12:25:06,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:25:06,284 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:25:06,284 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:25:06,286 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:25:06,287 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:25:06,287 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:25:05" (1/3) ... [2018-11-28 12:25:06,288 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d405a47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:25:06, skipping insertion in model container [2018-11-28 12:25:06,288 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:25:06,288 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:06" (2/3) ... [2018-11-28 12:25:06,289 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d405a47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:25:06, skipping insertion in model container [2018-11-28 12:25:06,289 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:25:06,289 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:06" (3/3) ... [2018-11-28 12:25:06,290 INFO L375 chiAutomizerObserver]: Analyzing ICFG array03-alloca_true-termination.c.i [2018-11-28 12:25:06,332 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:25:06,332 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:25:06,332 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:25:06,333 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:25:06,333 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:25:06,333 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:25:06,333 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:25:06,333 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:25:06,333 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:25:06,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 12:25:06,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 12:25:06,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:06,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:06,368 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 12:25:06,368 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:25:06,368 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:25:06,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 12:25:06,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 12:25:06,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:06,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:06,370 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 12:25:06,370 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:25:06,377 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 6#L567true assume !(main_~array_size~0 < 1); 10#L567-2true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 3#L551-3true [2018-11-28 12:25:06,377 INFO L796 eck$LassoCheckResult]: Loop: 3#L551-3true assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 13#L553true assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 7#L558-2true assume !true; 9#L558-3true call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 17#L551-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 3#L551-3true [2018-11-28 12:25:06,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:06,383 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-28 12:25:06,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:06,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:06,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:06,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:06,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:06,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:06,462 INFO L82 PathProgramCache]: Analyzing trace with hash 44963621, now seen corresponding path program 1 times [2018-11-28 12:25:06,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:06,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:06,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:06,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:06,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:06,487 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-28 12:25:06,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:06,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:25:06,492 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:25:06,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 12:25:06,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 12:25:06,505 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-28 12:25:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:06,510 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-11-28 12:25:06,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 12:25:06,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-28 12:25:06,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 12:25:06,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. [2018-11-28 12:25:06,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 12:25:06,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 12:25:06,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2018-11-28 12:25:06,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:25:06,519 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-28 12:25:06,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2018-11-28 12:25:06,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-28 12:25:06,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 12:25:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-11-28 12:25:06,543 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-28 12:25:06,543 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-28 12:25:06,543 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:25:06,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-11-28 12:25:06,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 12:25:06,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:06,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:06,544 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 12:25:06,545 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:25:06,545 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 39#L567 assume !(main_~array_size~0 < 1); 47#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 40#L551-3 [2018-11-28 12:25:06,545 INFO L796 eck$LassoCheckResult]: Loop: 40#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 41#L553 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 42#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 44#L558 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 45#L558-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 48#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 40#L551-3 [2018-11-28 12:25:06,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:06,545 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-28 12:25:06,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:06,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:06,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:06,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:06,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:06,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:06,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1393657929, now seen corresponding path program 1 times [2018-11-28 12:25:06,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:06,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:06,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:06,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:06,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:06,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:06,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1898369747, now seen corresponding path program 1 times [2018-11-28 12:25:06,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:06,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:06,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:06,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:06,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:06,855 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:25:06,856 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:25:06,856 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:25:06,856 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:25:06,856 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:25:06,856 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:06,856 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:25:06,857 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:25:06,857 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 12:25:06,857 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:25:06,857 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:25:06,879 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-28 12:25:06,884 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-28 12:25:06,887 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-28 12:25:06,890 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-28 12:25:06,893 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-28 12:25:06,896 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-28 12:25:06,897 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-28 12:25:06,906 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-28 12:25:06,909 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-28 12:25:06,912 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-28 12:25:06,914 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-28 12:25:06,916 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-28 12:25:07,015 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-28 12:25:07,017 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-28 12:25:07,018 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-28 12:25:07,266 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:25:07,269 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:25:07,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:07,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:07,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:07,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:07,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:07,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:07,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:07,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:07,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:07,275 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-28 12:25:07,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:07,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:07,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:07,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:07,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:07,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:07,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:07,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:07,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:07,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:07,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:07,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:07,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:07,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:07,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:07,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:07,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:07,280 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-28 12:25:07,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:07,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:07,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:07,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:07,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:07,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:07,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:07,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:07,282 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-28 12:25:07,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:07,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:07,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:07,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:07,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:07,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:25:07,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:07,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:07,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:07,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:07,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:07,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:07,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:07,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:07,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:07,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:07,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:07,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:07,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:07,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:07,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:07,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:07,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:25:07,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:07,300 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-28 12:25:07,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:07,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:07,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:07,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:07,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:07,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:25:07,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:07,307 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-28 12:25:07,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:07,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:07,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:07,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:07,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:07,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:07,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:07,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:07,309 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-28 12:25:07,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:07,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:07,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:07,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:07,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:07,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:07,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:07,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:07,315 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-28 12:25:07,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:07,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:07,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:07,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:07,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:07,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:07,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:07,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:07,318 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-28 12:25:07,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:07,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:07,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:07,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:07,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:07,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:07,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:07,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:07,322 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-28 12:25:07,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:07,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:07,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:07,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:07,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:07,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:07,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:07,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:07,325 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-28 12:25:07,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:07,326 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:25:07,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:07,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:07,329 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:25:07,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:25:07,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:07,344 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-28 12:25:07,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:07,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:07,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:07,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:07,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:07,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:25:07,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:07,349 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-28 12:25:07,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:07,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:07,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:07,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:07,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:07,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:25:07,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:07,360 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-28 12:25:07,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:07,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:07,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:07,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:07,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:07,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:25:07,390 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:25:07,411 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:25:07,411 INFO L444 ModelExtractionUtils]: 30 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:25:07,413 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:25:07,414 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:25:07,414 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:25:07,415 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-11-28 12:25:07,427 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 12:25:07,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:07,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:07,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:07,477 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-28 12:25:07,479 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-28 12:25:07,480 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 12:25:07,508 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 18 states and 26 transitions. Complement of second has 4 states. [2018-11-28 12:25:07,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:25:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:25:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-11-28 12:25:07,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 12:25:07,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:07,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 12:25:07,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:07,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-28 12:25:07,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:07,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 26 transitions. [2018-11-28 12:25:07,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:25:07,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 24 transitions. [2018-11-28 12:25:07,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 12:25:07,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 12:25:07,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. [2018-11-28 12:25:07,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:25:07,514 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-28 12:25:07,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. [2018-11-28 12:25:07,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 12:25:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 12:25:07,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-11-28 12:25:07,516 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-28 12:25:07,516 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-28 12:25:07,516 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:25:07,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2018-11-28 12:25:07,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:25:07,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:07,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:07,517 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:25:07,517 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:25:07,517 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 133#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 134#L567 assume !(main_~array_size~0 < 1); 143#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 129#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 131#L553 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 135#L558-2 [2018-11-28 12:25:07,518 INFO L796 eck$LassoCheckResult]: Loop: 135#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 139#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 135#L558-2 [2018-11-28 12:25:07,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:07,518 INFO L82 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2018-11-28 12:25:07,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:07,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:07,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:07,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:07,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:07,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:07,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2018-11-28 12:25:07,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:07,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:07,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:07,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:07,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:07,538 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 12:25:07,538 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 12:25:07,538 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 12:25:07,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:07,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:07,598 INFO L82 PathProgramCache]: Analyzing trace with hash 176795341, now seen corresponding path program 1 times [2018-11-28 12:25:07,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:07,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:07,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:07,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:07,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:07,604 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 12:25:07,604 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 12:25:07,604 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 12:25:07,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:07,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:07,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-28 12:25:07,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-11-28 12:25:07,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:07,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:07,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:07,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2018-11-28 12:25:07,737 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-28 12:25:07,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:07,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:25:07,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:25:07,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:25:07,784 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-28 12:25:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:07,830 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-11-28 12:25:07,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:25:07,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-28 12:25:07,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:25:07,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2018-11-28 12:25:07,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 12:25:07,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 12:25:07,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2018-11-28 12:25:07,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:25:07,834 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-11-28 12:25:07,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2018-11-28 12:25:07,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-28 12:25:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 12:25:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-28 12:25:07,836 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 12:25:07,836 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 12:25:07,837 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:25:07,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-28 12:25:07,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:25:07,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:07,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:07,840 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:07,841 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:25:07,841 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 203#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 204#L567 assume !(main_~array_size~0 < 1); 213#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 199#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 201#L553 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 205#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 209#L558-2 [2018-11-28 12:25:07,841 INFO L796 eck$LassoCheckResult]: Loop: 209#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 208#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 209#L558-2 [2018-11-28 12:25:07,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:07,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-11-28 12:25:07,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:07,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:07,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:07,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:07,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:07,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:07,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 2 times [2018-11-28 12:25:07,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:07,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:07,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:07,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:07,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:07,862 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 12:25:07,862 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 12:25:07,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 12:25:07,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:25:07,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 12:25:07,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-28 12:25:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:07,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:07,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1185742934, now seen corresponding path program 1 times [2018-11-28 12:25:07,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:07,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:07,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:07,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:07,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:07,915 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 12:25:07,915 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 12:25:07,915 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 12:25:07,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:08,166 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:25:08,166 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:25:08,166 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:25:08,166 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:25:08,166 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:25:08,166 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:08,166 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:25:08,166 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:25:08,166 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-28 12:25:08,166 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:25:08,166 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:25:08,168 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-28 12:25:08,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-28 12:25:08,173 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-28 12:25:08,175 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-28 12:25:08,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-28 12:25:08,256 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-28 12:25:08,257 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-28 12:25:08,258 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-28 12:25:08,259 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-28 12:25:08,260 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-28 12:25:08,262 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-28 12:25:08,263 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-28 12:25:08,264 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-28 12:25:08,265 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-28 12:25:08,266 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-28 12:25:08,473 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:25:08,473 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:25:08,473 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-28 12:25:08,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:08,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:08,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:08,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:08,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:08,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:08,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:08,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:08,476 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-28 12:25:08,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:08,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:08,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:08,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:08,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:08,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:08,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:08,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:08,478 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-28 12:25:08,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:08,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:08,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:08,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:08,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:08,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:25:08,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:08,481 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-28 12:25:08,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:08,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:08,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:08,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:08,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:08,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:08,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:08,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:08,486 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-28 12:25:08,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:08,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:08,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:08,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:08,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:08,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:25:08,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:08,501 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-28 12:25:08,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:08,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:08,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:08,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:08,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:08,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:25:08,510 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:25:08,513 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:25:08,513 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:25:08,514 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:25:08,515 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:25:08,515 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:25:08,515 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-11-28 12:25:08,521 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 12:25:08,522 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:25:08,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:08,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:08,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:08,573 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-28 12:25:08,573 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-28 12:25:08,573 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 12:25:08,584 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 40 states and 54 transitions. Complement of second has 7 states. [2018-11-28 12:25:08,584 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-28 12:25:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:25:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 12:25:08,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 12:25:08,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:08,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 12:25:08,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:08,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-28 12:25:08,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:08,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 54 transitions. [2018-11-28 12:25:08,587 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 12:25:08,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 47 transitions. [2018-11-28 12:25:08,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 12:25:08,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 12:25:08,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2018-11-28 12:25:08,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:25:08,588 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2018-11-28 12:25:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2018-11-28 12:25:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-28 12:25:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 12:25:08,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-11-28 12:25:08,590 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-11-28 12:25:08,590 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-11-28 12:25:08,591 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:25:08,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2018-11-28 12:25:08,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:25:08,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:08,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:08,592 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:08,592 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:25:08,592 INFO L794 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 320#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 321#L567 assume !(main_~array_size~0 < 1); 336#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 322#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 324#L553 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 338#L555 assume test_fun_#t~mem4 < 0;havoc test_fun_#t~mem4;test_fun_~res~0 := 0; 332#L558-2 [2018-11-28 12:25:08,592 INFO L796 eck$LassoCheckResult]: Loop: 332#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 331#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 332#L558-2 [2018-11-28 12:25:08,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:08,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2018-11-28 12:25:08,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:08,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:08,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:08,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:08,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:08,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 3 times [2018-11-28 12:25:08,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:08,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:08,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:08,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,609 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 12:25:08,609 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 12:25:08,609 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 12:25:08,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 12:25:08,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-28 12:25:08,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-28 12:25:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:08,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:08,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741012, now seen corresponding path program 1 times [2018-11-28 12:25:08,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:08,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:08,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:08,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,647 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 12:25:08,647 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 12:25:08,647 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 12:25:08,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:08,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:08,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-28 12:25:08,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-11-28 12:25:08,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:08,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:08,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:08,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-11-28 12:25:08,712 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-28 12:25:08,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:08,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:25:08,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:25:08,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:25:08,751 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-28 12:25:08,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:08,788 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-28 12:25:08,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:25:08,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2018-11-28 12:25:08,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:25:08,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 41 transitions. [2018-11-28 12:25:08,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 12:25:08,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 12:25:08,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2018-11-28 12:25:08,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:25:08,791 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-28 12:25:08,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2018-11-28 12:25:08,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-11-28 12:25:08,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 12:25:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-28 12:25:08,796 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-28 12:25:08,796 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-28 12:25:08,796 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 12:25:08,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2018-11-28 12:25:08,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:25:08,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:08,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:08,797 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:08,797 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:25:08,797 INFO L794 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 424#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 425#L567 assume !(main_~array_size~0 < 1); 438#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 426#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 427#L553 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 432#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 436#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 440#L558 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 448#L558-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 447#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 445#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 429#L553 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 430#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 434#L558-2 [2018-11-28 12:25:08,797 INFO L796 eck$LassoCheckResult]: Loop: 434#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 433#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 434#L558-2 [2018-11-28 12:25:08,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:08,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1864345184, now seen corresponding path program 1 times [2018-11-28 12:25:08,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:08,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:08,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:08,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:08,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:08,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:25:08,868 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:25:08,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:08,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 4 times [2018-11-28 12:25:08,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:08,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:08,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:08,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,870 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 12:25:08,870 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 12:25:08,871 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 12:25:08,877 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 12:25:08,880 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 12:25:08,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-28 12:25:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:08,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:25:08,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:25:08,932 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-28 12:25:08,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:08,970 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2018-11-28 12:25:08,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:25:08,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2018-11-28 12:25:08,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:25:08,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 41 transitions. [2018-11-28 12:25:08,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 12:25:08,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 12:25:08,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2018-11-28 12:25:08,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:25:08,972 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-28 12:25:08,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2018-11-28 12:25:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-11-28 12:25:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 12:25:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-11-28 12:25:08,975 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-28 12:25:08,975 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-28 12:25:08,975 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 12:25:08,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2018-11-28 12:25:08,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 12:25:08,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:08,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:08,976 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:08,976 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:25:08,976 INFO L794 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 496#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 497#L567 assume !(main_~array_size~0 < 1); 511#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 498#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 499#L553 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 524#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 512#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 508#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 509#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 519#L558 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 518#L558-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 517#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 516#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 501#L553 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 502#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 507#L558-2 [2018-11-28 12:25:08,976 INFO L796 eck$LassoCheckResult]: Loop: 507#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 506#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 507#L558-2 [2018-11-28 12:25:08,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:08,976 INFO L82 PathProgramCache]: Analyzing trace with hash 221162235, now seen corresponding path program 1 times [2018-11-28 12:25:08,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:08,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:08,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:08,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,980 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 12:25:08,980 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 12:25:08,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 12:25:08,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:09,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:09,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 5 times [2018-11-28 12:25:09,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:09,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:09,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:09,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:09,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:09,053 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 12:25:09,053 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 12:25:09,054 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 12:25:09,063 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 12:25:09,067 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 12:25:09,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-28 12:25:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:09,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:09,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2083511360, now seen corresponding path program 2 times [2018-11-28 12:25:09,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:09,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:09,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:09,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:09,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:09,101 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 12:25:09,101 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 12:25:09,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f8d1f46-4c24-4c03-96ec-3695039d318a/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 12:25:09,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:25:09,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:25:09,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-28 12:25:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:09,442 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 102 [2018-11-28 12:25:09,502 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:25:09,503 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:25:09,503 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:25:09,503 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:25:09,503 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:25:09,503 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:09,503 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:25:09,503 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:25:09,503 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-28 12:25:09,503 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:25:09,503 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:25:09,506 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-28 12:25:09,511 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-28 12:25:09,513 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-28 12:25:09,521 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-28 12:25:09,523 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-28 12:25:09,525 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-28 12:25:09,526 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-28 12:25:09,528 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-28 12:25:09,530 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-28 12:25:09,531 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-28 12:25:09,533 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-28 12:25:09,534 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-28 12:25:09,628 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-28 12:25:09,630 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-28 12:25:09,632 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-28 12:25:09,852 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:25:09,852 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:25:09,852 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-28 12:25:09,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:09,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:09,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:09,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:09,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:09,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:09,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:09,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:09,855 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-28 12:25:09,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:09,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:09,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:09,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:09,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:09,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:09,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:09,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:09,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-28 12:25:09,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:09,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:09,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:09,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:09,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:09,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:25:09,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:09,865 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-28 12:25:09,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:09,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:09,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:09,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:09,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:09,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:25:09,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:09,870 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-28 12:25:09,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:09,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:09,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:09,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:09,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:09,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:09,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:09,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:09,872 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-28 12:25:09,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:09,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:09,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:09,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:09,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:09,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:09,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:09,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:09,875 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-28 12:25:09,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:09,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:09,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:09,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:09,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:09,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:25:09,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:09,879 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-28 12:25:09,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:09,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:09,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:09,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:09,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:09,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:09,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:09,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:09,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-28 12:25:09,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:09,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:09,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:09,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:09,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:09,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:09,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:09,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:09,884 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-28 12:25:09,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:09,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:09,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:09,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:09,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:09,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:25:09,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:09,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-28 12:25:09,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:09,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:09,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:09,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:09,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:09,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:09,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:09,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:09,891 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-28 12:25:09,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:09,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:09,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:09,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:09,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:09,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:25:09,907 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:25:09,911 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:25:09,911 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:25:09,912 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:25:09,913 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:25:09,913 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:25:09,913 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2018-11-28 12:25:09,933 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 12:25:09,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:25:09,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:09,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:09,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:09,994 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-28 12:25:09,994 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-28 12:25:09,995 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 12:25:10,007 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 44 transitions. Complement of second has 7 states. [2018-11-28 12:25:10,008 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-28 12:25:10,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:25:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-28 12:25:10,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-28 12:25:10,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:10,009 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:25:10,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:10,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:10,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:10,050 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-28 12:25:10,050 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 12:25:10,050 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 12:25:10,068 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 44 transitions. Complement of second has 7 states. [2018-11-28 12:25:10,069 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-28 12:25:10,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:25:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-28 12:25:10,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-28 12:25:10,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:10,070 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:25:10,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:10,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:10,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:10,109 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-28 12:25:10,110 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 12:25:10,110 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 12:25:10,125 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 6 states. [2018-11-28 12:25:10,125 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-28 12:25:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:25:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-28 12:25:10,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-28 12:25:10,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:10,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 2 letters. [2018-11-28 12:25:10,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:10,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-28 12:25:10,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:10,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2018-11-28 12:25:10,130 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:25:10,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2018-11-28 12:25:10,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:25:10,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:25:10,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:25:10,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:25:10,131 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:25:10,131 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:25:10,131 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:25:10,131 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 12:25:10,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:25:10,131 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:25:10,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:25:10,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:25:10 BoogieIcfgContainer [2018-11-28 12:25:10,136 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:25:10,137 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:25:10,137 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:25:10,137 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:25:10,137 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:06" (3/4) ... [2018-11-28 12:25:10,141 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:25:10,141 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:25:10,142 INFO L168 Benchmark]: Toolchain (without parser) took 4438.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -63.1 MB). Peak memory consumption was 136.2 MB. Max. memory is 11.5 GB. [2018-11-28 12:25:10,142 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:25:10,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:25:10,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:25:10,143 INFO L168 Benchmark]: Boogie Preprocessor took 15.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:25:10,144 INFO L168 Benchmark]: RCFGBuilder took 186.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:25:10,144 INFO L168 Benchmark]: BuchiAutomizer took 3852.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 94.4 MB). Peak memory consumption was 147.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:25:10,145 INFO L168 Benchmark]: Witness Printer took 4.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:25:10,148 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 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 186.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3852.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 94.4 MB). Peak memory consumption was 147.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.04 ms. Allocated memory is still 1.2 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 3.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 119 SDtfs, 72 SDslu, 68 SDs, 0 SdLazy, 149 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital169 mio100 ax111 hnf99 lsp86 ukn68 mio100 lsp52 div100 bol100 ite100 ukn100 eq178 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 4 VariablesLoop: 2 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...