./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_aff7c6c8-d567-4697-b2d3-bd824832c893/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_aff7c6c8-d567-4697-b2d3-bd824832c893/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_aff7c6c8-d567-4697-b2d3-bd824832c893/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_aff7c6c8-d567-4697-b2d3-bd824832c893/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_aff7c6c8-d567-4697-b2d3-bd824832c893/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_aff7c6c8-d567-4697-b2d3-bd824832c893/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-635dfa2 [2018-12-09 10:42:00,950 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:42:00,952 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:42:00,960 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:42:00,961 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:42:00,961 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:42:00,962 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:42:00,963 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:42:00,964 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:42:00,965 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:42:00,966 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:42:00,966 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:42:00,966 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:42:00,967 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:42:00,968 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:42:00,968 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:42:00,969 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:42:00,970 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:42:00,972 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:42:00,973 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:42:00,973 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:42:00,974 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:42:00,976 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:42:00,976 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:42:00,976 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:42:00,977 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:42:00,977 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:42:00,978 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:42:00,978 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:42:00,979 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:42:00,979 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:42:00,980 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:42:00,980 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:42:00,980 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:42:00,981 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:42:00,981 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:42:00,981 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_aff7c6c8-d567-4697-b2d3-bd824832c893/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 10:42:00,993 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:42:00,993 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:42:00,994 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 10:42:00,994 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 10:42:00,994 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 10:42:00,994 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 10:42:00,994 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 10:42:00,995 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 10:42:00,995 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 10:42:00,995 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 10:42:00,995 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 10:42:00,995 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:42:00,995 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 10:42:00,995 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:42:00,995 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:42:00,996 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 10:42:00,996 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 10:42:00,996 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 10:42:00,996 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:42:00,996 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 10:42:00,996 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 10:42:00,996 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 10:42:00,997 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:42:00,997 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:42:00,997 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 10:42:00,997 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:42:00,997 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 10:42:00,997 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 10:42:00,998 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 10:42:00,998 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_aff7c6c8-d567-4697-b2d3-bd824832c893/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-12-09 10:42:01,021 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:42:01,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:42:01,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:42:01,033 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:42:01,034 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:42:01,034 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_aff7c6c8-d567-4697-b2d3-bd824832c893/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i [2018-12-09 10:42:01,080 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aff7c6c8-d567-4697-b2d3-bd824832c893/bin-2019/uautomizer/data/ca16fae11/91e2d365855941a894e9f4a3e5ba769b/FLAGbfa538e91 [2018-12-09 10:42:01,539 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:42:01,539 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_aff7c6c8-d567-4697-b2d3-bd824832c893/sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i [2018-12-09 10:42:01,545 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aff7c6c8-d567-4697-b2d3-bd824832c893/bin-2019/uautomizer/data/ca16fae11/91e2d365855941a894e9f4a3e5ba769b/FLAGbfa538e91 [2018-12-09 10:42:01,553 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_aff7c6c8-d567-4697-b2d3-bd824832c893/bin-2019/uautomizer/data/ca16fae11/91e2d365855941a894e9f4a3e5ba769b [2018-12-09 10:42:01,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:42:01,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:42:01,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:42:01,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:42:01,557 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:42:01,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:42:01" (1/1) ... [2018-12-09 10:42:01,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9d864a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:01, skipping insertion in model container [2018-12-09 10:42:01,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:42:01" (1/1) ... [2018-12-09 10:42:01,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:42:01,584 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:42:01,732 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:42:01,739 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:42:01,796 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:42:01,815 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:42:01,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:01 WrapperNode [2018-12-09 10:42:01,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:42:01,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:42:01,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:42:01,816 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:42:01,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:01" (1/1) ... [2018-12-09 10:42:01,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:01" (1/1) ... [2018-12-09 10:42:01,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:42:01,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:42:01,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:42:01,840 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:42:01,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:01" (1/1) ... [2018-12-09 10:42:01,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:01" (1/1) ... [2018-12-09 10:42:01,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:01" (1/1) ... [2018-12-09 10:42:01,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:01" (1/1) ... [2018-12-09 10:42:01,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:01" (1/1) ... [2018-12-09 10:42:01,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:01" (1/1) ... [2018-12-09 10:42:01,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:01" (1/1) ... [2018-12-09 10:42:01,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:42:01,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:42:01,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:42:01,855 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:42:01,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aff7c6c8-d567-4697-b2d3-bd824832c893/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:42:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 10:42:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 10:42:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 10:42:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 10:42:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:42:01,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:42:02,014 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:42:02,015 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-09 10:42:02,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:42:02 BoogieIcfgContainer [2018-12-09 10:42:02,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:42:02,015 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 10:42:02,016 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 10:42:02,018 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 10:42:02,019 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:42:02,019 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 10:42:01" (1/3) ... [2018-12-09 10:42:02,019 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@199e2930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:42:02, skipping insertion in model container [2018-12-09 10:42:02,020 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:42:02,020 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:01" (2/3) ... [2018-12-09 10:42:02,020 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@199e2930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:42:02, skipping insertion in model container [2018-12-09 10:42:02,020 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:42:02,020 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:42:02" (3/3) ... [2018-12-09 10:42:02,021 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.10-alloca_true-termination_true-no-overflow.c.i [2018-12-09 10:42:02,054 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 10:42:02,054 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 10:42:02,054 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 10:42:02,054 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 10:42:02,054 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:42:02,054 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:42:02,055 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 10:42:02,055 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:42:02,055 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 10:42:02,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-12-09 10:42:02,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 10:42:02,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:42:02,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:42:02,080 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 10:42:02,080 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 10:42:02,080 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 10:42:02,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-12-09 10:42:02,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 10:42:02,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:42:02,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:42:02,081 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 10:42:02,081 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 10:42:02,086 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-12-09 10:42:02,086 INFO L796 eck$LassoCheckResult]: Loop: 11#L556-2true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 12#L555-1true assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 7#L556true assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 11#L556-2true [2018-12-09 10:42:02,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:02,090 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-09 10:42:02,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:02,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:02,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:02,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:42:02,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:02,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:02,182 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 1 times [2018-12-09 10:42:02,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:02,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:02,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:02,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:42:02,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:02,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:02,196 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-12-09 10:42:02,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:02,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:02,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:02,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:42:02,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:02,499 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-12-09 10:42:02,587 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:42:02,588 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:42:02,588 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:42:02,588 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:42:02,588 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:42:02,588 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:42:02,589 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:42:02,589 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:42:02,589 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-12-09 10:42:02,589 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:42:02,589 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:42:02,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:02,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:02,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:02,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:02,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:02,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:02,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:02,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:02,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:02,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:02,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:02,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:02,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:02,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:02,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:02,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:02,817 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-12-09 10:42:03,127 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:42:03,130 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:42:03,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:03,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:03,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:42:03,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:03,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:03,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:03,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:42:03,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:42:03,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:03,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:03,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:03,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:42:03,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:03,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:03,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:03,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:42:03,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:42:03,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:03,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:03,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:03,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:42:03,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:03,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:03,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:03,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:42:03,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:42:03,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:03,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:03,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:03,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:03,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:03,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:03,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:42:03,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:03,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:03,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:03,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:03,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:03,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:03,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:03,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:42:03,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:03,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:03,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:03,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:03,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:03,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:03,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:03,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:42:03,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:03,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:03,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:03,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:03,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:42:03,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:03,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:03,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:03,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:42:03,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:42:03,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:03,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:03,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:03,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:42:03,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:03,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:03,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:03,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:42:03,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:42:03,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:03,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:03,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:03,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:42:03,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:03,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:03,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:03,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:42:03,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:42:03,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:03,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:03,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:03,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:03,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:03,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:03,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:42:03,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:03,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:03,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:03,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:03,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:42:03,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:03,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:03,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:03,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:42:03,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:42:03,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:03,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:03,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:03,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:42:03,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:03,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:03,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:03,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:42:03,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:42:03,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:03,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:03,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:03,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:42:03,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:03,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:03,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:03,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:42:03,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:42:03,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:03,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:03,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:03,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:03,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:03,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:03,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:42:03,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:03,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:03,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:03,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:03,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:42:03,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:03,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:03,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:03,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:42:03,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:42:03,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:03,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:03,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:03,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:03,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:03,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:03,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:42:03,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:03,200 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:42:03,214 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:42:03,214 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:42:03,216 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:42:03,217 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:42:03,218 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:42:03,218 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-12-09 10:42:03,264 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-12-09 10:42:03,269 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:42:03,269 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:42:03,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:42:03,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:42:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:42:03,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:42:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:42:03,334 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 10:42:03,335 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2018-12-09 10:42:03,376 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-12-09 10:42:03,377 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-12-09 10:42:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 10:42:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2018-12-09 10:42:03,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 2 letters. Loop has 3 letters. [2018-12-09 10:42:03,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:42:03,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-09 10:42:03,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:42:03,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-09 10:42:03,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:42:03,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2018-12-09 10:42:03,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 10:42:03,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 11 states and 14 transitions. [2018-12-09 10:42:03,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-09 10:42:03,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-09 10:42:03,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-12-09 10:42:03,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:42:03,385 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-09 10:42:03,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-12-09 10:42:03,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-09 10:42:03,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-09 10:42:03,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-12-09 10:42:03,401 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-09 10:42:03,401 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-09 10:42:03,401 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 10:42:03,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-12-09 10:42:03,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 10:42:03,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:42:03,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:42:03,402 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 10:42:03,402 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 10:42:03,402 INFO L794 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 169#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 177#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 171#L556 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9; 172#L556-2 [2018-12-09 10:42:03,402 INFO L796 eck$LassoCheckResult]: Loop: 172#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 175#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 178#L556 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 172#L556-2 [2018-12-09 10:42:03,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:03,402 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2018-12-09 10:42:03,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:03,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:03,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:03,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:42:03,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:03,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:03,425 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 2 times [2018-12-09 10:42:03,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:03,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:03,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:03,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:42:03,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:03,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:03,436 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2018-12-09 10:42:03,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:03,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:03,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:03,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:42:03,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:42:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:42:03,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:42:03,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aff7c6c8-d567-4697-b2d3-bd824832c893/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:42:03,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:42:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:42:03,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:42:03,644 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-12-09 10:42:03,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 10:42:03,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:42:03,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-12-09 10:42:03,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:42:03,691 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-12-09 10:42:03,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:42:03,694 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-12-09 10:42:03,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:42:03,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:42:03,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:42:03,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:16 [2018-12-09 10:42:03,722 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-12-09 10:42:03,724 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-12-09 10:42:03,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:42:03,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 10:42:03,730 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 10:42:03,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:42:03,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:42:03,734 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:42, output treesize:5 [2018-12-09 10:42:03,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:42:03,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:42:03,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-12-09 10:42:03,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 10:42:03,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-09 10:42:03,794 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-12-09 10:42:03,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:42:03,847 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-09 10:42:03,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:42:03,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2018-12-09 10:42:03,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 10:42:03,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2018-12-09 10:42:03,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-09 10:42:03,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-09 10:42:03,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-12-09 10:42:03,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:42:03,849 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-09 10:42:03,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-12-09 10:42:03,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-12-09 10:42:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 10:42:03,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-12-09 10:42:03,850 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-09 10:42:03,850 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-09 10:42:03,851 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 10:42:03,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2018-12-09 10:42:03,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 10:42:03,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:42:03,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:42:03,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 10:42:03,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 10:42:03,851 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-12-09 10:42:03,852 INFO L796 eck$LassoCheckResult]: Loop: 236#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 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-12-09 10:42:03,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:03,852 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-09 10:42:03,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:03,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:03,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:03,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:42:03,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:03,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:03,866 INFO L82 PathProgramCache]: Analyzing trace with hash 41795, now seen corresponding path program 1 times [2018-12-09 10:42:03,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:03,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:03,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:03,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:42:03,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:03,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:03,874 INFO L82 PathProgramCache]: Analyzing trace with hash 889571264, now seen corresponding path program 2 times [2018-12-09 10:42:03,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:03,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:03,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:03,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:42:03,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:04,090 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 89 [2018-12-09 10:42:04,151 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:42:04,151 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:42:04,151 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:42:04,151 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:42:04,151 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:42:04,151 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:42:04,152 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:42:04,152 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:42:04,152 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-12-09 10:42:04,152 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:42:04,152 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:42:04,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:04,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:04,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:04,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:04,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:04,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:04,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:04,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:04,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:04,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:04,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:04,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:04,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:04,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:04,624 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:42:04,624 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:42:04,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:42:04,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:04,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:04,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:42:04,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:42:04,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:04,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:42:04,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:04,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:04,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:42:04,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:42:04,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:04,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:42:04,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:04,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:04,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:42:04,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:42:04,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:04,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:04,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:04,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:42:04,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:04,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:04,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:04,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:04,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:42:04,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:04,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:04,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:42:04,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:04,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:04,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:42:04,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:42:04,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:04,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:04,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:04,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:42:04,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:04,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:04,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:42:04,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:04,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:04,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:42:04,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:42:04,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:04,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:04,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:04,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:42:04,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:04,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:04,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:04,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:04,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:42:04,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:04,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:04,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:04,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:04,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:42:04,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:04,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:04,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:04,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:04,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:42:04,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:04,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:04,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:04,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:04,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:42:04,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:04,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:04,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,657 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:42:04,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:04,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,658 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:42:04,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:04,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:04,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:04,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:04,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:42:04,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:04,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:04,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:04,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:04,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:42:04,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:04,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:04,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,668 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:42:04,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:04,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,669 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:42:04,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:04,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:04,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,671 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:42:04,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:04,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,672 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:42:04,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:04,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:04,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:04,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:04,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:04,675 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 10:42:04,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:04,678 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-09 10:42:04,678 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-09 10:42:04,720 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:42:04,739 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 10:42:04,739 INFO L444 ModelExtractionUtils]: 52 out of 56 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:42:04,740 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:42:04,741 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-09 10:42:04,741 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:42:04,741 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-12-09 10:42:04,792 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-12-09 10:42:04,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:42:04,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:42:04,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:42:04,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:42:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:42:04,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:42:04,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:42:04,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-12-09 10:42:04,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:42:04,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-12-09 10:42:04,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:42:04,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:42:04,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:42:04,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:42:04,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-12-09 10:42:04,876 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 10:42:04,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:42:04,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:42:04,899 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-12-09 10:42:04,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:42:04,918 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 10:42:04,918 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-12-09 10:42:04,929 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-12-09 10:42:04,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 10:42:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 10:42:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2018-12-09 10:42:04,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 3 letters. [2018-12-09 10:42:04,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:42:04,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-09 10:42:04,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:42:04,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 6 letters. [2018-12-09 10:42:04,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:42:04,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2018-12-09 10:42:04,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 10:42:04,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 12 transitions. [2018-12-09 10:42:04,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-09 10:42:04,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-12-09 10:42:04,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2018-12-09 10:42:04,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:42:04,932 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-09 10:42:04,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2018-12-09 10:42:04,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-12-09 10:42:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 10:42:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-09 10:42:04,933 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-09 10:42:04,933 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-09 10:42:04,933 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 10:42:04,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-12-09 10:42:04,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 10:42:04,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:42:04,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:42:04,933 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2018-12-09 10:42:04,933 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 10:42:04,933 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~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 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-12-09 10:42:04,934 INFO L796 eck$LassoCheckResult]: Loop: 399#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 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-12-09 10:42:04,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:04,934 INFO L82 PathProgramCache]: Analyzing trace with hash 889571326, now seen corresponding path program 2 times [2018-12-09 10:42:04,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:04,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:04,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:04,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:42:04,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:04,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:04,946 INFO L82 PathProgramCache]: Analyzing trace with hash 41795, now seen corresponding path program 2 times [2018-12-09 10:42:04,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:04,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:04,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:04,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:42:04,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:04,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:04,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1271168550, now seen corresponding path program 2 times [2018-12-09 10:42:04,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:04,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:04,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:04,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:42:04,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:42:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:42:04,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:42:04,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aff7c6c8-d567-4697-b2d3-bd824832c893/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 10:42:05,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 10:42:05,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 10:42:05,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:42:05,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:42:05,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:42:05,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:42:05,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:42:05,063 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-12-09 10:42:05,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:42:05,083 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-12-09 10:42:05,085 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 10:42:05,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:42:05,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:42:05,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:38 [2018-12-09 10:42:05,150 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-12-09 10:42:05,152 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-12-09 10:42:05,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:42:05,158 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-12-09 10:42:05,159 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 10:42:05,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:42:05,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:42:05,162 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:3 [2018-12-09 10:42:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:42:05,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:42:05,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-09 10:42:05,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 10:42:05,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:42:05,224 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-12-09 10:42:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:42:05,354 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-09 10:42:05,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:42:05,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 10 transitions. [2018-12-09 10:42:05,355 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 10:42:05,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2018-12-09 10:42:05,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 10:42:05,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 10:42:05,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 10:42:05,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:42:05,356 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:42:05,356 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:42:05,356 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:42:05,356 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 10:42:05,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 10:42:05,356 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 10:42:05,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 10:42:05,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 10:42:05 BoogieIcfgContainer [2018-12-09 10:42:05,360 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 10:42:05,361 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:42:05,361 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:42:05,361 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:42:05,361 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:42:02" (3/4) ... [2018-12-09 10:42:05,363 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 10:42:05,363 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:42:05,364 INFO L168 Benchmark]: Toolchain (without parser) took 3809.22 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 269.5 MB). Free memory was 951.7 MB in the beginning and 1.2 GB in the end (delta: -291.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:42:05,364 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:42:05,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -135.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-09 10:42:05,365 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-12-09 10:42:05,366 INFO L168 Benchmark]: Boogie Preprocessor took 14.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:42:05,366 INFO L168 Benchmark]: RCFGBuilder took 160.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-12-09 10:42:05,366 INFO L168 Benchmark]: BuchiAutomizer took 3344.85 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 168.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -177.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:42:05,367 INFO L168 Benchmark]: Witness Printer took 2.75 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:42:05,369 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 259.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -135.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 160.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3344.85 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 168.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -177.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.75 ms. Allocated memory is still 1.3 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.3s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.8s. 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: 66ms 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...