./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7650ae2b-4964-4161-b4d7-d608a4e21114/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7650ae2b-4964-4161-b4d7-d608a4e21114/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7650ae2b-4964-4161-b4d7-d608a4e21114/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7650ae2b-4964-4161-b4d7-d608a4e21114/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_7650ae2b-4964-4161-b4d7-d608a4e21114/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7650ae2b-4964-4161-b4d7-d608a4e21114/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-0cd3be1 [2018-11-28 10:48:10,962 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:48:10,963 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:48:10,970 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:48:10,970 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:48:10,971 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:48:10,972 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:48:10,973 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:48:10,974 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:48:10,975 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:48:10,975 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:48:10,976 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:48:10,977 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:48:10,977 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:48:10,978 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:48:10,978 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:48:10,979 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:48:10,980 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:48:10,981 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:48:10,982 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:48:10,982 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:48:10,983 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:48:10,986 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:48:10,986 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:48:10,986 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:48:10,986 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:48:10,987 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:48:10,987 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:48:10,988 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:48:10,989 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:48:10,989 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:48:10,989 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:48:10,989 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:48:10,989 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:48:10,990 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:48:10,990 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:48:10,990 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7650ae2b-4964-4161-b4d7-d608a4e21114/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 10:48:10,998 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:48:10,998 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:48:10,999 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:48:10,999 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:48:10,999 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:48:10,999 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 10:48:11,000 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 10:48:11,000 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 10:48:11,000 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 10:48:11,000 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 10:48:11,001 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 10:48:11,001 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:48:11,001 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 10:48:11,001 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 10:48:11,001 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:48:11,001 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 10:48:11,001 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 10:48:11,001 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 10:48:11,002 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 10:48:11,002 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 10:48:11,002 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:48:11,002 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 10:48:11,002 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:48:11,002 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:48:11,002 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 10:48:11,003 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:48:11,003 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 10:48:11,003 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 10:48:11,004 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 10:48:11,005 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_7650ae2b-4964-4161-b4d7-d608a4e21114/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-28 10:48:11,030 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:48:11,039 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:48:11,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:48:11,043 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:48:11,043 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:48:11,043 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7650ae2b-4964-4161-b4d7-d608a4e21114/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i [2018-11-28 10:48:11,090 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7650ae2b-4964-4161-b4d7-d608a4e21114/bin-2019/uautomizer/data/7ab6af8ba/6ff1e45973a148249271c03b66ee8c6a/FLAGe2a18dd7f [2018-11-28 10:48:11,509 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:48:11,509 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7650ae2b-4964-4161-b4d7-d608a4e21114/sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i [2018-11-28 10:48:11,516 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7650ae2b-4964-4161-b4d7-d608a4e21114/bin-2019/uautomizer/data/7ab6af8ba/6ff1e45973a148249271c03b66ee8c6a/FLAGe2a18dd7f [2018-11-28 10:48:11,524 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7650ae2b-4964-4161-b4d7-d608a4e21114/bin-2019/uautomizer/data/7ab6af8ba/6ff1e45973a148249271c03b66ee8c6a [2018-11-28 10:48:11,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:48:11,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 10:48:11,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:48:11,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:48:11,530 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:48:11,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:48:11" (1/1) ... [2018-11-28 10:48:11,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5662505e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:11, skipping insertion in model container [2018-11-28 10:48:11,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:48:11" (1/1) ... [2018-11-28 10:48:11,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:48:11,563 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:48:11,732 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:48:11,741 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:48:11,811 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:48:11,834 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:48:11,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:11 WrapperNode [2018-11-28 10:48:11,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:48:11,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 10:48:11,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 10:48:11,835 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 10:48:11,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:11" (1/1) ... [2018-11-28 10:48:11,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:11" (1/1) ... [2018-11-28 10:48:11,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 10:48:11,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:48:11,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:48:11,865 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:48:11,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:11" (1/1) ... [2018-11-28 10:48:11,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:11" (1/1) ... [2018-11-28 10:48:11,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:11" (1/1) ... [2018-11-28 10:48:11,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:11" (1/1) ... [2018-11-28 10:48:11,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:11" (1/1) ... [2018-11-28 10:48:11,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:11" (1/1) ... [2018-11-28 10:48:11,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:11" (1/1) ... [2018-11-28 10:48:11,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:48:11,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:48:11,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:48:11,879 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:48:11,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7650ae2b-4964-4161-b4d7-d608a4e21114/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:48:11,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 10:48:11,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 10:48:11,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 10:48:11,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 10:48:11,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:48:11,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:48:12,068 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:48:12,069 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 10:48:12,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:48:12 BoogieIcfgContainer [2018-11-28 10:48:12,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:48:12,070 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 10:48:12,070 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 10:48:12,073 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 10:48:12,074 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:48:12,074 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 10:48:11" (1/3) ... [2018-11-28 10:48:12,075 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53c02361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:48:12, skipping insertion in model container [2018-11-28 10:48:12,075 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:48:12,075 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:11" (2/3) ... [2018-11-28 10:48:12,076 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53c02361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:48:12, skipping insertion in model container [2018-11-28 10:48:12,076 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:48:12,076 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:48:12" (3/3) ... [2018-11-28 10:48:12,077 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.10-alloca_true-termination_true-no-overflow.c.i [2018-11-28 10:48:12,123 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:48:12,124 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 10:48:12,124 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 10:48:12,124 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 10:48:12,124 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:48:12,125 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:48:12,125 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 10:48:12,125 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:48:12,125 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 10:48:12,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-28 10:48:12,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:48:12,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:12,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:12,159 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 10:48:12,159 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 10:48:12,159 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 10:48:12,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-28 10:48:12,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:48:12,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:12,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:12,161 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 10:48:12,161 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 10:48:12,168 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-28 10:48:12,169 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~mem6;havoc test_fun_#t~mem5;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-28 10:48:12,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:12,173 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 10:48:12,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:12,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:12,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:12,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:12,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:12,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:12,284 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 1 times [2018-11-28 10:48:12,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:12,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:12,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:12,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:12,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:12,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:12,299 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-11-28 10:48:12,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:12,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:12,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:12,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:12,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:12,637 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-11-28 10:48:12,723 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:48:12,723 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:48:12,723 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:48:12,724 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:48:12,724 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:48:12,724 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:48:12,724 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:48:12,724 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:48:12,724 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-28 10:48:12,724 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:48:12,725 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:48:12,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:12,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:12,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:12,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:12,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:12,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:12,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:12,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:12,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:12,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:12,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:12,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:12,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:12,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:12,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:12,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:12,985 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-11-28 10:48:13,338 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:48:13,343 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:48:13,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:13,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:13,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:13,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:13,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:13,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:13,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:13,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:13,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:13,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:13,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:13,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:13,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:13,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:13,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:13,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:13,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:13,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:13,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:13,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:13,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:13,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:13,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:13,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:13,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:13,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:13,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:13,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:13,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:13,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:13,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:13,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:13,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:13,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:13,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:13,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:13,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:13,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:13,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:13,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:13,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:13,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:13,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:13,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:13,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:13,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:13,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:13,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:13,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:13,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:13,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:13,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:13,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:13,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:13,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:13,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:13,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:13,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:13,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:13,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:13,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:13,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:13,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:13,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:13,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:13,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:13,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:13,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:13,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:13,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:13,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:13,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:13,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:13,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:13,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:13,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:13,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:13,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:13,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:13,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:13,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:13,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:13,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:13,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:13,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:13,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:13,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:13,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:13,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:13,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:13,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:13,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:13,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:13,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:13,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:13,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:13,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:13,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:13,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:13,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:13,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:13,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:13,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:13,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:13,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:13,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:13,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:13,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:13,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:13,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:13,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:13,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:13,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:13,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:13,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:13,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:13,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:13,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:13,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:13,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:13,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:13,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:13,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:13,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:13,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:13,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:13,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:13,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:13,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:13,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:13,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:13,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:13,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:13,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:13,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:13,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:13,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:13,439 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:48:13,454 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 10:48:13,454 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 10:48:13,456 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:48:13,458 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 10:48:13,458 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:48:13,459 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)_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 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-28 10:48:13,503 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-28 10:48:13,507 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 10:48:13,508 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 10:48:13,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:13,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:13,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:13,589 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-28 10:48:13,590 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2018-11-28 10:48:13,630 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-28 10:48:13,630 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-28 10:48:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 10:48:13,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2018-11-28 10:48:13,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-28 10:48:13,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:48:13,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-28 10:48:13,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:48:13,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-28 10:48:13,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:48:13,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2018-11-28 10:48:13,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:48:13,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 11 states and 14 transitions. [2018-11-28 10:48:13,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 10:48:13,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 10:48:13,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-28 10:48:13,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:48:13,639 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 10:48:13,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-28 10:48:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-28 10:48:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 10:48:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-28 10:48:13,656 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 10:48:13,656 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 10:48:13,656 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 10:48:13,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-28 10:48:13,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:48:13,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:13,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:13,657 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 10:48:13,657 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 10:48:13,658 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~mem6;havoc test_fun_#t~mem5;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-28 10:48:13,658 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~mem6;havoc test_fun_#t~mem5;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-28 10:48:13,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:13,658 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2018-11-28 10:48:13,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:13,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:13,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:13,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:13,682 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 2 times [2018-11-28 10:48:13,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:13,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:13,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:13,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:13,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:13,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:13,693 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2018-11-28 10:48:13,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:13,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:13,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:13,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:13,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:13,844 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-28 10:48:13,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:13,845 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7650ae2b-4964-4161-b4d7-d608a4e21114/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-28 10:48:13,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:13,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:13,918 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 10:48:13,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:13,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:13,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-28 10:48:13,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:13,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-28 10:48:13,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:13,991 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 34 treesize of output 25 [2018-11-28 10:48:13,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:13,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:14,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:14,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:16 [2018-11-28 10:48:14,043 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 38 treesize of output 30 [2018-11-28 10:48:14,047 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 21 treesize of output 15 [2018-11-28 10:48:14,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:14,055 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-28 10:48:14,056 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:14,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:14,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:14,071 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:42, output treesize:5 [2018-11-28 10:48:14,082 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-28 10:48:14,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:14,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-28 10:48:14,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 10:48:14,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-28 10:48:14,149 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-11-28 10:48:14,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:14,194 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-11-28 10:48:14,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 10:48:14,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2018-11-28 10:48:14,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:48:14,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2018-11-28 10:48:14,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 10:48:14,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 10:48:14,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-11-28 10:48:14,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:48:14,196 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-28 10:48:14,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-11-28 10:48:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-11-28 10:48:14,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 10:48:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-11-28 10:48:14,198 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-28 10:48:14,198 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-28 10:48:14,198 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 10:48:14,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2018-11-28 10:48:14,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:48:14,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:14,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:14,198 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 10:48:14,199 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 10:48:14,199 INFO L794 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 229#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); 230#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); 236#L555-1 [2018-11-28 10:48:14,199 INFO L796 eck$LassoCheckResult]: Loop: 236#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;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); 232#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; 233#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); 236#L555-1 [2018-11-28 10:48:14,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:14,199 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 10:48:14,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:14,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:14,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:14,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:14,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:14,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:14,212 INFO L82 PathProgramCache]: Analyzing trace with hash 41795, now seen corresponding path program 1 times [2018-11-28 10:48:14,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:14,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:14,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:14,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:14,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:14,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:14,221 INFO L82 PathProgramCache]: Analyzing trace with hash 889571264, now seen corresponding path program 2 times [2018-11-28 10:48:14,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:14,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:14,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:14,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:14,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:14,431 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 89 [2018-11-28 10:48:14,502 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:48:14,502 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:48:14,502 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:48:14,502 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:48:14,503 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:48:14,503 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:48:14,503 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:48:14,503 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:48:14,503 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-28 10:48:14,503 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:48:14,503 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:48:14,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:14,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:14,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:14,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:14,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:14,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:14,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:14,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:14,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:14,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:14,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:14,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:14,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:14,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:15,018 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:48:15,018 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:48:15,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:15,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:15,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:15,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:15,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:15,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:15,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:15,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:15,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:15,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:15,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:15,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:15,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:15,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:15,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:15,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:15,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:15,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:15,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:15,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:15,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:15,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:15,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:15,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:15,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:15,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:15,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:15,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:15,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:15,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:15,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:15,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:15,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:15,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:15,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:15,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:15,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:15,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:15,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:15,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:15,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:15,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:15,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:15,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:15,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:15,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:15,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:15,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:15,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:15,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:15,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:15,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:15,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:15,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:15,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:15,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:15,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:15,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:15,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:15,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:15,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:15,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:15,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:15,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:15,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:15,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:15,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:15,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:15,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:15,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:15,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,070 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:48:15,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:15,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,071 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:48:15,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:15,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:15,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:15,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:15,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:15,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:15,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:15,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:15,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:15,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:15,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:15,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:15,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,085 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:48:15,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:15,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,086 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:48:15,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:15,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:15,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,090 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:48:15,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:15,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,091 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:48:15,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:48:15,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:15,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:15,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:15,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:15,096 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 10:48:15,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:15,102 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 10:48:15,103 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 10:48:15,152 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:48:15,192 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 10:48:15,192 INFO L444 ModelExtractionUtils]: 44 out of 56 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-11-28 10:48:15,193 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:48:15,194 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-28 10:48:15,194 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:48:15,194 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-28 10:48:15,266 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-28 10:48:15,267 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 10:48:15,267 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 10:48:15,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:15,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:15,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:15,317 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:15,329 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-28 10:48:15,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:15,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-11-28 10:48:15,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:15,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:15,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:15,364 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:15,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-11-28 10:48:15,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:15,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:48:15,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:48:15,397 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-28 10:48:15,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:15,418 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-28 10:48:15,418 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-28 10:48:15,433 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-28 10:48:15,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 10:48:15,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 10:48:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2018-11-28 10:48:15,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-28 10:48:15,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:48:15,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 10:48:15,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:48:15,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-28 10:48:15,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:48:15,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2018-11-28 10:48:15,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:48:15,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 12 transitions. [2018-11-28 10:48:15,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 10:48:15,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 10:48:15,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2018-11-28 10:48:15,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:48:15,437 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-28 10:48:15,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2018-11-28 10:48:15,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-11-28 10:48:15,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 10:48:15,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-11-28 10:48:15,438 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-28 10:48:15,439 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-28 10:48:15,439 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 10:48:15,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-11-28 10:48:15,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 10:48:15,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:15,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:15,439 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2018-11-28 10:48:15,440 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 10:48:15,441 INFO L794 eck$LassoCheckResult]: Stem: 394#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 392#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); 393#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); 400#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;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); 397#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; 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); 399#L555-1 [2018-11-28 10:48:15,441 INFO L796 eck$LassoCheckResult]: Loop: 399#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;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); 395#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; 396#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); 399#L555-1 [2018-11-28 10:48:15,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:15,441 INFO L82 PathProgramCache]: Analyzing trace with hash 889571326, now seen corresponding path program 2 times [2018-11-28 10:48:15,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:15,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:15,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:15,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:15,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:15,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:15,490 INFO L82 PathProgramCache]: Analyzing trace with hash 41795, now seen corresponding path program 2 times [2018-11-28 10:48:15,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:15,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:15,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:15,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:15,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:15,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:15,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1271168550, now seen corresponding path program 2 times [2018-11-28 10:48:15,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:15,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:15,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:15,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:15,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:15,563 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-28 10:48:15,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:15,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7650ae2b-4964-4161-b4d7-d608a4e21114/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-28 10:48:15,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 10:48:15,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 10:48:15,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 10:48:15,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:15,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:15,651 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:15,653 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:15,655 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-28 10:48:15,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:15,673 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-28 10:48:15,676 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-28 10:48:15,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:15,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:15,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:38 [2018-11-28 10:48:15,726 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-28 10:48:15,741 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-28 10:48:15,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:15,750 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-28 10:48:15,750 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:15,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:15,756 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-28 10:48:15,757 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:3 [2018-11-28 10:48:15,769 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-28 10:48:15,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:15,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-28 10:48:15,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 10:48:15,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-28 10:48:15,846 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-28 10:48:15,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:15,964 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-11-28 10:48:15,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 10:48:15,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 10 transitions. [2018-11-28 10:48:15,964 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:48:15,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2018-11-28 10:48:15,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 10:48:15,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 10:48:15,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 10:48:15,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:48:15,965 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:48:15,965 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:48:15,965 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:48:15,965 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 10:48:15,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 10:48:15,965 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:48:15,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 10:48:15,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 10:48:15 BoogieIcfgContainer [2018-11-28 10:48:15,969 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 10:48:15,970 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 10:48:15,970 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 10:48:15,970 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 10:48:15,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:48:12" (3/4) ... [2018-11-28 10:48:15,973 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 10:48:15,973 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 10:48:15,973 INFO L168 Benchmark]: Toolchain (without parser) took 4447.14 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 341.8 MB). Free memory was 955.3 MB in the beginning and 1.2 GB in the end (delta: -284.7 MB). Peak memory consumption was 57.2 MB. Max. memory is 11.5 GB. [2018-11-28 10:48:15,974 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 984.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:48:15,974 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 955.3 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-28 10:48:15,975 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.47 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 10:48:15,975 INFO L168 Benchmark]: Boogie Preprocessor took 14.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:48:15,975 INFO L168 Benchmark]: RCFGBuilder took 190.24 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: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-11-28 10:48:15,976 INFO L168 Benchmark]: BuchiAutomizer took 3899.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -130.0 MB). Peak memory consumption was 62.5 MB. Max. memory is 11.5 GB. [2018-11-28 10:48:15,976 INFO L168 Benchmark]: Witness Printer took 3.18 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-28 10:48:15,978 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 984.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 307.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 955.3 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.47 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 190.24 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: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3899.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -130.0 MB). Peak memory consumption was 62.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.18 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 unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[x_ref][x_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.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. 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, 17 SDs, 0 SdLazy, 104 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s 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: 99ms 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...