./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/aviad_true-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/aviad_true-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 3607a2efd08edc90448739913473b3ff26ff3cc3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:30:09,957 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:30:09,959 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:30:09,975 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:30:09,976 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:30:09,978 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:30:09,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:30:09,982 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:30:09,986 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:30:09,987 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:30:09,988 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:30:09,989 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:30:09,990 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:30:09,992 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:30:10,002 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:30:10,003 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:30:10,007 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:30:10,009 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:30:10,012 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:30:10,016 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:30:10,018 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:30:10,021 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:30:10,025 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:30:10,027 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:30:10,027 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:30:10,028 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:30:10,031 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:30:10,032 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:30:10,032 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:30:10,033 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:30:10,033 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:30:10,034 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:30:10,034 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:30:10,035 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:30:10,038 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:30:10,039 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:30:10,039 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:30:10,059 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:30:10,059 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:30:10,060 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:30:10,060 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:30:10,061 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:30:10,061 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:30:10,061 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:30:10,061 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:30:10,061 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:30:10,061 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:30:10,062 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:30:10,062 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:30:10,062 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:30:10,062 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:30:10,062 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:30:10,062 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:30:10,062 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:30:10,063 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:30:10,063 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:30:10,063 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:30:10,063 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:30:10,063 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:30:10,063 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:30:10,064 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:30:10,064 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:30:10,064 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:30:10,064 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:30:10,064 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:30:10,065 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:30:10,065 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 -> 3607a2efd08edc90448739913473b3ff26ff3cc3 [2019-01-14 02:30:10,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:30:10,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:30:10,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:30:10,120 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:30:10,121 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:30:10,122 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/aviad_true-alloca_true-termination.c.i [2019-01-14 02:30:10,180 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72518479a/19f9d7e0b5c74a06b54d7343e89b7d4d/FLAG7a44a348f [2019-01-14 02:30:10,648 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:30:10,648 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/aviad_true-alloca_true-termination.c.i [2019-01-14 02:30:10,664 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72518479a/19f9d7e0b5c74a06b54d7343e89b7d4d/FLAG7a44a348f [2019-01-14 02:30:10,959 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72518479a/19f9d7e0b5c74a06b54d7343e89b7d4d [2019-01-14 02:30:10,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:30:10,967 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:30:10,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:30:10,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:30:10,973 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:30:10,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:30:10" (1/1) ... [2019-01-14 02:30:10,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9e4c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:10, skipping insertion in model container [2019-01-14 02:30:10,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:30:10" (1/1) ... [2019-01-14 02:30:10,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:30:11,047 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:30:11,435 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:30:11,451 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:30:11,509 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:30:11,580 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:30:11,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:11 WrapperNode [2019-01-14 02:30:11,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:30:11,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:30:11,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:30:11,582 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:30:11,705 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:30:11" (1/1) ... [2019-01-14 02:30:11,725 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:30:11" (1/1) ... [2019-01-14 02:30:11,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:30:11,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:30:11,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:30:11,757 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:30:11,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:11" (1/1) ... [2019-01-14 02:30:11,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:11" (1/1) ... [2019-01-14 02:30:11,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:11" (1/1) ... [2019-01-14 02:30:11,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:11" (1/1) ... [2019-01-14 02:30:11,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:11" (1/1) ... [2019-01-14 02:30:11,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:11" (1/1) ... [2019-01-14 02:30:11,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:11" (1/1) ... [2019-01-14 02:30:11,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:30:11,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:30:11,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:30:11,795 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:30:11,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:11" (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:30:11,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:30:11,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:30:11,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:30:11,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:30:11,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:30:11,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:30:12,246 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:30:12,246 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 02:30:12,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:12 BoogieIcfgContainer [2019-01-14 02:30:12,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:30:12,248 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:30:12,248 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:30:12,253 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:30:12,254 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:12,254 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:30:10" (1/3) ... [2019-01-14 02:30:12,255 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44592da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:30:12, skipping insertion in model container [2019-01-14 02:30:12,255 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:12,255 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:11" (2/3) ... [2019-01-14 02:30:12,257 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44592da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:30:12, skipping insertion in model container [2019-01-14 02:30:12,257 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:12,257 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:12" (3/3) ... [2019-01-14 02:30:12,259 INFO L375 chiAutomizerObserver]: Analyzing ICFG aviad_true-alloca_true-termination.c.i [2019-01-14 02:30:12,317 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:30:12,318 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:30:12,318 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:30:12,318 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:30:12,318 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:30:12,318 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:30:12,318 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:30:12,319 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:30:12,319 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:30:12,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-14 02:30:12,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:30:12,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:12,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:12,366 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:30:12,366 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:30:12,366 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:30:12,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-14 02:30:12,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:30:12,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:12,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:12,368 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:30:12,368 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:30:12,376 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~ret14, main_~x~0, main_~count~1;main_~x~0 := main_#t~nondet13;havoc main_#t~nondet13;f_#in~a := main_~x~0;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~mem6, f_#t~mem7, f_#t~mem8, f_#t~mem9, f_#t~mem10, f_#t~post11, f_#t~mem5, f_#t~mem12, f_~a, f_~a_ref~0.base, f_~a_ref~0.offset, f_~tmp~0.base, f_~tmp~0.offset, f_~count~0.base, f_~count~0.offset;f_~a := f_#in~a;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~a_ref~0.base, f_~a_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~tmp~0.base, f_~tmp~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~count~0.base, f_~count~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call write~int(f_~a, f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(0, f_~tmp~0.base, f_~tmp~0.offset, 4);call write~int(0, f_~count~0.base, f_~count~0.offset, 4); 6#L554-3true [2019-01-14 02:30:12,377 INFO L796 eck$LassoCheckResult]: Loop: 6#L554-3true call f_#t~mem5 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4); 4#L554-1true assume !!(f_#t~mem5 > 1);havoc f_#t~mem5;call f_#t~mem6 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int((if f_#t~mem6 < 0 && 0 != f_#t~mem6 % 2 then f_#t~mem6 % 2 - 2 else f_#t~mem6 % 2), f_~tmp~0.base, f_~tmp~0.offset, 4);havoc f_#t~mem6;call f_#t~mem7 := read~int(f_~tmp~0.base, f_~tmp~0.offset, 4); 7#L556true assume !(0 == f_#t~mem7);havoc f_#t~mem7;call f_#t~mem9 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(f_#t~mem9 - 1, f_~a_ref~0.base, f_~a_ref~0.offset, 4);havoc f_#t~mem9; 13#L556-2true call f_#t~mem10 := read~int(f_~count~0.base, f_~count~0.offset, 4);f_#t~post11 := f_#t~mem10;call write~int(1 + f_#t~post11, f_~count~0.base, f_~count~0.offset, 4);havoc f_#t~mem10;havoc f_#t~post11; 6#L554-3true [2019-01-14 02:30:12,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:12,389 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:30:12,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:12,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:12,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:12,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:12,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:12,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:12,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1144136, now seen corresponding path program 1 times [2019-01-14 02:30:12,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:12,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:12,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:12,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:12,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:12,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:12,619 INFO L82 PathProgramCache]: Analyzing trace with hash 889571338, now seen corresponding path program 1 times [2019-01-14 02:30:12,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:12,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:12,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:12,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:12,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:12,966 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-01-14 02:30:13,526 WARN L181 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-01-14 02:30:14,084 WARN L181 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-01-14 02:30:14,380 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 02:30:14,403 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:30:14,404 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:30:14,405 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:30:14,405 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:30:14,405 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:30:14,405 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:30:14,405 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:30:14,406 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:30:14,406 INFO L131 ssoRankerPreferences]: Filename of dumped script: aviad_true-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:30:14,406 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:30:14,406 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:30:14,438 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:30:14,469 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:30:14,495 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:30:14,528 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:30:14,533 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:30:14,541 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:30:14,550 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:30:14,554 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:30:14,561 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:30:14,567 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:30:14,570 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:30:14,575 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:30:14,577 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:30:15,124 WARN L181 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-01-14 02:30:15,310 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-14 02:30:15,311 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:30:15,314 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:30:15,317 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:30:15,329 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:30:15,332 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:30:15,335 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:30:15,337 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:30:16,624 WARN L181 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:30:16,724 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:30:16,729 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:30:16,732 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:30:16,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:16,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:16,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:16,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:16,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:16,740 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:30:16,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:16,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:16,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:16,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:16,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:16,744 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:30:16,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:16,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:16,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:16,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:16,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:16,747 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:30:16,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:16,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:16,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:16,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:16,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:16,750 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:30:16,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:16,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:16,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:16,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:16,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:16,753 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:30:16,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:16,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:16,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:16,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:16,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:16,756 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:30:16,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:16,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:16,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:16,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:16,764 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:30:16,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:16,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:16,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:16,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:16,770 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:30:16,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:16,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:16,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:16,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:16,778 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:30:16,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:16,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:16,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:16,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:16,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:16,785 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:30:16,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:16,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:16,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:16,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:16,798 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:30:16,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:16,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:16,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:16,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:16,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:16,801 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:30:16,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:16,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:16,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:16,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:16,817 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:30:16,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:16,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:16,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:16,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:16,823 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:30:16,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:16,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:16,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:16,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:16,837 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:30:16,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:16,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:16,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:16,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:16,878 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:30:16,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,879 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:30:16,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,888 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:30:16,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:16,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:16,951 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:30:16,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:16,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:16,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:16,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:16,973 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:30:16,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:16,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:16,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:16,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:16,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:16,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:17,013 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:30:17,034 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:30:17,037 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:30:17,040 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:30:17,042 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:30:17,042 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:30:17,043 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)_1 Supporting invariants [] [2019-01-14 02:30:17,362 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:30:17,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:30:17,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:17,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:17,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:17,544 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 02:30:17,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:17,719 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2019-01-14 02:30:17,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:17,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2019-01-14 02:30:17,823 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 02:30:17,901 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 36 treesize of output 35 [2019-01-14 02:30:17,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:17,956 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 02:30:18,034 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 54 [2019-01-14 02:30:18,041 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 49 treesize of output 48 [2019-01-14 02:30:18,042 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:18,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:18,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2019-01-14 02:30:18,137 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 02:30:18,192 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 02:30:18,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2019-01-14 02:30:18,269 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:154, output treesize:131 [2019-01-14 02:30:18,454 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2019-01-14 02:30:18,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:18,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2019-01-14 02:30:18,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:18,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-01-14 02:30:18,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:18,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:30:18,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:18,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 66 [2019-01-14 02:30:18,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:18,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2019-01-14 02:30:18,585 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:18,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:18,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:18,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:18,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:30:18,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 63 [2019-01-14 02:30:18,740 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:30:18,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:30:18,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-14 02:30:18,842 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:93, output treesize:65 [2019-01-14 02:30:18,930 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:30:18,944 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 [2019-01-14 02:30:18,945 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 5 states. [2019-01-14 02:30:19,099 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 5 states. Result 22 states and 26 transitions. Complement of second has 10 states. [2019-01-14 02:30:19,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:30:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:30:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2019-01-14 02:30:19,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 02:30:19,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:19,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:30:19,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:19,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-14 02:30:19,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:19,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2019-01-14 02:30:19,108 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:30:19,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2019-01-14 02:30:19,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:30:19,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:30:19,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:30:19,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:30:19,113 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:30:19,113 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:30:19,113 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:30:19,113 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:30:19,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:30:19,113 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:30:19,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:30:19,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:30:19 BoogieIcfgContainer [2019-01-14 02:30:19,120 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:30:19,121 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:30:19,121 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:30:19,121 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:30:19,121 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:12" (3/4) ... [2019-01-14 02:30:19,125 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:30:19,125 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:30:19,126 INFO L168 Benchmark]: Toolchain (without parser) took 8160.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 952.7 MB in the beginning and 974.1 MB in the end (delta: -21.4 MB). Peak memory consumption was 186.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:19,127 INFO L168 Benchmark]: CDTParser took 0.19 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:30:19,128 INFO L168 Benchmark]: CACSL2BoogieTranslator took 613.42 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 929.9 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:19,128 INFO L168 Benchmark]: Boogie Procedure Inliner took 174.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:19,129 INFO L168 Benchmark]: Boogie Preprocessor took 38.19 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:30:19,130 INFO L168 Benchmark]: RCFGBuilder took 452.71 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: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:19,130 INFO L168 Benchmark]: BuchiAutomizer took 6871.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 974.1 MB in the end (delta: 134.0 MB). Peak memory consumption was 202.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:19,131 INFO L168 Benchmark]: Witness Printer took 4.62 ms. Allocated memory is still 1.2 GB. Free memory is still 974.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:30:19,136 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.19 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 613.42 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 929.9 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 174.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.19 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 452.71 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: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6871.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 974.1 MB in the end (delta: 134.0 MB). Peak memory consumption was 202.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.62 ms. Allocated memory is still 1.2 GB. Free memory is still 974.1 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[a_ref][a_ref] and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.9s. Construction of modules took 0.0s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 21 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital442 mio100 ax104 hnf100 lsp94 ukn42 mio100 lsp36 div102 bol100 ite100 ukn100 eq188 hnf87 smp100 dnf293 smp92 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 72ms 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...