./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/twisted-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0a6cd1b4-a8c2-4c59-80ed-d9b679ce7b6e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0a6cd1b4-a8c2-4c59-80ed-d9b679ce7b6e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0a6cd1b4-a8c2-4c59-80ed-d9b679ce7b6e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0a6cd1b4-a8c2-4c59-80ed-d9b679ce7b6e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/twisted-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0a6cd1b4-a8c2-4c59-80ed-d9b679ce7b6e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0a6cd1b4-a8c2-4c59-80ed-d9b679ce7b6e/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 1a7013a4cfa859e3e95189f90d363983a25fcd0e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 06:29:37,518 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 06:29:37,519 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 06:29:37,525 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 06:29:37,525 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 06:29:37,526 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 06:29:37,527 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 06:29:37,528 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 06:29:37,528 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 06:29:37,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 06:29:37,529 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 06:29:37,530 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 06:29:37,530 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 06:29:37,531 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 06:29:37,531 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 06:29:37,532 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 06:29:37,532 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 06:29:37,533 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 06:29:37,534 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 06:29:37,535 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 06:29:37,535 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 06:29:37,536 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 06:29:37,537 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 06:29:37,537 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 06:29:37,537 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 06:29:37,538 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 06:29:37,538 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 06:29:37,539 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 06:29:37,539 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 06:29:37,540 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 06:29:37,540 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 06:29:37,540 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 06:29:37,541 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 06:29:37,541 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 06:29:37,541 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 06:29:37,542 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 06:29:37,542 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0a6cd1b4-a8c2-4c59-80ed-d9b679ce7b6e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 06:29:37,550 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 06:29:37,550 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 06:29:37,551 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 06:29:37,551 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 06:29:37,551 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 06:29:37,551 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 06:29:37,551 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 06:29:37,551 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 06:29:37,551 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 06:29:37,551 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 06:29:37,552 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 06:29:37,552 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 06:29:37,552 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 06:29:37,552 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 06:29:37,552 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 06:29:37,552 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 06:29:37,552 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 06:29:37,552 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 06:29:37,552 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 06:29:37,552 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 06:29:37,552 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 06:29:37,553 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 06:29:37,553 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 06:29:37,553 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 06:29:37,553 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 06:29:37,553 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 06:29:37,553 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 06:29:37,553 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 06:29:37,554 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 06:29:37,554 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_0a6cd1b4-a8c2-4c59-80ed-d9b679ce7b6e/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 -> 1a7013a4cfa859e3e95189f90d363983a25fcd0e [2018-12-02 06:29:37,572 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 06:29:37,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 06:29:37,583 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 06:29:37,585 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 06:29:37,585 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 06:29:37,585 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0a6cd1b4-a8c2-4c59-80ed-d9b679ce7b6e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/twisted-alloca_true-termination.c.i [2018-12-02 06:29:37,629 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a6cd1b4-a8c2-4c59-80ed-d9b679ce7b6e/bin-2019/uautomizer/data/6ebb57405/19221ddb4db74a0183208d4d88c074cd/FLAG4c03ecc25 [2018-12-02 06:29:37,979 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 06:29:37,980 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0a6cd1b4-a8c2-4c59-80ed-d9b679ce7b6e/sv-benchmarks/c/termination-memory-alloca/twisted-alloca_true-termination.c.i [2018-12-02 06:29:37,986 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a6cd1b4-a8c2-4c59-80ed-d9b679ce7b6e/bin-2019/uautomizer/data/6ebb57405/19221ddb4db74a0183208d4d88c074cd/FLAG4c03ecc25 [2018-12-02 06:29:37,993 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0a6cd1b4-a8c2-4c59-80ed-d9b679ce7b6e/bin-2019/uautomizer/data/6ebb57405/19221ddb4db74a0183208d4d88c074cd [2018-12-02 06:29:37,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 06:29:37,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 06:29:37,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 06:29:37,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 06:29:37,998 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 06:29:37,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:29:37" (1/1) ... [2018-12-02 06:29:38,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@264a29c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:37, skipping insertion in model container [2018-12-02 06:29:38,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:29:37" (1/1) ... [2018-12-02 06:29:38,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 06:29:38,022 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 06:29:38,160 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:29:38,166 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 06:29:38,226 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:29:38,245 INFO L195 MainTranslator]: Completed translation [2018-12-02 06:29:38,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:38 WrapperNode [2018-12-02 06:29:38,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 06:29:38,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 06:29:38,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 06:29:38,247 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 06:29:38,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:38" (1/1) ... [2018-12-02 06:29:38,259 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:38" (1/1) ... [2018-12-02 06:29:38,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 06:29:38,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 06:29:38,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 06:29:38,272 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 06:29:38,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:38" (1/1) ... [2018-12-02 06:29:38,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:38" (1/1) ... [2018-12-02 06:29:38,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:38" (1/1) ... [2018-12-02 06:29:38,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:38" (1/1) ... [2018-12-02 06:29:38,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:38" (1/1) ... [2018-12-02 06:29:38,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:38" (1/1) ... [2018-12-02 06:29:38,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:38" (1/1) ... [2018-12-02 06:29:38,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 06:29:38,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 06:29:38,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 06:29:38,287 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 06:29:38,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6cd1b4-a8c2-4c59-80ed-d9b679ce7b6e/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-12-02 06:29:38,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 06:29:38,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 06:29:38,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 06:29:38,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 06:29:38,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 06:29:38,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 06:29:38,469 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 06:29:38,470 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 06:29:38,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:29:38 BoogieIcfgContainer [2018-12-02 06:29:38,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 06:29:38,471 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 06:29:38,471 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 06:29:38,474 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 06:29:38,474 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 06:29:38,474 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 06:29:37" (1/3) ... [2018-12-02 06:29:38,475 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38aa5d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 06:29:38, skipping insertion in model container [2018-12-02 06:29:38,475 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 06:29:38,475 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:29:38" (2/3) ... [2018-12-02 06:29:38,476 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38aa5d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 06:29:38, skipping insertion in model container [2018-12-02 06:29:38,476 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 06:29:38,476 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:29:38" (3/3) ... [2018-12-02 06:29:38,477 INFO L375 chiAutomizerObserver]: Analyzing ICFG twisted-alloca_true-termination.c.i [2018-12-02 06:29:38,510 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 06:29:38,511 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 06:29:38,511 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 06:29:38,511 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 06:29:38,511 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 06:29:38,511 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 06:29:38,511 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 06:29:38,511 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 06:29:38,511 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 06:29:38,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-02 06:29:38,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 06:29:38,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:29:38,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:29:38,537 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 06:29:38,537 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 06:29:38,537 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 06:29:38,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-02 06:29:38,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 06:29:38,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:29:38,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:29:38,539 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 06:29:38,539 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 06:29:38,544 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 3#L569true [2018-12-02 06:29:38,544 INFO L796 eck$LassoCheckResult]: Loop: 3#L569true assume !true; 8#L564true goto; 4#L567true call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 11#L564-1true assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 6#L566true assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 3#L569true [2018-12-02 06:29:38,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:38,548 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 06:29:38,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:29:38,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:29:38,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:38,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:38,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:38,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:38,639 INFO L82 PathProgramCache]: Analyzing trace with hash 46885240, now seen corresponding path program 1 times [2018-12-02 06:29:38,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:29:38,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:29:38,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:38,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:38,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:29:38,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:38,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-02 06:29:38,659 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 06:29:38,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 06:29:38,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 06:29:38,669 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-12-02 06:29:38,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:38,673 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-12-02 06:29:38,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 06:29:38,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-12-02 06:29:38,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 06:29:38,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2018-12-02 06:29:38,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 06:29:38,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 06:29:38,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-12-02 06:29:38,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 06:29:38,678 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-02 06:29:38,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-12-02 06:29:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-02 06:29:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-02 06:29:38,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-02 06:29:38,694 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-02 06:29:38,695 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-02 06:29:38,695 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 06:29:38,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-12-02 06:29:38,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 06:29:38,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:29:38,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:29:38,695 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 06:29:38,695 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:38,696 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 39#L569 [2018-12-02 06:29:38,696 INFO L796 eck$LassoCheckResult]: Loop: 39#L569 goto; 42#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 46#L557-1 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 40#L564 goto; 41#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 44#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 45#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 39#L569 [2018-12-02 06:29:38,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:38,696 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-02 06:29:38,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:29:38,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:29:38,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:38,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:38,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:38,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:38,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1311753714, now seen corresponding path program 1 times [2018-12-02 06:29:38,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:29:38,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:29:38,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:38,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:29:38,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:38,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:38,739 INFO L82 PathProgramCache]: Analyzing trace with hash 234543116, now seen corresponding path program 1 times [2018-12-02 06:29:38,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:29:38,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:29:38,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:38,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:38,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:39,198 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2018-12-02 06:29:39,321 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-12-02 06:29:39,329 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 06:29:39,330 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 06:29:39,330 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 06:29:39,330 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 06:29:39,330 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 06:29:39,330 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 06:29:39,330 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 06:29:39,330 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 06:29:39,330 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-02 06:29:39,331 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 06:29:39,331 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 06:29:39,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,646 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2018-12-02 06:29:39,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:39,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:40,071 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 06:29:40,074 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 06:29:40,076 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-12-02 06:29:40,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:40,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:40,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:40,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:40,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:40,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:40,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:40,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:40,081 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-12-02 06:29:40,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:40,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:40,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:40,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:40,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:40,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:40,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:40,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:40,083 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-12-02 06:29:40,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:40,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:40,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:40,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:40,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:40,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:40,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:40,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:40,085 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-12-02 06:29:40,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:40,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:40,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:40,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:40,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:40,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:40,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:40,089 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-12-02 06:29:40,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:40,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:40,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:40,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:40,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:40,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:40,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:40,093 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-12-02 06:29:40,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:40,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:40,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:40,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:40,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:40,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:40,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:40,097 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-12-02 06:29:40,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:40,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:40,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:40,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:40,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:40,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:40,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:40,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:40,100 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-12-02 06:29:40,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:40,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:40,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:40,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:40,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:40,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:40,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:40,103 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-12-02 06:29:40,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:40,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:40,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:40,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:40,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:40,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:40,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:40,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:40,105 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-12-02 06:29:40,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:40,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:40,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:40,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:40,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:40,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:40,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:40,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:40,107 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-12-02 06:29:40,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:40,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:40,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:40,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:40,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:40,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:40,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:40,116 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-12-02 06:29:40,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:40,116 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 06:29:40,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:40,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:40,118 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 06:29:40,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:40,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:40,121 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-12-02 06:29:40,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:40,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:40,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:40,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:40,123 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:40,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:40,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:40,125 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-12-02 06:29:40,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:40,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:40,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:40,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:40,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:40,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:40,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:40,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-12-02 06:29:40,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:40,129 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 06:29:40,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:40,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:40,130 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 06:29:40,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:40,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:40,135 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-12-02 06:29:40,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:40,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:40,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:40,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:40,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:40,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:40,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:40,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-12-02 06:29:40,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:40,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:40,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:40,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:40,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:40,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:40,158 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 06:29:40,161 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 06:29:40,161 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 06:29:40,162 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 06:29:40,163 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 06:29:40,164 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 06:29:40,164 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_1 + 1 Supporting invariants [] [2018-12-02 06:29:40,256 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-12-02 06:29:40,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 06:29:40,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:40,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:40,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:40,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:40,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-12-02 06:29:40,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:40,328 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 37 treesize of output 26 [2018-12-02 06:29:40,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:29:40,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:29:40,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:29:40,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2018-12-02 06:29:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:29:40,346 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 06:29:40,346 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-12-02 06:29:40,375 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 20 states and 27 transitions. Complement of second has 6 states. [2018-12-02 06:29:40,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 06:29:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 06:29:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-02 06:29:40,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 7 letters. [2018-12-02 06:29:40,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:29:40,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 7 letters. [2018-12-02 06:29:40,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:29:40,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 14 letters. [2018-12-02 06:29:40,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:29:40,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2018-12-02 06:29:40,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 06:29:40,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 21 transitions. [2018-12-02 06:29:40,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-02 06:29:40,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-02 06:29:40,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2018-12-02 06:29:40,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 06:29:40,382 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-12-02 06:29:40,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2018-12-02 06:29:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-12-02 06:29:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 06:29:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-12-02 06:29:40,383 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-02 06:29:40,383 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-02 06:29:40,383 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 06:29:40,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-12-02 06:29:40,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 06:29:40,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:29:40,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:29:40,384 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 06:29:40,385 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 06:29:40,385 INFO L794 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 267#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 268#L569 goto; 272#L560 [2018-12-02 06:29:40,385 INFO L796 eck$LassoCheckResult]: Loop: 272#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 278#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 279#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 272#L560 [2018-12-02 06:29:40,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:40,385 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-12-02 06:29:40,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:29:40,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:29:40,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:40,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:40,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:40,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:40,403 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2018-12-02 06:29:40,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:29:40,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:29:40,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:40,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:40,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:40,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:40,412 INFO L82 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2018-12-02 06:29:40,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:29:40,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:29:40,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:40,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:40,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:40,826 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 103 [2018-12-02 06:29:40,973 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-12-02 06:29:40,976 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 06:29:40,976 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 06:29:40,976 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 06:29:40,976 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 06:29:40,976 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 06:29:40,976 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 06:29:40,976 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 06:29:40,976 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 06:29:40,976 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-02 06:29:40,976 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 06:29:40,976 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 06:29:40,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:40,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:40,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:40,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:40,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:40,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:40,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:40,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:40,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:40,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:40,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:40,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:40,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:40,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:41,245 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2018-12-02 06:29:41,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:41,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:41,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:41,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:41,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:41,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:41,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:41,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:41,686 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 06:29:41,686 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 06:29:41,686 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-12-02 06:29:41,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:41,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:41,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:41,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,688 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-12-02 06:29:41,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:41,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:41,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:41,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,689 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-12-02 06:29:41,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:41,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:41,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:41,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,691 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-12-02 06:29:41,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:41,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,694 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-12-02 06:29:41,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:41,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,698 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-12-02 06:29:41,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:41,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:41,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:41,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,700 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-12-02 06:29:41,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:41,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:41,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:41,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,702 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-12-02 06:29:41,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:41,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,705 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-12-02 06:29:41,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:41,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:41,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:41,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,706 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-12-02 06:29:41,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:41,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:41,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:41,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,708 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-12-02 06:29:41,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:41,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:41,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:41,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,710 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-12-02 06:29:41,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:41,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,713 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-12-02 06:29:41,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:41,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:41,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:41,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,714 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-12-02 06:29:41,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,714 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 06:29:41,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,715 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 06:29:41,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,718 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-12-02 06:29:41,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:41,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,723 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-12-02 06:29:41,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:41,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,727 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-12-02 06:29:41,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,727 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 06:29:41,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,728 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 06:29:41,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:29:41,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:41,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,735 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-12-02 06:29:41,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:41,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:29:41,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,738 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 06:29:41,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,739 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 06:29:41,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,743 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-12-02 06:29:41,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,743 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 06:29:41,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,744 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 06:29:41,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:29:41,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:41,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,750 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-12-02 06:29:41,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:41,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,755 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-12-02 06:29:41,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:41,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,759 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-12-02 06:29:41,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:41,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,763 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-12-02 06:29:41,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:41,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,776 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-12-02 06:29:41,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:41,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:41,779 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-12-02 06:29:41,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:41,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:41,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:41,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:41,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:41,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:41,788 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 06:29:41,792 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 06:29:41,793 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 06:29:41,793 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 06:29:41,794 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 06:29:41,794 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 06:29:41,794 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_2 Supporting invariants [] [2018-12-02 06:29:41,876 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2018-12-02 06:29:41,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 06:29:41,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 06:29:41,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:41,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:41,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:41,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:41,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-12-02 06:29:41,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:41,932 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 49 treesize of output 38 [2018-12-02 06:29:41,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:29:41,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:41,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:41,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:41,953 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 34 treesize of output 49 [2018-12-02 06:29:41,953 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 06:29:41,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 06:29:41,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 06:29:41,977 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-12-02 06:29:41,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:29:41,997 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 06:29:41,997 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-12-02 06:29:42,013 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 34 states and 43 transitions. Complement of second has 7 states. [2018-12-02 06:29:42,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 06:29:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 06:29:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-02 06:29:42,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2018-12-02 06:29:42,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:29:42,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-02 06:29:42,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:29:42,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2018-12-02 06:29:42,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:29:42,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2018-12-02 06:29:42,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 06:29:42,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 31 transitions. [2018-12-02 06:29:42,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-02 06:29:42,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-02 06:29:42,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2018-12-02 06:29:42,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 06:29:42,015 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-12-02 06:29:42,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2018-12-02 06:29:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-12-02 06:29:42,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 06:29:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-12-02 06:29:42,016 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-12-02 06:29:42,017 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-12-02 06:29:42,017 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 06:29:42,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2018-12-02 06:29:42,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 06:29:42,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:29:42,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:29:42,018 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:42,018 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 06:29:42,018 INFO L794 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 505#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 506#L569 goto; 507#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 515#L557-1 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 503#L564 goto; 504#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 510#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 511#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 516#L569 goto; 517#L560 [2018-12-02 06:29:42,019 INFO L796 eck$LassoCheckResult]: Loop: 517#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 513#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 514#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 517#L560 [2018-12-02 06:29:42,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:42,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1319097990, now seen corresponding path program 2 times [2018-12-02 06:29:42,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:29:42,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:29:42,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:42,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:42,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:42,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:42,033 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2018-12-02 06:29:42,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:29:42,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:29:42,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:42,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:29:42,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:42,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:42,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1702545424, now seen corresponding path program 1 times [2018-12-02 06:29:42,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:29:42,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:29:42,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:42,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:29:42,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:29:42,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:29:42,127 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6cd1b4-a8c2-4c59-80ed-d9b679ce7b6e/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-12-02 06:29:42,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:42,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:42,162 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 14 treesize of output 17 [2018-12-02 06:29:42,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 19 [2018-12-02 06:29:42,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:42,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:42,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:42,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-12-02 06:29:42,179 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 06:29:42,187 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:29:42,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:29:42,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:29:42,195 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-12-02 06:29:42,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:42,225 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 42 [2018-12-02 06:29:42,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:42,229 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-12-02 06:29:42,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:29:42,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:29:42,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:29:42,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-12-02 06:29:42,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-12-02 06:29:42,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-12-02 06:29:42,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 06:29:42,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:29:42,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:29:42,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-12-02 06:29:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:29:42,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:29:42,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2018-12-02 06:29:42,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 06:29:42,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:29:42,374 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 9 states. [2018-12-02 06:29:42,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:42,458 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2018-12-02 06:29:42,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:29:42,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2018-12-02 06:29:42,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 06:29:42,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 19 states and 23 transitions. [2018-12-02 06:29:42,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-02 06:29:42,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-02 06:29:42,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2018-12-02 06:29:42,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 06:29:42,459 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-12-02 06:29:42,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2018-12-02 06:29:42,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-12-02 06:29:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 06:29:42,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-12-02 06:29:42,460 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-12-02 06:29:42,460 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-12-02 06:29:42,460 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 06:29:42,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-12-02 06:29:42,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 06:29:42,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:29:42,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:29:42,460 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:42,460 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 06:29:42,461 INFO L794 eck$LassoCheckResult]: Stem: 617#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 611#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 612#L569 goto; 613#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 620#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 621#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 609#L564 goto; 610#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 615#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 616#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 622#L569 goto; 623#L560 [2018-12-02 06:29:42,461 INFO L796 eck$LassoCheckResult]: Loop: 623#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 618#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 619#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 623#L560 [2018-12-02 06:29:42,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:42,461 INFO L82 PathProgramCache]: Analyzing trace with hash -635175977, now seen corresponding path program 1 times [2018-12-02 06:29:42,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:29:42,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:29:42,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:42,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:42,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:29:42,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:29:42,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:29:42,507 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 06:29:42,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:42,507 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 3 times [2018-12-02 06:29:42,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:29:42,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:29:42,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:42,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:42,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:42,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:29:42,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:29:42,628 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-12-02 06:29:42,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:42,646 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-12-02 06:29:42,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:29:42,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-12-02 06:29:42,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 06:29:42,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2018-12-02 06:29:42,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-02 06:29:42,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-02 06:29:42,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-12-02 06:29:42,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 06:29:42,647 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-02 06:29:42,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-12-02 06:29:42,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-02 06:29:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 06:29:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-12-02 06:29:42,648 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-02 06:29:42,648 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-02 06:29:42,648 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 06:29:42,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-12-02 06:29:42,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 06:29:42,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:29:42,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:29:42,649 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:42,649 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 06:29:42,649 INFO L794 eck$LassoCheckResult]: Stem: 659#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 652#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 653#L569 goto; 654#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 662#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 663#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 656#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 667#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 666#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 650#L564 goto; 651#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 657#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 658#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 664#L569 goto; 665#L560 [2018-12-02 06:29:42,649 INFO L796 eck$LassoCheckResult]: Loop: 665#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 660#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 661#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 665#L560 [2018-12-02 06:29:42,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:42,649 INFO L82 PathProgramCache]: Analyzing trace with hash 184869755, now seen corresponding path program 1 times [2018-12-02 06:29:42,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:29:42,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:29:42,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:42,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:29:42,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:42,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:42,668 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 4 times [2018-12-02 06:29:42,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:29:42,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:29:42,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:42,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:42,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:42,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:42,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1306804847, now seen corresponding path program 2 times [2018-12-02 06:29:42,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:29:42,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:29:42,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:42,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:29:42,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:43,933 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 193 DAG size of output: 149 [2018-12-02 06:29:44,244 WARN L180 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-12-02 06:29:44,246 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 06:29:44,246 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 06:29:44,247 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 06:29:44,247 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 06:29:44,247 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 06:29:44,247 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 06:29:44,247 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 06:29:44,247 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 06:29:44,247 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration6_Lasso [2018-12-02 06:29:44,247 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 06:29:44,247 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 06:29:44,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,599 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2018-12-02 06:29:44,720 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2018-12-02 06:29:44,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:44,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:29:45,041 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 06:29:45,041 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 06:29:45,041 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-12-02 06:29:45,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:45,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:45,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:45,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:45,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,043 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-12-02 06:29:45,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:45,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,043 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:45,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:45,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,044 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-12-02 06:29:45,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:45,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:45,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:45,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:45,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,045 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-12-02 06:29:45,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:45,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:45,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:45,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:45,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,046 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-12-02 06:29:45,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:45,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:45,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:45,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:45,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,047 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-12-02 06:29:45,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:45,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:45,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:45,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:45,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,048 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-12-02 06:29:45,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:45,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:45,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:45,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,050 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-12-02 06:29:45,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:29:45,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:45,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:29:45,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:29:45,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,051 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-12-02 06:29:45,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:45,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:45,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:45,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,053 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-12-02 06:29:45,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:45,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:45,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:45,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,056 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-12-02 06:29:45,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:45,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:45,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:45,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,058 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-12-02 06:29:45,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:45,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:45,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:45,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,060 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-12-02 06:29:45,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,060 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 06:29:45,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,061 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 06:29:45,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:45,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,062 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-12-02 06:29:45,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:45,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:45,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:45,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,064 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-12-02 06:29:45,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,064 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 06:29:45,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,065 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 06:29:45,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:45,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,066 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-12-02 06:29:45,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:45,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:45,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:45,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,069 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-12-02 06:29:45,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:45,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:45,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:45,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,071 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-12-02 06:29:45,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:45,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:45,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:45,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,074 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-12-02 06:29:45,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,074 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 06:29:45,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,075 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 06:29:45,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:45,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:29:45,076 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-12-02 06:29:45,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:29:45,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:29:45,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:29:45,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:29:45,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:29:45,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:29:45,083 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 06:29:45,088 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 06:29:45,088 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 06:29:45,088 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 06:29:45,088 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 06:29:45,089 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 06:29:45,089 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_3 + 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_3 Supporting invariants [] [2018-12-02 06:29:45,195 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2018-12-02 06:29:45,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 06:29:45,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 06:29:45,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:45,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:45,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:45,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:45,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-12-02 06:29:45,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:45,242 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 49 treesize of output 38 [2018-12-02 06:29:45,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:29:45,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:45,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:45,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:45,258 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 34 treesize of output 49 [2018-12-02 06:29:45,259 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 06:29:45,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 06:29:45,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 06:29:45,277 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-12-02 06:29:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:29:45,293 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 06:29:45,293 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-12-02 06:29:45,303 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 30 states and 35 transitions. Complement of second has 7 states. [2018-12-02 06:29:45,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 06:29:45,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 06:29:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-02 06:29:45,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-02 06:29:45,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:29:45,303 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 06:29:45,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:45,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:45,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:45,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:45,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-12-02 06:29:45,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:45,349 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 49 treesize of output 38 [2018-12-02 06:29:45,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:29:45,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:45,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:45,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:45,367 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 34 treesize of output 49 [2018-12-02 06:29:45,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 06:29:45,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 06:29:45,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 06:29:45,387 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-12-02 06:29:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:29:45,402 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 06:29:45,402 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-12-02 06:29:45,424 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 51 states and 59 transitions. Complement of second has 9 states. [2018-12-02 06:29:45,425 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-12-02 06:29:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 06:29:45,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-12-02 06:29:45,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-02 06:29:45,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:29:45,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 17 letters. Loop has 3 letters. [2018-12-02 06:29:45,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:29:45,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-02 06:29:45,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:29:45,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2018-12-02 06:29:45,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 06:29:45,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 37 states and 43 transitions. [2018-12-02 06:29:45,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-02 06:29:45,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-02 06:29:45,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2018-12-02 06:29:45,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 06:29:45,427 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-12-02 06:29:45,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2018-12-02 06:29:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-12-02 06:29:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 06:29:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-12-02 06:29:45,429 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-12-02 06:29:45,429 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-12-02 06:29:45,429 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 06:29:45,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2018-12-02 06:29:45,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 06:29:45,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:29:45,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:29:45,429 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:29:45,429 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 06:29:45,430 INFO L794 eck$LassoCheckResult]: Stem: 1058#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1051#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 1052#L569 goto; 1053#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1075#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1068#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1069#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1083#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1082#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 1081#L564 goto; 1079#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 1056#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1057#L566 assume 0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2);havoc f_#t~mem14; 1072#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 1074#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1071#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 1070#L569 goto; 1066#L560 [2018-12-02 06:29:45,430 INFO L796 eck$LassoCheckResult]: Loop: 1066#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1060#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1061#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1066#L560 [2018-12-02 06:29:45,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:45,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1305515858, now seen corresponding path program 1 times [2018-12-02 06:29:45,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:29:45,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:29:45,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:45,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:29:45,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 06:29:45,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:29:45,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a6cd1b4-a8c2-4c59-80ed-d9b679ce7b6e/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 06:29:45,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:29:45,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:29:45,496 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 14 treesize of output 17 [2018-12-02 06:29:45,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 19 [2018-12-02 06:29:45,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:45,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:45,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:29:45,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-12-02 06:29:45,510 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 06:29:45,513 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:29:45,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:29:45,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:29:45,521 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:14, output treesize:4 [2018-12-02 06:29:45,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 18 treesize of output 14 [2018-12-02 06:29:45,563 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2018-12-02 06:29:45,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:29:45,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:29:45,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:29:45,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:6 [2018-12-02 06:29:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 06:29:45,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:29:45,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-12-02 06:29:45,588 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 06:29:45,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:29:45,588 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 5 times [2018-12-02 06:29:45,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:29:45,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:29:45,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:45,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:29:45,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:29:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:29:45,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:29:45,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:29:45,649 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. cyclomatic complexity: 10 Second operand 11 states. [2018-12-02 06:29:45,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:29:45,728 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-12-02 06:29:45,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 06:29:45,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 38 transitions. [2018-12-02 06:29:45,728 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 06:29:45,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2018-12-02 06:29:45,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 06:29:45,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 06:29:45,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 06:29:45,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 06:29:45,729 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 06:29:45,729 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 06:29:45,729 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 06:29:45,729 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 06:29:45,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 06:29:45,729 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 06:29:45,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 06:29:45,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 06:29:45 BoogieIcfgContainer [2018-12-02 06:29:45,734 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 06:29:45,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 06:29:45,735 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 06:29:45,735 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 06:29:45,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:29:38" (3/4) ... [2018-12-02 06:29:45,738 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 06:29:45,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 06:29:45,738 INFO L168 Benchmark]: Toolchain (without parser) took 7742.90 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 320.9 MB). Free memory was 956.0 MB in the beginning and 982.0 MB in the end (delta: -26.0 MB). Peak memory consumption was 294.8 MB. Max. memory is 11.5 GB. [2018-12-02 06:29:45,739 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:29:45,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -169.5 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-12-02 06:29:45,739 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:29:45,740 INFO L168 Benchmark]: Boogie Preprocessor took 14.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:29:45,740 INFO L168 Benchmark]: RCFGBuilder took 183.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-12-02 06:29:45,740 INFO L168 Benchmark]: BuchiAutomizer took 7263.56 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 982.0 MB in the end (delta: 118.1 MB). Peak memory consumption was 297.4 MB. Max. memory is 11.5 GB. [2018-12-02 06:29:45,741 INFO L168 Benchmark]: Witness Printer took 3.13 ms. Allocated memory is still 1.4 GB. Free memory is still 982.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:29:45,743 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 249.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -169.5 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 183.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7263.56 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 982.0 MB in the end (delta: 118.1 MB). Peak memory consumption was 297.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.13 ms. Allocated memory is still 1.4 GB. Free memory is still 982.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[j][j] + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[k_ref][k_ref] and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[k_ref][k_ref] and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 6.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 6. Nontrivial modules had stage [2, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 74 SDtfs, 60 SDslu, 134 SDs, 0 SdLazy, 170 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital879 mio100 ax103 hnf100 lsp94 ukn41 mio100 lsp36 div100 bol100 ite100 ukn100 eq183 hnf88 smp93 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...