./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c1dcb193-6ede-44f2-8168-0010669e6b7d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c1dcb193-6ede-44f2-8168-0010669e6b7d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c1dcb193-6ede-44f2-8168-0010669e6b7d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c1dcb193-6ede-44f2-8168-0010669e6b7d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c1dcb193-6ede-44f2-8168-0010669e6b7d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c1dcb193-6ede-44f2-8168-0010669e6b7d/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 fe0a03f8bb40d3c8ee514a7c216e0c7ba9f8c793 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:13:17,510 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:13:17,511 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:13:17,517 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:13:17,518 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:13:17,518 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:13:17,519 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:13:17,520 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:13:17,522 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:13:17,522 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:13:17,523 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:13:17,523 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:13:17,524 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:13:17,525 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:13:17,525 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:13:17,526 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:13:17,526 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:13:17,528 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:13:17,529 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:13:17,530 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:13:17,531 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:13:17,532 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:13:17,533 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:13:17,533 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:13:17,534 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:13:17,534 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:13:17,535 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:13:17,536 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:13:17,536 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:13:17,537 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:13:17,537 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:13:17,538 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:13:17,538 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:13:17,538 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:13:17,538 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:13:17,539 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:13:17,539 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c1dcb193-6ede-44f2-8168-0010669e6b7d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 03:13:17,550 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:13:17,551 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:13:17,552 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:13:17,552 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:13:17,552 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:13:17,552 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 03:13:17,553 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 03:13:17,553 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 03:13:17,553 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 03:13:17,553 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 03:13:17,553 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 03:13:17,553 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:13:17,553 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:13:17,554 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:13:17,554 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:13:17,554 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 03:13:17,554 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 03:13:17,554 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 03:13:17,554 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:13:17,554 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 03:13:17,555 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:13:17,555 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 03:13:17,555 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:13:17,555 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:13:17,555 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 03:13:17,555 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:13:17,555 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:13:17,556 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 03:13:17,556 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 03:13:17,557 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_c1dcb193-6ede-44f2-8168-0010669e6b7d/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 -> fe0a03f8bb40d3c8ee514a7c216e0c7ba9f8c793 [2018-11-23 03:13:17,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:13:17,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:13:17,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:13:17,594 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:13:17,594 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:13:17,595 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c1dcb193-6ede-44f2-8168-0010669e6b7d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i [2018-11-23 03:13:17,643 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c1dcb193-6ede-44f2-8168-0010669e6b7d/bin-2019/uautomizer/data/6a23d7e91/cbff571869b14bab99ed1cfbe4782e40/FLAG10ccd2e7a [2018-11-23 03:13:18,003 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:13:18,004 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c1dcb193-6ede-44f2-8168-0010669e6b7d/sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i [2018-11-23 03:13:18,013 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c1dcb193-6ede-44f2-8168-0010669e6b7d/bin-2019/uautomizer/data/6a23d7e91/cbff571869b14bab99ed1cfbe4782e40/FLAG10ccd2e7a [2018-11-23 03:13:18,402 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c1dcb193-6ede-44f2-8168-0010669e6b7d/bin-2019/uautomizer/data/6a23d7e91/cbff571869b14bab99ed1cfbe4782e40 [2018-11-23 03:13:18,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:13:18,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:13:18,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:13:18,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:13:18,408 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:13:18,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:13:18" (1/1) ... [2018-11-23 03:13:18,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6b7d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:18, skipping insertion in model container [2018-11-23 03:13:18,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:13:18" (1/1) ... [2018-11-23 03:13:18,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:13:18,444 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:13:18,625 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:13:18,634 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:13:18,658 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:13:18,731 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:13:18,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:18 WrapperNode [2018-11-23 03:13:18,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:13:18,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:13:18,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:13:18,732 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:13:18,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:18" (1/1) ... [2018-11-23 03:13:18,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:18" (1/1) ... [2018-11-23 03:13:18,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:13:18,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:13:18,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:13:18,759 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:13:18,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:18" (1/1) ... [2018-11-23 03:13:18,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:18" (1/1) ... [2018-11-23 03:13:18,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:18" (1/1) ... [2018-11-23 03:13:18,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:18" (1/1) ... [2018-11-23 03:13:18,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:18" (1/1) ... [2018-11-23 03:13:18,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:18" (1/1) ... [2018-11-23 03:13:18,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:18" (1/1) ... [2018-11-23 03:13:18,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:13:18,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:13:18,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:13:18,777 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:13:18,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1dcb193-6ede-44f2-8168-0010669e6b7d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:13:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:13:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:13:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:13:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:13:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:13:18,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:13:18,949 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:13:18,949 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 03:13:18,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:13:18 BoogieIcfgContainer [2018-11-23 03:13:18,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:13:18,950 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 03:13:18,950 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 03:13:18,952 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 03:13:18,953 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:13:18,953 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:13:18" (1/3) ... [2018-11-23 03:13:18,953 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d537e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:13:18, skipping insertion in model container [2018-11-23 03:13:18,954 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:13:18,954 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:13:18" (2/3) ... [2018-11-23 03:13:18,954 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d537e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:13:18, skipping insertion in model container [2018-11-23 03:13:18,954 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:13:18,954 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:13:18" (3/3) ... [2018-11-23 03:13:18,955 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.10-alloca_true-termination_true-no-overflow.c.i [2018-11-23 03:13:18,987 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:13:18,988 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 03:13:18,988 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 03:13:18,988 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 03:13:18,988 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:13:18,988 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:13:18,988 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 03:13:18,988 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:13:18,988 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 03:13:19,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-23 03:13:19,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:13:19,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:13:19,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:13:19,022 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:13:19,023 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:13:19,023 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 03:13:19,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-23 03:13:19,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:13:19,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:13:19,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:13:19,024 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:13:19,024 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:13:19,029 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 11#L556-2true [2018-11-23 03:13:19,029 INFO L796 eck$LassoCheckResult]: Loop: 11#L556-2true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 12#L555-1true assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 7#L556true assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 11#L556-2true [2018-11-23 03:13:19,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:19,033 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 03:13:19,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:19,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:19,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:19,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:19,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:19,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:19,139 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 1 times [2018-11-23 03:13:19,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:19,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:19,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:19,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:19,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:19,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:19,158 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-11-23 03:13:19,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:19,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:19,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:19,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:19,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:19,487 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-11-23 03:13:19,568 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:13:19,569 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:13:19,569 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:13:19,569 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:13:19,570 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:13:19,570 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:13:19,570 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:13:19,570 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:13:19,570 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-23 03:13:19,570 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:13:19,571 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:13:19,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:19,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:19,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:19,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:19,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:19,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:19,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:19,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:19,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:19,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:19,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:19,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:19,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:19,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:19,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:19,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:19,837 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-11-23 03:13:20,183 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:13:20,187 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:13:20,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:20,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:20,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:20,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:20,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:20,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:20,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:20,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:20,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:20,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:20,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:20,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:20,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:20,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:20,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:20,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:20,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:20,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:20,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:20,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:20,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:20,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:20,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:20,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:20,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:20,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:20,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:20,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:20,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:20,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:20,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:20,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:20,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:20,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:20,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:20,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:20,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:20,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:20,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:20,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:20,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:20,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:20,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:20,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:20,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:20,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:20,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:20,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:20,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:20,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:20,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:20,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:20,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:20,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:20,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:20,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:20,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:20,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:20,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:20,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:20,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:20,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:20,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:20,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:20,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:20,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:20,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:20,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:20,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:20,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:20,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:20,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:20,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:20,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:20,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:20,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:20,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:20,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:20,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:20,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:20,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:20,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:20,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:20,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:20,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:20,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:20,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:20,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:20,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:20,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:20,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:20,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:20,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:20,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:20,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:20,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:20,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:20,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:20,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:20,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:20,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:20,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:20,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:20,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:20,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:20,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:20,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:20,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:20,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:20,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:20,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:20,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:20,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:20,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:20,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:20,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:20,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:20,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:20,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:20,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:20,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:20,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:20,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:20,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:20,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:20,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:20,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:20,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:20,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:20,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:20,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:20,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:20,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:20,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:20,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:20,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:20,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:20,273 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:13:20,285 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:13:20,285 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 03:13:20,287 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:13:20,289 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:13:20,289 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:13:20,289 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2018-11-23 03:13:20,342 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-23 03:13:20,347 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 03:13:20,348 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 03:13:20,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:13:20,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:13:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:13:20,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:13:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:13:20,415 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-11-23 03:13:20,416 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2018-11-23 03:13:20,457 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 4 states. Result 31 states and 36 transitions. Complement of second has 10 states. [2018-11-23 03:13:20,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 03:13:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:13:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2018-11-23 03:13:20,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-23 03:13:20,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:13:20,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-23 03:13:20,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:13:20,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-23 03:13:20,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:13:20,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2018-11-23 03:13:20,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:13:20,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 11 states and 14 transitions. [2018-11-23 03:13:20,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 03:13:20,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 03:13:20,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-23 03:13:20,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:13:20,469 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 03:13:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-23 03:13:20,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-23 03:13:20,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 03:13:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-23 03:13:20,487 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 03:13:20,487 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 03:13:20,487 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 03:13:20,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-23 03:13:20,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:13:20,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:13:20,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:13:20,488 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:13:20,488 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:13:20,488 INFO L794 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 169#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 177#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 171#L556 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9; 172#L556-2 [2018-11-23 03:13:20,488 INFO L796 eck$LassoCheckResult]: Loop: 172#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 175#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 178#L556 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 172#L556-2 [2018-11-23 03:13:20,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:20,489 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2018-11-23 03:13:20,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:20,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:20,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:20,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:20,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:20,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:20,515 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 2 times [2018-11-23 03:13:20,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:20,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:20,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:20,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:20,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:20,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:20,527 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2018-11-23 03:13:20,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:20,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:20,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:20,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:13:20,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:13:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:13:20,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:13:20,702 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1dcb193-6ede-44f2-8168-0010669e6b7d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:13:20,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:13:20,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:13:20,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:13:20,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:13:20,807 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:13:20,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2018-11-23 03:13:20,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:13:20,841 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 52 [2018-11-23 03:13:20,845 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 03:13:20,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:13:20,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:13:20,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2018-11-23 03:13:20,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:13:20,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-11-23 03:13:20,915 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2018-11-23 03:13:20,919 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 03:13:20,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 03:13:20,932 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 03:13:20,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:13:20,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:13:20,936 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:42, output treesize:5 [2018-11-23 03:13:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:13:20,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:13:20,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-11-23 03:13:20,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 03:13:20,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-23 03:13:20,998 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 12 states. [2018-11-23 03:13:21,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:13:21,086 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-11-23 03:13:21,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 03:13:21,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2018-11-23 03:13:21,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:13:21,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2018-11-23 03:13:21,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 03:13:21,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 03:13:21,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-11-23 03:13:21,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:13:21,088 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-23 03:13:21,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-11-23 03:13:21,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-11-23 03:13:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 03:13:21,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-11-23 03:13:21,089 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-23 03:13:21,090 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-23 03:13:21,090 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 03:13:21,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2018-11-23 03:13:21,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:13:21,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:13:21,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:13:21,090 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 03:13:21,090 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:13:21,090 INFO L794 eck$LassoCheckResult]: Stem: 236#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 234#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 235#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 241#L555-1 [2018-11-23 03:13:21,091 INFO L796 eck$LassoCheckResult]: Loop: 241#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 237#L556 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9; 238#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 241#L555-1 [2018-11-23 03:13:21,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:21,091 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-23 03:13:21,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:21,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:21,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:21,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:21,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:21,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:21,103 INFO L82 PathProgramCache]: Analyzing trace with hash 41795, now seen corresponding path program 1 times [2018-11-23 03:13:21,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:21,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:21,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:21,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:21,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:21,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:21,114 INFO L82 PathProgramCache]: Analyzing trace with hash 889571264, now seen corresponding path program 2 times [2018-11-23 03:13:21,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:21,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:21,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:21,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:13:21,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:21,351 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 89 [2018-11-23 03:13:21,408 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:13:21,408 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:13:21,408 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:13:21,408 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:13:21,408 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:13:21,408 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:13:21,408 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:13:21,408 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:13:21,408 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-23 03:13:21,408 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:13:21,409 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:13:21,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:21,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:21,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:21,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:21,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:21,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:21,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:21,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:21,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:21,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:21,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:21,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:21,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:21,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:13:21,887 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:13:21,887 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:13:21,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:21,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:21,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:21,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:21,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:21,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:21,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:21,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:21,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:21,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:21,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:21,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:21,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:21,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:21,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:21,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:21,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:21,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:21,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:21,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:21,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:21,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:21,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:21,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:21,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:21,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:21,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:21,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:21,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:21,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:21,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:21,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:21,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:21,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:21,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:21,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:21,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:21,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:21,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:21,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:13:21,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:21,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:21,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:13:21,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:13:21,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:21,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:21,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:21,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:21,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:21,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:21,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:21,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:21,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:21,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:21,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:21,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:21,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:21,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:21,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:21,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:21,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:21,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:21,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:21,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:21,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:21,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:21,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:21,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:21,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:21,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:21,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,942 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:13:21,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:21,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,943 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:13:21,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:21,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:21,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:21,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:21,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:21,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:21,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:21,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:21,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:21,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:13:21,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:21,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:21,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,963 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:13:21,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:21,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,965 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:13:21,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:21,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:21,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,969 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:13:21,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:13:21,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,970 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:13:21,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:13:21,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:13:21,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:13:21,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:13:21,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:13:21,976 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:13:21,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:13:21,983 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 03:13:21,983 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 03:13:22,043 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:13:22,070 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 03:13:22,070 INFO L444 ModelExtractionUtils]: 52 out of 56 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 03:13:22,070 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:13:22,071 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-23 03:13:22,072 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:13:22,072 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-11-23 03:13:22,133 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-23 03:13:22,135 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 03:13:22,135 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 03:13:22,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:13:22,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:13:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:13:22,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:13:22,181 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:13:22,190 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-11-23 03:13:22,194 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:13:22,195 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:13:22,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:13:22,198 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 44 treesize of output 49 [2018-11-23 03:13:22,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:13:22,224 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:13:22,225 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 39 treesize of output 38 [2018-11-23 03:13:22,226 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 03:13:22,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 03:13:22,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 03:13:22,257 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-23 03:13:22,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:13:22,277 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-11-23 03:13:22,277 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-23 03:13:22,319 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 19 states and 21 transitions. Complement of second has 7 states. [2018-11-23 03:13:22,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 03:13:22,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:13:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2018-11-23 03:13:22,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-23 03:13:22,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:13:22,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 03:13:22,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:13:22,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-23 03:13:22,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:13:22,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2018-11-23 03:13:22,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:13:22,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 12 transitions. [2018-11-23 03:13:22,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 03:13:22,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 03:13:22,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2018-11-23 03:13:22,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:13:22,323 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-23 03:13:22,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2018-11-23 03:13:22,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-11-23 03:13:22,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 03:13:22,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-11-23 03:13:22,324 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-23 03:13:22,324 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-23 03:13:22,324 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 03:13:22,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-11-23 03:13:22,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:13:22,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:13:22,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:13:22,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2018-11-23 03:13:22,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:13:22,325 INFO L794 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 397#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 398#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 404#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 402#L556 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 403#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 405#L555-1 [2018-11-23 03:13:22,325 INFO L796 eck$LassoCheckResult]: Loop: 405#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 400#L556 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9; 401#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 405#L555-1 [2018-11-23 03:13:22,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:22,325 INFO L82 PathProgramCache]: Analyzing trace with hash 889571326, now seen corresponding path program 2 times [2018-11-23 03:13:22,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:22,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:22,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:22,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:13:22,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:22,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:22,342 INFO L82 PathProgramCache]: Analyzing trace with hash 41795, now seen corresponding path program 2 times [2018-11-23 03:13:22,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:22,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:22,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:22,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:13:22,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:13:22,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:13:22,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1271168550, now seen corresponding path program 2 times [2018-11-23 03:13:22,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:13:22,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:13:22,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:22,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:13:22,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:13:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:13:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:13:22,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:13:22,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c1dcb193-6ede-44f2-8168-0010669e6b7d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:13:22,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 03:13:22,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 03:13:22,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:13:22,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:13:22,522 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:13:22,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:13:22,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:13:22,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 52 [2018-11-23 03:13:22,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:13:22,547 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 58 [2018-11-23 03:13:22,550 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 03:13:22,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:13:22,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:13:22,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:38 [2018-11-23 03:13:22,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-11-23 03:13:22,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 25 treesize of output 19 [2018-11-23 03:13:22,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:13:22,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 03:13:22,626 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 03:13:22,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:13:22,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:13:22,633 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:3 [2018-11-23 03:13:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:13:22,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:13:22,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 03:13:22,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 03:13:22,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 03:13:22,722 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-23 03:13:22,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:13:22,853 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-11-23 03:13:22,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 03:13:22,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 10 transitions. [2018-11-23 03:13:22,854 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:13:22,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2018-11-23 03:13:22,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 03:13:22,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 03:13:22,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 03:13:22,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:13:22,854 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:13:22,854 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:13:22,854 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:13:22,854 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 03:13:22,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 03:13:22,854 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:13:22,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 03:13:22,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:13:22 BoogieIcfgContainer [2018-11-23 03:13:22,859 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 03:13:22,859 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:13:22,859 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:13:22,860 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:13:22,860 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:13:18" (3/4) ... [2018-11-23 03:13:22,862 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 03:13:22,862 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:13:22,863 INFO L168 Benchmark]: Toolchain (without parser) took 4458.08 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.8 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -270.8 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. [2018-11-23 03:13:22,863 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:13:22,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:13:22,864 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.25 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:13:22,865 INFO L168 Benchmark]: Boogie Preprocessor took 17.34 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:13:22,865 INFO L168 Benchmark]: RCFGBuilder took 173.44 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: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-23 03:13:22,865 INFO L168 Benchmark]: BuchiAutomizer took 3909.04 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -112.2 MB). Peak memory consumption was 74.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:13:22,866 INFO L168 Benchmark]: Witness Printer took 3.11 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:13:22,867 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 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.25 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.34 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 173.44 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: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3909.04 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -112.2 MB). Peak memory consumption was 74.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.11 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x_ref][x_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 12 SDtfs, 13 SDslu, 20 SDs, 0 SdLazy, 110 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital265 mio100 ax106 hnf100 lsp91 ukn64 mio100 lsp32 div100 bol100 ite100 ukn100 eq196 hnf87 smp100 dnf115 smp100 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 96ms VariablesStem: 10 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...