./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/java_AG313-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/java_AG313-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 b64613d278f1b2a5aec6d84cb3470147257700f5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:33:16,309 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:33:16,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:33:16,328 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:33:16,330 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:33:16,331 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:33:16,333 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:33:16,344 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:33:16,346 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:33:16,349 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:33:16,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:33:16,351 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:33:16,353 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:33:16,355 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:33:16,362 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:33:16,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:33:16,366 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:33:16,370 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:33:16,374 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:33:16,377 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:33:16,379 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:33:16,381 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:33:16,385 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:33:16,386 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:33:16,387 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:33:16,388 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:33:16,388 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:33:16,391 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:33:16,392 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:33:16,394 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:33:16,394 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:33:16,395 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:33:16,395 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:33:16,395 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:33:16,396 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:33:16,397 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:33:16,397 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:33:16,416 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:33:16,416 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:33:16,417 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:33:16,417 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:33:16,417 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:33:16,417 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:33:16,418 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:33:16,418 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:33:16,418 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:33:16,418 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:33:16,418 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:33:16,418 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:33:16,419 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:33:16,420 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:33:16,420 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:33:16,420 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:33:16,420 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:33:16,421 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:33:16,421 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:33:16,421 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:33:16,422 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:33:16,422 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:33:16,422 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:33:16,422 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:33:16,422 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:33:16,422 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:33:16,423 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:33:16,424 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:33:16,424 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:33:16,425 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> b64613d278f1b2a5aec6d84cb3470147257700f5 [2019-01-14 02:33:16,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:33:16,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:33:16,480 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:33:16,481 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:33:16,482 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:33:16,482 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/java_AG313-alloca_true-termination.c.i [2019-01-14 02:33:16,535 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4efea3d72/a94791b27972410480f5fbf35a543790/FLAGfa9f65c10 [2019-01-14 02:33:17,023 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:33:17,024 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/java_AG313-alloca_true-termination.c.i [2019-01-14 02:33:17,042 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4efea3d72/a94791b27972410480f5fbf35a543790/FLAGfa9f65c10 [2019-01-14 02:33:17,335 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4efea3d72/a94791b27972410480f5fbf35a543790 [2019-01-14 02:33:17,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:33:17,339 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:33:17,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:33:17,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:33:17,342 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:33:17,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:17,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1098f260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17, skipping insertion in model container [2019-01-14 02:33:17,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:17,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:33:17,398 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:33:17,735 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:33:17,751 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:33:17,872 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:33:17,920 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:33:17,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17 WrapperNode [2019-01-14 02:33:17,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:33:17,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:33:17,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:33:17,921 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:33:17,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:17,946 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:17,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:33:17,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:33:17,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:33:17,968 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:33:17,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:17,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:17,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:17,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:17,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:17,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:18,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... [2019-01-14 02:33:18,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:33:18,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:33:18,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:33:18,009 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:33:18,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:33:18,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:33:18,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:33:18,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:33:18,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:33:18,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:33:18,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:33:18,435 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:33:18,435 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 02:33:18,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:33:18 BoogieIcfgContainer [2019-01-14 02:33:18,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:33:18,437 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:33:18,438 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:33:18,443 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:33:18,444 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:33:18,445 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:33:17" (1/3) ... [2019-01-14 02:33:18,449 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c3aeb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:33:18, skipping insertion in model container [2019-01-14 02:33:18,449 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:33:18,450 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:33:17" (2/3) ... [2019-01-14 02:33:18,450 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c3aeb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:33:18, skipping insertion in model container [2019-01-14 02:33:18,450 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:33:18,450 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:33:18" (3/3) ... [2019-01-14 02:33:18,453 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_AG313-alloca_true-termination.c.i [2019-01-14 02:33:18,507 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:33:18,508 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:33:18,508 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:33:18,508 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:33:18,508 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:33:18,509 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:33:18,509 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:33:18,509 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:33:18,509 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:33:18,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-14 02:33:18,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:33:18,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:18,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:18,544 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:33:18,544 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:33:18,544 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:33:18,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-14 02:33:18,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:33:18,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:18,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:18,547 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:33:18,547 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:33:18,554 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;quot_#in~x, quot_#in~y := main_#t~nondet13, main_#t~nondet14;havoc quot_#res;havoc quot_#t~malloc2.base, quot_#t~malloc2.offset, quot_#t~malloc3.base, quot_#t~malloc3.offset, quot_#t~malloc4.base, quot_#t~malloc4.offset, quot_#t~mem5, quot_#t~mem9, quot_#t~mem10, quot_#t~mem11, quot_#t~mem6, quot_#t~mem7, quot_#t~short8, quot_#t~mem12, quot_~x, quot_~y, quot_~x_ref~0.base, quot_~x_ref~0.offset, quot_~y_ref~0.base, quot_~y_ref~0.offset, quot_~i~0.base, quot_~i~0.offset;quot_~x := quot_#in~x;quot_~y := quot_#in~y;call quot_#t~malloc2.base, quot_#t~malloc2.offset := #Ultimate.allocOnStack(4);quot_~x_ref~0.base, quot_~x_ref~0.offset := quot_#t~malloc2.base, quot_#t~malloc2.offset;call quot_#t~malloc3.base, quot_#t~malloc3.offset := #Ultimate.allocOnStack(4);quot_~y_ref~0.base, quot_~y_ref~0.offset := quot_#t~malloc3.base, quot_#t~malloc3.offset;call quot_#t~malloc4.base, quot_#t~malloc4.offset := #Ultimate.allocOnStack(4);quot_~i~0.base, quot_~i~0.offset := quot_#t~malloc4.base, quot_#t~malloc4.offset;call write~int(quot_~x, quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call write~int(quot_~y, quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(0, quot_~i~0.base, quot_~i~0.offset, 4);call quot_#t~mem5 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4); 10#L555true assume !(0 == quot_#t~mem5);havoc quot_#t~mem5; 7#L556-5true [2019-01-14 02:33:18,554 INFO L796 eck$LassoCheckResult]: Loop: 7#L556-5true call quot_#t~mem6 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem6 > 0; 11#L556-1true assume !quot_#t~short8; 4#L556-3true assume !!quot_#t~short8;havoc quot_#t~mem6;havoc quot_#t~mem7;havoc quot_#t~short8;call quot_#t~mem9 := read~int(quot_~i~0.base, quot_~i~0.offset, 4);call write~int(1 + quot_#t~mem9, quot_~i~0.base, quot_~i~0.offset, 4);havoc quot_#t~mem9;call quot_#t~mem10 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call quot_#t~mem11 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(quot_#t~mem10 - 1 - (quot_#t~mem11 - 1), quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);havoc quot_#t~mem10;havoc quot_#t~mem11; 7#L556-5true [2019-01-14 02:33:18,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:18,565 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-14 02:33:18,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:18,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:18,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:18,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:18,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:18,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:18,750 INFO L82 PathProgramCache]: Analyzing trace with hash 41873, now seen corresponding path program 1 times [2019-01-14 02:33:18,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:18,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:18,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:18,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:18,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:18,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:33:18,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:33:18,825 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:33:18,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:33:18,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:33:18,839 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-14 02:33:18,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:33:18,928 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-14 02:33:18,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:33:18,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-01-14 02:33:18,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:33:18,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 6 states and 6 transitions. [2019-01-14 02:33:18,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:33:18,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:33:18,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2019-01-14 02:33:18,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:33:18,942 INFO L706 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-14 02:33:18,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2019-01-14 02:33:18,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-14 02:33:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:33:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-14 02:33:18,972 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-14 02:33:18,973 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-14 02:33:18,973 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:33:18,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2019-01-14 02:33:18,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:33:18,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:33:18,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:33:18,975 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:33:18,975 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:33:18,976 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;quot_#in~x, quot_#in~y := main_#t~nondet13, main_#t~nondet14;havoc quot_#res;havoc quot_#t~malloc2.base, quot_#t~malloc2.offset, quot_#t~malloc3.base, quot_#t~malloc3.offset, quot_#t~malloc4.base, quot_#t~malloc4.offset, quot_#t~mem5, quot_#t~mem9, quot_#t~mem10, quot_#t~mem11, quot_#t~mem6, quot_#t~mem7, quot_#t~short8, quot_#t~mem12, quot_~x, quot_~y, quot_~x_ref~0.base, quot_~x_ref~0.offset, quot_~y_ref~0.base, quot_~y_ref~0.offset, quot_~i~0.base, quot_~i~0.offset;quot_~x := quot_#in~x;quot_~y := quot_#in~y;call quot_#t~malloc2.base, quot_#t~malloc2.offset := #Ultimate.allocOnStack(4);quot_~x_ref~0.base, quot_~x_ref~0.offset := quot_#t~malloc2.base, quot_#t~malloc2.offset;call quot_#t~malloc3.base, quot_#t~malloc3.offset := #Ultimate.allocOnStack(4);quot_~y_ref~0.base, quot_~y_ref~0.offset := quot_#t~malloc3.base, quot_#t~malloc3.offset;call quot_#t~malloc4.base, quot_#t~malloc4.offset := #Ultimate.allocOnStack(4);quot_~i~0.base, quot_~i~0.offset := quot_#t~malloc4.base, quot_#t~malloc4.offset;call write~int(quot_~x, quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call write~int(quot_~y, quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(0, quot_~i~0.base, quot_~i~0.offset, 4);call quot_#t~mem5 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4); 33#L555 assume !(0 == quot_#t~mem5);havoc quot_#t~mem5; 35#L556-5 [2019-01-14 02:33:18,976 INFO L796 eck$LassoCheckResult]: Loop: 35#L556-5 call quot_#t~mem6 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem6 > 0; 37#L556-1 assume quot_#t~short8;call quot_#t~mem7 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem7 > 0; 34#L556-3 assume !!quot_#t~short8;havoc quot_#t~mem6;havoc quot_#t~mem7;havoc quot_#t~short8;call quot_#t~mem9 := read~int(quot_~i~0.base, quot_~i~0.offset, 4);call write~int(1 + quot_#t~mem9, quot_~i~0.base, quot_~i~0.offset, 4);havoc quot_#t~mem9;call quot_#t~mem10 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call quot_#t~mem11 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(quot_#t~mem10 - 1 - (quot_#t~mem11 - 1), quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);havoc quot_#t~mem10;havoc quot_#t~mem11; 35#L556-5 [2019-01-14 02:33:18,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:18,977 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-01-14 02:33:18,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:18,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:18,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:18,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:18,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:19,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:19,061 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 1 times [2019-01-14 02:33:19,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:19,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:19,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:19,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:33:19,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:19,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:19,130 INFO L82 PathProgramCache]: Analyzing trace with hash 889571280, now seen corresponding path program 1 times [2019-01-14 02:33:19,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:33:19,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:33:19,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:19,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:33:19,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:33:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:33:19,895 WARN L181 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-01-14 02:33:20,886 WARN L181 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2019-01-14 02:33:21,074 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-01-14 02:33:21,087 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:33:21,088 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:33:21,088 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:33:21,088 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:33:21,089 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:33:21,089 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:33:21,089 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:33:21,089 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:33:21,089 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_AG313-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:33:21,090 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:33:21,090 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:33:21,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,758 WARN L181 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-01-14 02:33:21,953 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-01-14 02:33:21,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:21,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:33:22,362 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-01-14 02:33:23,257 WARN L181 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:33:23,466 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:33:23,471 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:33:23,473 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 [2019-01-14 02:33:23,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:23,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:23,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:23,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,481 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 [2019-01-14 02:33:23,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:23,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:23,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:23,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,484 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 [2019-01-14 02:33:23,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:23,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:23,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,492 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 [2019-01-14 02:33:23,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:23,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:23,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:23,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,495 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 [2019-01-14 02:33:23,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:23,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:23,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:23,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,498 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 [2019-01-14 02:33:23,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:23,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:23,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,505 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 [2019-01-14 02:33:23,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:23,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:23,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:23,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,511 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 [2019-01-14 02:33:23,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:23,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:23,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:23,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,514 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 [2019-01-14 02:33:23,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:23,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:23,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,528 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 [2019-01-14 02:33:23,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:23,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:23,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,550 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 [2019-01-14 02:33:23,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,555 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:23,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:23,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,562 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 [2019-01-14 02:33:23,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:23,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:23,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:23,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,571 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 [2019-01-14 02:33:23,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:23,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:23,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:23,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,577 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 [2019-01-14 02:33:23,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:33:23,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:33:23,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:33:23,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,583 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 [2019-01-14 02:33:23,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:23,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:23,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,608 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 [2019-01-14 02:33:23,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:23,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:23,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,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 [2019-01-14 02:33:23,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,638 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:33:23,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,648 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:33:23,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:23,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:23,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:23,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:23,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:23,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:23,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:23,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,765 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 [2019-01-14 02:33:23,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:23,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:23,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:33:23,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:33:23,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:33:23,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:23,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:33:23,790 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 [2019-01-14 02:33:23,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:33:23,793 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:33:23,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:33:23,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:33:23,798 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:33:23,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:33:23,828 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:33:23,839 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:33:23,840 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:33:23,842 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:33:23,844 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:33:23,844 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:33:23,845 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_1 Supporting invariants [] [2019-01-14 02:33:24,198 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:33:24,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:33:24,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:33:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:24,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:24,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 40 [2019-01-14 02:33:24,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:33:24,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:24,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2019-01-14 02:33:24,516 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 02:33:24,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-01-14 02:33:24,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:24,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-14 02:33:24,527 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:24,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2019-01-14 02:33:24,616 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:24,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2019-01-14 02:33:24,629 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:24,739 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-01-14 02:33:24,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-14 02:33:24,743 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:24,749 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:24,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 18 [2019-01-14 02:33:24,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 02:33:24,769 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:24,794 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:33:24,798 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2019-01-14 02:33:24,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2019-01-14 02:33:24,811 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:24,825 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:24,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 20 [2019-01-14 02:33:24,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 02:33:24,843 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:24,856 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:24,954 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 1 case distinctions, treesize of input 26 treesize of output 28 [2019-01-14 02:33:24,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2019-01-14 02:33:24,976 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:25,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2019-01-14 02:33:25,003 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:25,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2019-01-14 02:33:25,027 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:25,047 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:25,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2019-01-14 02:33:25,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2019-01-14 02:33:25,140 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2019-01-14 02:33:25,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-01-14 02:33:25,254 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:25,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-01-14 02:33:25,287 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 02:33:25,310 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:33:25,410 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-14 02:33:25,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-14 02:33:25,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:33:25,474 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 5 variables, input treesize:68, output treesize:21 [2019-01-14 02:33:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:33:25,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:33:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:25,605 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:33:25,606 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1 Second operand 5 states. [2019-01-14 02:33:25,708 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 9 states and 10 transitions. Complement of second has 7 states. [2019-01-14 02:33:25,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:33:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:33:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2019-01-14 02:33:25,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-14 02:33:25,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:25,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:33:25,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:25,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-14 02:33:25,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:33:25,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-01-14 02:33:25,714 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:33:25,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-14 02:33:25,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:33:25,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:33:25,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:33:25,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:33:25,715 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:33:25,715 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:33:25,715 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:33:25,715 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:33:25,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:33:25,716 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:33:25,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:33:25,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:33:25 BoogieIcfgContainer [2019-01-14 02:33:25,723 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:33:25,723 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:33:25,723 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:33:25,723 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:33:25,724 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:33:18" (3/4) ... [2019-01-14 02:33:25,729 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:33:25,729 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:33:25,730 INFO L168 Benchmark]: Toolchain (without parser) took 8391.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 951.3 MB in the beginning and 880.6 MB in the end (delta: 70.8 MB). Peak memory consumption was 278.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:33:25,731 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:33:25,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:33:25,734 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:33:25,734 INFO L168 Benchmark]: Boogie Preprocessor took 41.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:33:25,735 INFO L168 Benchmark]: RCFGBuilder took 428.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:33:25,736 INFO L168 Benchmark]: BuchiAutomizer took 7285.36 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 880.6 MB in the end (delta: 216.1 MB). Peak memory consumption was 282.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:33:25,737 INFO L168 Benchmark]: Witness Printer took 6.04 ms. Allocated memory is still 1.2 GB. Free memory is still 880.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:33:25,743 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 581.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 428.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7285.36 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 880.6 MB in the end (delta: 216.1 MB). Peak memory consumption was 282.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.04 ms. Allocated memory is still 1.2 GB. Free memory is still 880.6 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 unknown-#memory_int-unknown[x_ref][x_ref] 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 7.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 5.5s. Construction of modules took 0.0s. Büchi inclusion checks took 1.5s. 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 6 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 14 SDtfs, 1 SDslu, 8 SDs, 0 SdLazy, 13 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital347 mio100 ax105 hnf100 lsp92 ukn57 mio100 lsp37 div100 bol100 ite100 ukn100 eq182 hnf88 smp94 dnf303 smp92 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 82ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 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...