./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d2b81393-ebe2-4ab5-9a80-a732362d4e04/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d2b81393-ebe2-4ab5-9a80-a732362d4e04/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d2b81393-ebe2-4ab5-9a80-a732362d4e04/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d2b81393-ebe2-4ab5-9a80-a732362d4e04/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d2b81393-ebe2-4ab5-9a80-a732362d4e04/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d2b81393-ebe2-4ab5-9a80-a732362d4e04/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 14310793a2daa3bf62d53b5cef67b6406903d242 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 07:22:42,192 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:22:42,193 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:22:42,201 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:22:42,201 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:22:42,202 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:22:42,202 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:22:42,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:22:42,204 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:22:42,205 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:22:42,205 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:22:42,205 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:22:42,206 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:22:42,206 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:22:42,207 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:22:42,207 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:22:42,208 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:22:42,208 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:22:42,209 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:22:42,210 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:22:42,211 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:22:42,211 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:22:42,212 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:22:42,213 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:22:42,213 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:22:42,213 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:22:42,214 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:22:42,214 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:22:42,215 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:22:42,215 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:22:42,215 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:22:42,216 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:22:42,216 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:22:42,216 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:22:42,217 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:22:42,217 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:22:42,217 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d2b81393-ebe2-4ab5-9a80-a732362d4e04/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 07:22:42,225 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:22:42,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:22:42,226 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:22:42,226 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:22:42,226 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:22:42,226 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 07:22:42,226 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 07:22:42,227 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 07:22:42,227 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 07:22:42,227 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 07:22:42,227 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 07:22:42,227 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:22:42,227 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:22:42,227 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:22:42,227 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:22:42,227 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 07:22:42,228 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 07:22:42,228 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 07:22:42,228 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:22:42,228 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 07:22:42,228 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:22:42,228 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 07:22:42,228 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:22:42,228 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:22:42,229 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 07:22:42,229 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:22:42,229 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:22:42,229 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 07:22:42,229 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 07:22:42,230 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_d2b81393-ebe2-4ab5-9a80-a732362d4e04/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 -> 14310793a2daa3bf62d53b5cef67b6406903d242 [2018-11-23 07:22:42,252 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:22:42,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:22:42,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:22:42,265 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:22:42,265 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:22:42,266 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d2b81393-ebe2-4ab5-9a80-a732362d4e04/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca_true-termination_true-no-overflow.c.i [2018-11-23 07:22:42,303 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2b81393-ebe2-4ab5-9a80-a732362d4e04/bin-2019/uautomizer/data/bdafb9c19/ff67bb55a9974a2c854d1ea67dbcc9f1/FLAGdbaba1b8f [2018-11-23 07:22:42,733 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:22:42,733 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d2b81393-ebe2-4ab5-9a80-a732362d4e04/sv-benchmarks/c/termination-memory-alloca/b.14-alloca_true-termination_true-no-overflow.c.i [2018-11-23 07:22:42,742 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2b81393-ebe2-4ab5-9a80-a732362d4e04/bin-2019/uautomizer/data/bdafb9c19/ff67bb55a9974a2c854d1ea67dbcc9f1/FLAGdbaba1b8f [2018-11-23 07:22:42,753 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d2b81393-ebe2-4ab5-9a80-a732362d4e04/bin-2019/uautomizer/data/bdafb9c19/ff67bb55a9974a2c854d1ea67dbcc9f1 [2018-11-23 07:22:42,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:22:42,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:22:42,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:22:42,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:22:42,760 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:22:42,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:22:42" (1/1) ... [2018-11-23 07:22:42,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bab14b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:22:42, skipping insertion in model container [2018-11-23 07:22:42,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:22:42" (1/1) ... [2018-11-23 07:22:42,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:22:42,800 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:22:42,979 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:22:42,987 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:22:43,060 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:22:43,091 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:22:43,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:22:43 WrapperNode [2018-11-23 07:22:43,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:22:43,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:22:43,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:22:43,092 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:22:43,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:22:43" (1/1) ... [2018-11-23 07:22:43,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:22:43" (1/1) ... [2018-11-23 07:22:43,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:22:43,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:22:43,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:22:43,121 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:22:43,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:22:43" (1/1) ... [2018-11-23 07:22:43,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:22:43" (1/1) ... [2018-11-23 07:22:43,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:22:43" (1/1) ... [2018-11-23 07:22:43,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:22:43" (1/1) ... [2018-11-23 07:22:43,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:22:43" (1/1) ... [2018-11-23 07:22:43,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:22:43" (1/1) ... [2018-11-23 07:22:43,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:22:43" (1/1) ... [2018-11-23 07:22:43,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:22:43,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:22:43,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:22:43,140 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:22:43,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:22:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2b81393-ebe2-4ab5-9a80-a732362d4e04/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-23 07:22:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 07:22:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 07:22:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 07:22:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 07:22:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:22:43,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:22:43,364 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:22:43,365 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 07:22:43,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:22:43 BoogieIcfgContainer [2018-11-23 07:22:43,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:22:43,365 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 07:22:43,366 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 07:22:43,369 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 07:22:43,369 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:22:43,370 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 07:22:42" (1/3) ... [2018-11-23 07:22:43,370 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f5dc354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:22:43, skipping insertion in model container [2018-11-23 07:22:43,371 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:22:43,371 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:22:43" (2/3) ... [2018-11-23 07:22:43,371 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f5dc354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:22:43, skipping insertion in model container [2018-11-23 07:22:43,371 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:22:43,371 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:22:43" (3/3) ... [2018-11-23 07:22:43,372 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.14-alloca_true-termination_true-no-overflow.c.i [2018-11-23 07:22:43,416 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:22:43,416 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 07:22:43,416 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 07:22:43,416 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 07:22:43,416 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:22:43,417 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:22:43,417 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 07:22:43,417 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:22:43,417 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 07:22:43,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 07:22:43,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 07:22:43,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:22:43,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:22:43,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 07:22:43,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 07:22:43,447 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 07:22:43,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 07:22:43,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 07:22:43,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:22:43,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:22:43,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 07:22:43,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 07:22:43,455 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 6#L556-4true [2018-11-23 07:22:43,455 INFO L796 eck$LassoCheckResult]: Loop: 6#L556-4true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 14#L555-1true assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 7#L555-3true assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 4#L556-3true assume !true; 6#L556-4true [2018-11-23 07:22:43,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:22:43,459 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 07:22:43,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:22:43,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:22:43,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:43,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:22:43,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:43,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:22:43,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1142256, now seen corresponding path program 1 times [2018-11-23 07:22:43,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:22:43,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:22:43,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:43,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:22:43,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:22:43,591 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-23 07:22:43,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:22:43,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-23 07:22:43,595 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:22:43,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 07:22:43,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 07:22:43,606 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-11-23 07:22:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:22:43,610 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-11-23 07:22:43,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 07:22:43,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-11-23 07:22:43,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 07:22:43,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 9 transitions. [2018-11-23 07:22:43,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 07:22:43,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 07:22:43,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2018-11-23 07:22:43,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:22:43,618 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-23 07:22:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2018-11-23 07:22:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-23 07:22:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 07:22:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-11-23 07:22:43,640 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-23 07:22:43,640 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-23 07:22:43,640 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 07:22:43,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2018-11-23 07:22:43,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 07:22:43,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:22:43,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:22:43,641 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 07:22:43,641 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:22:43,642 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L556-4 [2018-11-23 07:22:43,642 INFO L796 eck$LassoCheckResult]: Loop: 33#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 37#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 38#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 34#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 35#L556-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 33#L556-4 [2018-11-23 07:22:43,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:22:43,642 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 07:22:43,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:22:43,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:22:43,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:43,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:22:43,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:43,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:22:43,671 INFO L82 PathProgramCache]: Analyzing trace with hash 35409745, now seen corresponding path program 1 times [2018-11-23 07:22:43,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:22:43,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:22:43,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:43,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:22:43,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:22:43,755 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-23 07:22:43,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:22:43,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 07:22:43,756 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:22:43,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:22:43,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:22:43,756 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-23 07:22:43,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:22:43,843 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2018-11-23 07:22:43,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:22:43,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2018-11-23 07:22:43,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 07:22:43,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2018-11-23 07:22:43,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 07:22:43,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 07:22:43,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2018-11-23 07:22:43,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:22:43,845 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-23 07:22:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2018-11-23 07:22:43,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-23 07:22:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 07:22:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-11-23 07:22:43,846 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-23 07:22:43,846 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-23 07:22:43,846 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 07:22:43,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2018-11-23 07:22:43,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 07:22:43,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:22:43,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:22:43,847 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 07:22:43,847 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-23 07:22:43,847 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 63#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 64#L556-4 [2018-11-23 07:22:43,847 INFO L796 eck$LassoCheckResult]: Loop: 64#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 68#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 69#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 65#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 66#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 70#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 71#L556-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 64#L556-4 [2018-11-23 07:22:43,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:22:43,848 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-23 07:22:43,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:22:43,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:22:43,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:43,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:22:43,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:43,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:22:43,870 INFO L82 PathProgramCache]: Analyzing trace with hash -330970762, now seen corresponding path program 1 times [2018-11-23 07:22:43,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:22:43,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:22:43,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:43,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:22:43,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:43,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:22:43,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1215326068, now seen corresponding path program 1 times [2018-11-23 07:22:43,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:22:43,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:22:43,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:43,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:22:43,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:44,148 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2018-11-23 07:22:44,368 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-11-23 07:22:44,456 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:22:44,456 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:22:44,457 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:22:44,457 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:22:44,457 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:22:44,457 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:22:44,457 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:22:44,457 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:22:44,457 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.14-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-23 07:22:44,458 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:22:44,458 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:22:44,475 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-23 07:22:44,479 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-23 07:22:44,480 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-23 07:22:44,482 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-23 07:22:44,483 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-23 07:22:44,484 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-23 07:22:44,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:22:44,488 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-23 07:22:44,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:22:44,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:22:44,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:22:44,494 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-23 07:22:44,495 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-23 07:22:44,693 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2018-11-23 07:22:44,781 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-23 07:22:44,782 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-23 07:22:44,784 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-23 07:22:44,785 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-23 07:22:44,786 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-23 07:22:45,121 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:22:45,126 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:22:45,128 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-23 07:22:45,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:45,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:22:45,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:45,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:45,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:45,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:22:45,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:22:45,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:45,134 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-23 07:22:45,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:45,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:22:45,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:45,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:45,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:45,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:22:45,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:22:45,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:45,137 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-23 07:22:45,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:45,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:22:45,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:45,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:45,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:45,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:22:45,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:22:45,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:45,139 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-23 07:22:45,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:45,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:22:45,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:45,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:45,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:45,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:22:45,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:22:45,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:45,142 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-23 07:22:45,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:45,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:22:45,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:45,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:45,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:45,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:22:45,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:22:45,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:45,144 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-23 07:22:45,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:45,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:45,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:45,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:45,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:22:45,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:22:45,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:45,149 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-23 07:22:45,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:45,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:22:45,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:45,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:45,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:45,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:22:45,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:22:45,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:45,152 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-23 07:22:45,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:45,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:22:45,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:45,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:45,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:45,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:22:45,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:22:45,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:45,154 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-23 07:22:45,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:45,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:22:45,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:45,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:45,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:45,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:22:45,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:22:45,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:45,156 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-23 07:22:45,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:45,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:45,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:45,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:45,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:22:45,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:22:45,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:45,162 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-23 07:22:45,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:45,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:22:45,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:45,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:45,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:45,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:22:45,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:22:45,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:45,164 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-23 07:22:45,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:45,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:45,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:45,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:45,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:22:45,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:22:45,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:45,169 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-23 07:22:45,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:45,170 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:22:45,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:45,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:45,172 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:22:45,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:22:45,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:45,179 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-23 07:22:45,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:45,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:45,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:45,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:45,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:22:45,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:22:45,204 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:22:45,213 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 07:22:45,213 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 07:22:45,215 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:22:45,216 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:22:45,217 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:22:45,217 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-23 07:22:45,302 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 07:22:45,306 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 07:22:45,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:22:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:22:45,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:22:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:22:45,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:22:45,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:45,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 92 [2018-11-23 07:22:45,469 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:45,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2018-11-23 07:22:45,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:45,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:45,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2018-11-23 07:22:45,475 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:45,476 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 07:22:45,476 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:45,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:45,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2018-11-23 07:22:45,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:45,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-11-23 07:22:45,500 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:45,507 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:45,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2018-11-23 07:22:45,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:45,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:45,512 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:45,515 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:45,518 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:45,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:45,528 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:45,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 107 [2018-11-23 07:22:45,864 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-23 07:22:45,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:45,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 79 [2018-11-23 07:22:45,868 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:45,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:45,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 79 [2018-11-23 07:22:45,872 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:45,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:45,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 79 [2018-11-23 07:22:45,875 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:46,244 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:46,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 74 [2018-11-23 07:22:46,246 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:46,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:46,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-11-23 07:22:46,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:46,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-11-23 07:22:46,501 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:46,516 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:46,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-23 07:22:46,524 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:46,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:46,525 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:46,529 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:46,534 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:46,705 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:46,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 81 [2018-11-23 07:22:46,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:46,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2018-11-23 07:22:46,725 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:46,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:46,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 56 [2018-11-23 07:22:46,770 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:46,808 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:46,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 55 [2018-11-23 07:22:46,812 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:46,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:46,813 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:46,822 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:46,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:46,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-11-23 07:22:46,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:46,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:46,860 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:46,865 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:46,873 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:46,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:46,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2018-11-23 07:22:46,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:46,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-11-23 07:22:46,881 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:46,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:46,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-23 07:22:46,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 07:22:46,896 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:46,904 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:46,909 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:46,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:46,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 96 [2018-11-23 07:22:46,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:46,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 68 [2018-11-23 07:22:46,948 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:47,309 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:47,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 60 [2018-11-23 07:22:47,311 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:47,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:47,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 65 [2018-11-23 07:22:47,605 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 59 [2018-11-23 07:22:48,195 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:48,197 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,205 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 81 [2018-11-23 07:22:48,345 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 07:22:48,349 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,363 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 117 [2018-11-23 07:22:48,364 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-11-23 07:22:48,411 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:22:48,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 54 [2018-11-23 07:22:48,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:48,513 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,519 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 54 [2018-11-23 07:22:48,564 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:48,565 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,571 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,603 INFO L267 ElimStorePlain]: Start of recursive call 30: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,627 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 96 [2018-11-23 07:22:48,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-23 07:22:48,658 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 68 [2018-11-23 07:22:48,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:48,688 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-23 07:22:48,704 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:48,705 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,712 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,716 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2018-11-23 07:22:48,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-11-23 07:22:48,724 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-23 07:22:48,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 07:22:48,746 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,750 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,754 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 83 [2018-11-23 07:22:48,777 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2018-11-23 07:22:48,778 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2018-11-23 07:22:48,826 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-11-23 07:22:48,861 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:48,862 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,867 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2018-11-23 07:22:48,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:48,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:48,896 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,900 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,913 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,922 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:48,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:22:48,937 INFO L202 ElimStorePlain]: Needed 58 recursive calls to eliminate 4 variables, input treesize:204, output treesize:45 [2018-11-23 07:22:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:22:48,952 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 07:22:48,952 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-23 07:22:49,004 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3. Second operand 6 states. Result 20 states and 27 transitions. Complement of second has 8 states. [2018-11-23 07:22:49,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 07:22:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 07:22:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-23 07:22:49,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-23 07:22:49,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:22:49,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-23 07:22:49,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:22:49,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-23 07:22:49,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:22:49,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2018-11-23 07:22:49,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 07:22:49,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 17 transitions. [2018-11-23 07:22:49,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-23 07:22:49,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 07:22:49,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-23 07:22:49,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:22:49,009 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-23 07:22:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-23 07:22:49,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-23 07:22:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 07:22:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-23 07:22:49,010 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-23 07:22:49,010 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-23 07:22:49,010 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 07:22:49,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-23 07:22:49,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 07:22:49,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:22:49,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:22:49,010 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-23 07:22:49,010 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 07:22:49,011 INFO L794 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 248#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 249#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 256#L555-1 assume !test_fun_#t~short8; 255#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 252#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 253#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 258#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 251#L556-1 [2018-11-23 07:22:49,011 INFO L796 eck$LassoCheckResult]: Loop: 251#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 250#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 251#L556-1 [2018-11-23 07:22:49,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:22:49,011 INFO L82 PathProgramCache]: Analyzing trace with hash 179598440, now seen corresponding path program 1 times [2018-11-23 07:22:49,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:22:49,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:22:49,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:49,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:22:49,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:22:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 07:22:49,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:22:49,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:22:49,036 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:22:49,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:22:49,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 1 times [2018-11-23 07:22:49,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:22:49,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:22:49,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:49,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:22:49,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:49,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:22:49,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:22:49,093 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 07:22:49,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:22:49,098 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-23 07:22:49,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:22:49,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2018-11-23 07:22:49,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 07:22:49,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 15 transitions. [2018-11-23 07:22:49,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-23 07:22:49,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-23 07:22:49,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2018-11-23 07:22:49,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:22:49,100 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-23 07:22:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2018-11-23 07:22:49,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 07:22:49,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 07:22:49,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-23 07:22:49,101 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-23 07:22:49,101 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-23 07:22:49,101 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 07:22:49,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-23 07:22:49,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 07:22:49,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:22:49,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:22:49,102 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-23 07:22:49,102 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 07:22:49,102 INFO L794 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 281#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 282#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 288#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 290#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 291#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 293#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 292#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 284#L556-1 [2018-11-23 07:22:49,102 INFO L796 eck$LassoCheckResult]: Loop: 284#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 283#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 284#L556-1 [2018-11-23 07:22:49,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:22:49,103 INFO L82 PathProgramCache]: Analyzing trace with hash 177751398, now seen corresponding path program 1 times [2018-11-23 07:22:49,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:22:49,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:22:49,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:49,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:22:49,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:49,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:22:49,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 2 times [2018-11-23 07:22:49,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:22:49,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:22:49,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:49,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:22:49,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:49,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:22:49,131 INFO L82 PathProgramCache]: Analyzing trace with hash -979597471, now seen corresponding path program 2 times [2018-11-23 07:22:49,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:22:49,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:22:49,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:49,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:22:49,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:49,736 WARN L180 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 120 [2018-11-23 07:22:49,905 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-23 07:22:49,907 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:22:49,907 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:22:49,907 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:22:49,907 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:22:49,907 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:22:49,907 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:22:49,907 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:22:49,908 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:22:49,908 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.14-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-23 07:22:49,908 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:22:49,908 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:22:49,910 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-23 07:22:49,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-23 07:22:49,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-23 07:22:49,917 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-23 07:22:49,918 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-23 07:22:49,919 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-23 07:22:49,920 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-23 07:22:49,921 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-23 07:22:49,922 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-23 07:22:50,114 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-11-23 07:22:50,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:22:50,187 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-23 07:22:50,189 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-23 07:22:50,190 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-23 07:22:50,191 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-23 07:22:50,193 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-23 07:22:50,194 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-23 07:22:50,195 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-23 07:22:50,197 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-23 07:22:50,470 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:22:50,470 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:22:50,471 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-23 07:22:50,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:50,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:22:50,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:50,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:50,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:50,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:22:50,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:22:50,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:50,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-23 07:22:50,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:50,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:50,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:50,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:50,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:22:50,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:22:50,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:50,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-23 07:22:50,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:50,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:22:50,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:50,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:50,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:50,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:22:50,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:22:50,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:50,483 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-23 07:22:50,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:50,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:50,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:50,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:50,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:22:50,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:22:50,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:50,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-23 07:22:50,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:50,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:22:50,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:50,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:50,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:50,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:22:50,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:22:50,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:50,488 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-23 07:22:50,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:50,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:22:50,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:50,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:50,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:50,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:22:50,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:22:50,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:50,489 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-23 07:22:50,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:50,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:22:50,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:50,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:50,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:50,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:22:50,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:22:50,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:50,491 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-23 07:22:50,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:50,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:50,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:50,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:50,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:22:50,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:22:50,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:50,494 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-23 07:22:50,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:50,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:50,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:50,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:50,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:22:50,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:22:50,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:22:50,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:22:50,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:22:50,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:22:50,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:22:50,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:22:50,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:22:50,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:22:50,519 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:22:50,533 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 07:22:50,533 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 07:22:50,533 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:22:50,534 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-23 07:22:50,534 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:22:50,534 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 - 1*ULTIMATE.start_test_fun_#t~mem9 >= 0] [2018-11-23 07:22:50,604 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2018-11-23 07:22:50,608 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 07:22:50,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:22:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:22:50,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:22:50,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-23 07:22:50,641 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:50,641 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:50,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 07:22:50,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:50,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:50,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:50,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-23 07:22:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:22:50,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:22:50,702 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:50,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 107 [2018-11-23 07:22:51,186 WARN L180 SmtUtils]: Spent 467.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-23 07:22:51,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 86 [2018-11-23 07:22:51,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,195 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 86 [2018-11-23 07:22:51,196 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,197 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 07:22:51,197 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 83 [2018-11-23 07:22:51,294 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-11-23 07:22:51,357 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-23 07:22:51,358 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-23 07:22:51,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:51,370 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,373 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,377 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 93 [2018-11-23 07:22:51,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,428 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 07:22:51,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,436 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 100 [2018-11-23 07:22:51,437 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,457 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,458 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 86 [2018-11-23 07:22:51,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 76 [2018-11-23 07:22:51,473 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,509 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 101 [2018-11-23 07:22:51,525 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 9 xjuncts. [2018-11-23 07:22:51,578 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 07:22:51,613 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 07:22:51,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-11-23 07:22:51,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-23 07:22:51,673 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,683 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-23 07:22:51,686 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:51,687 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,690 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,693 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,711 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 100 [2018-11-23 07:22:51,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-11-23 07:22:51,745 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-11-23 07:22:51,770 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-23 07:22:51,771 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-23 07:22:51,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:51,798 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,802 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,804 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,808 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 92 [2018-11-23 07:22:51,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2018-11-23 07:22:51,848 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,848 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 07:22:51,848 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2018-11-23 07:22:51,852 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2018-11-23 07:22:51,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-11-23 07:22:51,877 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2018-11-23 07:22:51,890 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:51,891 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,895 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,898 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,903 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:22:51,917 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 4 variables, input treesize:204, output treesize:45 [2018-11-23 07:22:51,929 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-23 07:22:51,929 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 07:22:51,929 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-23 07:22:51,952 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 18 states and 21 transitions. Complement of second has 5 states. [2018-11-23 07:22:51,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 0 non-accepting loop states 2 accepting loop states [2018-11-23 07:22:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 07:22:51,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2018-11-23 07:22:51,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-23 07:22:51,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:22:51,953 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 07:22:51,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:22:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:22:51,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:22:51,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-23 07:22:51,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,983 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:51,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 07:22:51,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:51,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-23 07:22:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:22:51,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:22:52,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 107 [2018-11-23 07:22:52,452 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-23 07:22:52,452 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 07:22:52,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:52,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 87 [2018-11-23 07:22:52,456 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:52,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 87 [2018-11-23 07:22:52,460 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:52,564 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 82 [2018-11-23 07:22:52,565 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:52,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,638 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 93 [2018-11-23 07:22:52,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,644 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 07:22:52,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,651 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 96 [2018-11-23 07:22:52,651 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:52,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 86 [2018-11-23 07:22:52,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 76 [2018-11-23 07:22:52,683 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:52,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 101 [2018-11-23 07:22:52,736 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 9 xjuncts. [2018-11-23 07:22:52,786 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 07:22:52,819 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 07:22:52,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-11-23 07:22:52,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-23 07:22:52,913 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:52,923 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-23 07:22:52,927 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:52,928 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:52,932 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:52,937 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:52,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:52,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 76 [2018-11-23 07:22:52,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2018-11-23 07:22:52,988 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-11-23 07:22:53,028 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 80 [2018-11-23 07:22:53,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 70 [2018-11-23 07:22:53,075 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,109 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,109 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 74 [2018-11-23 07:22:53,123 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 3 xjuncts. [2018-11-23 07:22:53,155 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 07:22:53,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,223 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,223 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 79 [2018-11-23 07:22:53,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-11-23 07:22:53,237 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 70 [2018-11-23 07:22:53,279 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 3 xjuncts. [2018-11-23 07:22:53,308 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 07:22:53,357 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-11-23 07:22:53,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:53,361 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,366 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,397 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 07:22:53,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:22:53,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 92 [2018-11-23 07:22:53,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2018-11-23 07:22:53,445 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2018-11-23 07:22:53,448 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,449 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 07:22:53,449 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,469 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2018-11-23 07:22:53,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-11-23 07:22:53,472 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2018-11-23 07:22:53,483 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:53,483 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,487 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,490 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,494 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 100 [2018-11-23 07:22:53,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-11-23 07:22:53,532 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-11-23 07:22:53,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-23 07:22:53,551 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-23 07:22:53,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:22:53,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 07:22:53,561 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,564 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,567 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,570 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:22:53,586 INFO L202 ElimStorePlain]: Needed 40 recursive calls to eliminate 4 variables, input treesize:204, output treesize:45 [2018-11-23 07:22:53,598 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-23 07:22:53,598 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 07:22:53,598 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-23 07:22:53,618 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 26 states and 31 transitions. Complement of second has 6 states. [2018-11-23 07:22:53,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 07:22:53,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 07:22:53,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-11-23 07:22:53,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-23 07:22:53,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:22:53,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-23 07:22:53,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:22:53,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-23 07:22:53,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:22:53,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-11-23 07:22:53,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 07:22:53,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2018-11-23 07:22:53,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-23 07:22:53,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-23 07:22:53,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-23 07:22:53,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:22:53,620 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 07:22:53,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-23 07:22:53,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-23 07:22:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 07:22:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-23 07:22:53,621 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 07:22:53,621 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 07:22:53,621 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 07:22:53,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-23 07:22:53,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 07:22:53,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:22:53,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:22:53,622 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2018-11-23 07:22:53,622 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 07:22:53,622 INFO L794 eck$LassoCheckResult]: Stem: 546#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 540#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 541#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 547#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 550#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 551#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 552#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 544#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 545#L556-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 548#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 549#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 556#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 555#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 554#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 553#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 543#L556-1 [2018-11-23 07:22:53,622 INFO L796 eck$LassoCheckResult]: Loop: 543#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 542#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 543#L556-1 [2018-11-23 07:22:53,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:22:53,622 INFO L82 PathProgramCache]: Analyzing trace with hash -618569641, now seen corresponding path program 2 times [2018-11-23 07:22:53,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:22:53,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:22:53,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:53,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:22:53,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:22:53,659 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 07:22:53,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:22:53,659 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2b81393-ebe2-4ab5-9a80-a732362d4e04/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:22:53,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 07:22:53,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 07:22:53,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:22:53,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:22:53,717 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 15 treesize of output 11 [2018-11-23 07:22:53,719 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 11 treesize of output 7 [2018-11-23 07:22:53,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:22:53,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 07:22:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 07:22:53,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:22:53,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 07:22:53,749 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:22:53,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:22:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 3 times [2018-11-23 07:22:53,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:22:53,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:22:53,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:53,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:22:53,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:22:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:22:53,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:22:53,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:22:53,831 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-23 07:22:53,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:22:53,881 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 07:22:53,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:22:53,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 14 transitions. [2018-11-23 07:22:53,882 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 07:22:53,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2018-11-23 07:22:53,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 07:22:53,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 07:22:53,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 07:22:53,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:22:53,882 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:22:53,882 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:22:53,882 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:22:53,882 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 07:22:53,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 07:22:53,882 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 07:22:53,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 07:22:53,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 07:22:53 BoogieIcfgContainer [2018-11-23 07:22:53,890 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 07:22:53,890 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:22:53,890 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:22:53,890 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:22:53,890 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:22:43" (3/4) ... [2018-11-23 07:22:53,893 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 07:22:53,894 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:22:53,894 INFO L168 Benchmark]: Toolchain (without parser) took 11138.69 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 359.7 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -241.6 MB). Peak memory consumption was 118.0 MB. Max. memory is 11.5 GB. [2018-11-23 07:22:53,895 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:22:53,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -210.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 07:22:53,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:22:53,896 INFO L168 Benchmark]: Boogie Preprocessor took 18.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:22:53,896 INFO L168 Benchmark]: RCFGBuilder took 225.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2018-11-23 07:22:53,896 INFO L168 Benchmark]: BuchiAutomizer took 10524.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -56.3 MB). Peak memory consumption was 124.0 MB. Max. memory is 11.5 GB. [2018-11-23 07:22:53,896 INFO L168 Benchmark]: Witness Printer took 3.76 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:22:53,898 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 334.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -210.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 225.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10524.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -56.3 MB). Peak memory consumption was 124.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.76 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] 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 10.4s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 6.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 5. Nontrivial modules had stage [1, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 46 SDtfs, 20 SDslu, 29 SDs, 0 SdLazy, 84 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1351 mio100 ax102 hnf100 lsp96 ukn25 mio100 lsp36 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 2 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...