./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.03_assume-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_ac184f47-4f5e-4abb-a058-93d28ea5dea5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ac184f47-4f5e-4abb-a058-93d28ea5dea5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ac184f47-4f5e-4abb-a058-93d28ea5dea5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ac184f47-4f5e-4abb-a058-93d28ea5dea5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.03_assume-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ac184f47-4f5e-4abb-a058-93d28ea5dea5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ac184f47-4f5e-4abb-a058-93d28ea5dea5/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 b76149a90863628db6af524c153a3f434b0c2e82 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 09:05:05,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 09:05:05,143 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 09:05:05,149 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 09:05:05,149 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 09:05:05,150 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 09:05:05,151 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 09:05:05,151 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 09:05:05,152 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 09:05:05,153 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 09:05:05,153 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 09:05:05,153 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 09:05:05,154 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 09:05:05,154 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 09:05:05,155 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 09:05:05,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 09:05:05,156 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 09:05:05,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 09:05:05,158 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 09:05:05,158 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 09:05:05,159 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 09:05:05,160 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 09:05:05,161 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 09:05:05,161 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 09:05:05,161 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 09:05:05,161 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 09:05:05,162 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 09:05:05,162 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 09:05:05,163 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 09:05:05,163 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 09:05:05,163 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 09:05:05,164 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 09:05:05,164 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 09:05:05,164 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 09:05:05,165 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 09:05:05,165 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 09:05:05,165 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ac184f47-4f5e-4abb-a058-93d28ea5dea5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 09:05:05,173 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 09:05:05,173 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 09:05:05,174 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 09:05:05,174 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 09:05:05,174 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 09:05:05,174 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 09:05:05,174 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 09:05:05,174 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 09:05:05,174 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 09:05:05,175 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 09:05:05,175 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 09:05:05,175 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 09:05:05,175 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 09:05:05,175 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 09:05:05,175 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 09:05:05,175 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 09:05:05,175 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 09:05:05,175 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 09:05:05,176 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 09:05:05,176 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 09:05:05,176 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 09:05:05,176 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 09:05:05,176 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 09:05:05,176 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 09:05:05,176 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 09:05:05,176 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 09:05:05,177 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 09:05:05,177 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 09:05:05,177 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 09:05:05,177 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_ac184f47-4f5e-4abb-a058-93d28ea5dea5/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 -> b76149a90863628db6af524c153a3f434b0c2e82 [2018-12-08 09:05:05,196 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 09:05:05,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 09:05:05,206 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 09:05:05,207 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 09:05:05,208 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 09:05:05,208 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ac184f47-4f5e-4abb-a058-93d28ea5dea5/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.03_assume-alloca_true-termination_true-no-overflow.c.i [2018-12-08 09:05:05,242 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ac184f47-4f5e-4abb-a058-93d28ea5dea5/bin-2019/uautomizer/data/9aebd7f21/d3ad089c9b734cdf96fcb415864f4163/FLAG97492f937 [2018-12-08 09:05:05,686 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 09:05:05,687 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ac184f47-4f5e-4abb-a058-93d28ea5dea5/sv-benchmarks/c/termination-memory-alloca/b.03_assume-alloca_true-termination_true-no-overflow.c.i [2018-12-08 09:05:05,693 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ac184f47-4f5e-4abb-a058-93d28ea5dea5/bin-2019/uautomizer/data/9aebd7f21/d3ad089c9b734cdf96fcb415864f4163/FLAG97492f937 [2018-12-08 09:05:05,701 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ac184f47-4f5e-4abb-a058-93d28ea5dea5/bin-2019/uautomizer/data/9aebd7f21/d3ad089c9b734cdf96fcb415864f4163 [2018-12-08 09:05:05,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 09:05:05,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 09:05:05,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 09:05:05,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 09:05:05,706 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 09:05:05,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:05:05" (1/1) ... [2018-12-08 09:05:05,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5b6929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:05:05, skipping insertion in model container [2018-12-08 09:05:05,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:05:05" (1/1) ... [2018-12-08 09:05:05,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 09:05:05,729 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 09:05:05,867 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:05:05,874 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 09:05:05,929 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:05:05,949 INFO L195 MainTranslator]: Completed translation [2018-12-08 09:05:05,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:05:05 WrapperNode [2018-12-08 09:05:05,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 09:05:05,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 09:05:05,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 09:05:05,950 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 09:05:05,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:05:05" (1/1) ... [2018-12-08 09:05:05,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:05:05" (1/1) ... [2018-12-08 09:05:05,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 09:05:05,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 09:05:05,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 09:05:05,976 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 09:05:05,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:05:05" (1/1) ... [2018-12-08 09:05:05,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:05:05" (1/1) ... [2018-12-08 09:05:05,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:05:05" (1/1) ... [2018-12-08 09:05:05,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:05:05" (1/1) ... [2018-12-08 09:05:05,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:05:05" (1/1) ... [2018-12-08 09:05:05,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:05:05" (1/1) ... [2018-12-08 09:05:05,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:05:05" (1/1) ... [2018-12-08 09:05:05,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 09:05:05,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 09:05:05,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 09:05:05,990 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 09:05:05,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:05:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac184f47-4f5e-4abb-a058-93d28ea5dea5/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-08 09:05:06,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 09:05:06,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 09:05:06,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 09:05:06,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 09:05:06,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 09:05:06,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 09:05:06,171 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 09:05:06,171 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-08 09:05:06,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:05:06 BoogieIcfgContainer [2018-12-08 09:05:06,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 09:05:06,172 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 09:05:06,172 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 09:05:06,174 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 09:05:06,175 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:05:06,175 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 09:05:05" (1/3) ... [2018-12-08 09:05:06,176 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7137c534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 09:05:06, skipping insertion in model container [2018-12-08 09:05:06,176 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:05:06,176 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:05:05" (2/3) ... [2018-12-08 09:05:06,176 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7137c534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 09:05:06, skipping insertion in model container [2018-12-08 09:05:06,176 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:05:06,176 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:05:06" (3/3) ... [2018-12-08 09:05:06,177 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.03_assume-alloca_true-termination_true-no-overflow.c.i [2018-12-08 09:05:06,210 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 09:05:06,211 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 09:05:06,211 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 09:05:06,211 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 09:05:06,211 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 09:05:06,211 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 09:05:06,211 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 09:05:06,211 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 09:05:06,211 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 09:05:06,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-08 09:05:06,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 09:05:06,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:05:06,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:05:06,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 09:05:06,240 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 09:05:06,240 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 09:05:06,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-08 09:05:06,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 09:05:06,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:05:06,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:05:06,242 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 09:05:06,242 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 09:05:06,248 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~ret18;test_fun_#in~x, test_fun_#in~y := main_#t~nondet16, main_#t~nondet17;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~mem4, test_fun_#t~mem5, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem8, test_fun_#t~short10, test_fun_#t~mem15, 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_~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 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 test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 4#L553true assume !(test_fun_#t~mem4 <= 0);havoc test_fun_#t~mem4; 9#L556-5true [2018-12-08 09:05:06,248 INFO L796 eck$LassoCheckResult]: Loop: 9#L556-5true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 12#L556-1true assume !test_fun_#t~short10; 5#L556-3true assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 7#L557true assume !(test_fun_#t~mem11 <= 0);havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 + test_fun_#t~mem14, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14;havoc test_fun_#t~mem13; 9#L556-5true [2018-12-08 09:05:06,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:05:06,253 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-08 09:05:06,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:05:06,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:05:06,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:05:06,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:05:06,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:05:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:05:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:05:06,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:05:06,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1298091, now seen corresponding path program 1 times [2018-12-08 09:05:06,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:05:06,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:05:06,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:05:06,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:05:06,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:05:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:05:06,367 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-08 09:05:06,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:05:06,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:05:06,371 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 09:05:06,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:05:06,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:05:06,380 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2018-12-08 09:05:06,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:05:06,402 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-08 09:05:06,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:05:06,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2018-12-08 09:05:06,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 09:05:06,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 7 states and 7 transitions. [2018-12-08 09:05:06,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-08 09:05:06,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-08 09:05:06,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 7 transitions. [2018-12-08 09:05:06,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:05:06,408 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-08 09:05:06,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 7 transitions. [2018-12-08 09:05:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-08 09:05:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 09:05:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-08 09:05:06,424 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-08 09:05:06,424 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-08 09:05:06,425 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 09:05:06,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 7 transitions. [2018-12-08 09:05:06,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 09:05:06,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:05:06,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:05:06,425 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 09:05:06,425 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 09:05:06,425 INFO L794 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~ret18;test_fun_#in~x, test_fun_#in~y := main_#t~nondet16, main_#t~nondet17;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~mem4, test_fun_#t~mem5, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem8, test_fun_#t~short10, test_fun_#t~mem15, 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_~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 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 test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 35#L553 assume !(test_fun_#t~mem4 <= 0);havoc test_fun_#t~mem4; 36#L556-5 [2018-12-08 09:05:06,426 INFO L796 eck$LassoCheckResult]: Loop: 36#L556-5 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 40#L556-1 assume test_fun_#t~short10;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem9 <= 2147483647 - test_fun_#t~mem8; 37#L556-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 38#L557 assume !(test_fun_#t~mem11 <= 0);havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 + test_fun_#t~mem14, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14;havoc test_fun_#t~mem13; 36#L556-5 [2018-12-08 09:05:06,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:05:06,426 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-12-08 09:05:06,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:05:06,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:05:06,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:05:06,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:05:06,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:05:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:05:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:05:06,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:05:06,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1296169, now seen corresponding path program 1 times [2018-12-08 09:05:06,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:05:06,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:05:06,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:05:06,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:05:06,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:05:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:05:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:05:06,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:05:06,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905932, now seen corresponding path program 1 times [2018-12-08 09:05:06,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:05:06,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:05:06,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:05:06,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:05:06,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:05:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:05:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:05:06,734 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:05:06,735 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:05:06,735 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:05:06,735 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:05:06,735 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:05:06,735 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:05:06,735 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:05:06,735 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:05:06,735 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.03_assume-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-12-08 09:05:06,735 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:05:06,736 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:05:06,748 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-08 09:05:06,752 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-08 09:05:06,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:05:06,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:05:06,756 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-08 09:05:06,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:05:06,759 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-08 09:05:06,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:05:06,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:05:06,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:05:06,765 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-08 09:05:06,767 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-08 09:05:06,770 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-08 09:05:06,771 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-08 09:05:06,772 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-08 09:05:06,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:05:06,774 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-08 09:05:06,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:05:06,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:05:06,925 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-08 09:05:06,927 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-08 09:05:07,146 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:05:07,149 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:05:07,150 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-08 09:05:07,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:05:07,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:05:07,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:05:07,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,155 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-08 09:05:07,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:05:07,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:05:07,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:05:07,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,157 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-08 09:05:07,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:05:07,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:05:07,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:05:07,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,158 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-08 09:05:07,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:05:07,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:05:07,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:05:07,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,160 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-08 09:05:07,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:05:07,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:05:07,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:05:07,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:05:07,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:05:07,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:05:07,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:05:07,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,165 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-08 09:05:07,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:05:07,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:05:07,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:05:07,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,167 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-08 09:05:07,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:05:07,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:05:07,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,172 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-08 09:05:07,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:05:07,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:05:07,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:05:07,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,175 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-08 09:05:07,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:05:07,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:05:07,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:05:07,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,177 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-08 09:05:07,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:05:07,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:05:07,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,183 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-08 09:05:07,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:05:07,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:05:07,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,188 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-08 09:05:07,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:05:07,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:05:07,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:05:07,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,190 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-08 09:05:07,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:05:07,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:05:07,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:05:07,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,192 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-08 09:05:07,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:05:07,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:05:07,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:05:07,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,194 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-08 09:05:07,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:05:07,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:05:07,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:05:07,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,197 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-08 09:05:07,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:05:07,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:05:07,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:05:07,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:05:07,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:05:07,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:05:07,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,203 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-08 09:05:07,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,204 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:05:07,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,205 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:05:07,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:05:07,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,210 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-08 09:05:07,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:05:07,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:05:07,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:05:07,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:05:07,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:05:07,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,228 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-08 09:05:07,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:05:07,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:05:07,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:05:07,232 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-08 09:05:07,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:05:07,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:05:07,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:05:07,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:05:07,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:05:07,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:05:07,255 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:05:07,274 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-08 09:05:07,275 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 09:05:07,277 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:05:07,278 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:05:07,279 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:05:07,279 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) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 4294967293 Supporting invariants [] [2018-12-08 09:05:07,313 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-08 09:05:07,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:05:07,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:05:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:05:07,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:05:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:05:07,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:05:07,430 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-08 09:05:07,432 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-08 09:05:07,432 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 7 transitions. cyclomatic complexity: 1 Second operand 5 states. [2018-12-08 09:05:07,483 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 7 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 11 states and 12 transitions. Complement of second has 8 states. [2018-12-08 09:05:07,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 09:05:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 09:05:07,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2018-12-08 09:05:07,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-08 09:05:07,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:05:07,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-08 09:05:07,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:05:07,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 3 letters. Loop has 8 letters. [2018-12-08 09:05:07,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:05:07,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2018-12-08 09:05:07,486 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 09:05:07,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2018-12-08 09:05:07,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 09:05:07,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 09:05:07,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 09:05:07,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:05:07,487 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:05:07,487 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:05:07,487 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:05:07,487 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 09:05:07,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 09:05:07,487 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 09:05:07,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 09:05:07,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 09:05:07 BoogieIcfgContainer [2018-12-08 09:05:07,491 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 09:05:07,491 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 09:05:07,492 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 09:05:07,492 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 09:05:07,492 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:05:06" (3/4) ... [2018-12-08 09:05:07,494 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 09:05:07,494 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 09:05:07,495 INFO L168 Benchmark]: Toolchain (without parser) took 1791.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 74.4 MB). Free memory was 957.1 MB in the beginning and 754.8 MB in the end (delta: 202.3 MB). Peak memory consumption was 276.7 MB. Max. memory is 11.5 GB. [2018-12-08 09:05:07,496 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:05:07,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 74.4 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -100.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-08 09:05:07,496 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.06 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-08 09:05:07,496 INFO L168 Benchmark]: Boogie Preprocessor took 13.95 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-08 09:05:07,497 INFO L168 Benchmark]: RCFGBuilder took 181.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-12-08 09:05:07,497 INFO L168 Benchmark]: BuchiAutomizer took 1319.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 754.8 MB in the end (delta: 283.0 MB). Peak memory consumption was 283.0 MB. Max. memory is 11.5 GB. [2018-12-08 09:05:07,497 INFO L168 Benchmark]: Witness Printer took 2.89 ms. Allocated memory is still 1.1 GB. Free memory is still 754.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:05:07,499 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 74.4 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -100.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.06 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. * Boogie Preprocessor took 13.95 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 181.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1319.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 754.8 MB in the end (delta: 283.0 MB). Peak memory consumption was 283.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.89 ms. Allocated memory is still 1.1 GB. Free memory is still 754.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 4294967293 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 17 SDtfs, 3 SDslu, 9 SDs, 0 SdLazy, 15 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital202 mio100 ax108 hnf100 lsp89 ukn68 mio100 lsp33 div100 bol100 ite100 ukn100 eq188 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...