./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/b.05-alloca_true-termination_true-no-overflow.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/b.05-alloca_true-termination_true-no-overflow.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 f1e9ba7e316537618e1819aa49662575d0a5a8e7 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:28,155 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:30:28,159 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:30:28,171 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:30:28,171 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:30:28,172 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:30:28,173 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:30:28,176 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:30:28,177 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:30:28,178 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:30:28,179 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:30:28,179 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:30:28,180 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:30:28,182 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:30:28,183 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:30:28,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:30:28,185 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:30:28,187 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:30:28,189 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:30:28,191 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:30:28,192 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:30:28,194 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:30:28,197 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:30:28,197 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:30:28,197 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:30:28,198 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:30:28,199 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:30:28,200 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:30:28,201 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:30:28,202 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:30:28,203 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:30:28,203 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:30:28,204 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:30:28,204 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:30:28,205 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:30:28,206 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:30:28,206 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:28,227 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:30:28,227 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:30:28,229 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:30:28,229 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:30:28,229 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:30:28,230 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:30:28,230 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:30:28,230 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:30:28,230 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:30:28,231 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:30:28,231 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:30:28,231 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:30:28,231 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:30:28,231 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:30:28,232 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:30:28,232 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:30:28,232 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:30:28,232 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:30:28,232 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:30:28,232 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:30:28,233 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:30:28,233 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:30:28,233 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:30:28,233 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:30:28,233 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:30:28,234 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:30:28,236 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:30:28,236 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:30:28,237 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:30:28,237 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 -> f1e9ba7e316537618e1819aa49662575d0a5a8e7 [2019-01-14 02:30:28,285 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:30:28,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:30:28,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:30:28,307 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:30:28,307 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:30:28,308 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/b.05-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:30:28,374 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5466d8a5/b430c54f3d004b289fda41a3ffb8108b/FLAG0ce4c33a2 [2019-01-14 02:30:28,829 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:30:28,830 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/b.05-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:30:28,845 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5466d8a5/b430c54f3d004b289fda41a3ffb8108b/FLAG0ce4c33a2 [2019-01-14 02:30:29,151 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5466d8a5/b430c54f3d004b289fda41a3ffb8108b [2019-01-14 02:30:29,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:30:29,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:30:29,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:30:29,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:30:29,160 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:30:29,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:30:29" (1/1) ... [2019-01-14 02:30:29,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19df2242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:29, skipping insertion in model container [2019-01-14 02:30:29,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:30:29" (1/1) ... [2019-01-14 02:30:29,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:30:29,221 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:30:29,574 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:30:29,586 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:30:29,694 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:30:29,748 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:30:29,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:29 WrapperNode [2019-01-14 02:30:29,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:30:29,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:30:29,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:30:29,749 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:30:29,758 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:29" (1/1) ... [2019-01-14 02:30:29,783 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:29" (1/1) ... [2019-01-14 02:30:29,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:30:29,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:30:29,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:30:29,814 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:30:29,824 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:29" (1/1) ... [2019-01-14 02:30:29,824 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:29" (1/1) ... [2019-01-14 02:30:29,829 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:29" (1/1) ... [2019-01-14 02:30:29,831 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:29" (1/1) ... [2019-01-14 02:30:29,848 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:29" (1/1) ... [2019-01-14 02:30:29,854 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:29" (1/1) ... [2019-01-14 02:30:29,856 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:29" (1/1) ... [2019-01-14 02:30:29,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:30:29,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:30:29,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:30:29,865 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:30:29,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:29" (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:29,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:30:29,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:30:29,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:30:29,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:30:29,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:30:29,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:30:30,299 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:30:30,300 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 02:30:30,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:30 BoogieIcfgContainer [2019-01-14 02:30:30,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:30:30,302 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:30:30,302 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:30:30,305 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:30:30,305 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:30,306 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:30:29" (1/3) ... [2019-01-14 02:30:30,307 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c6bfc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:30:30, skipping insertion in model container [2019-01-14 02:30:30,307 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:30,307 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:29" (2/3) ... [2019-01-14 02:30:30,307 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c6bfc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:30:30, skipping insertion in model container [2019-01-14 02:30:30,307 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:30,308 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:30" (3/3) ... [2019-01-14 02:30:30,309 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.05-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:30:30,366 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:30:30,367 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:30:30,367 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:30:30,367 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:30:30,368 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:30:30,368 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:30:30,368 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:30:30,368 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:30:30,368 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:30:30,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:30:30,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:30:30,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:30,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:30,415 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:30:30,415 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:30:30,415 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:30:30,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:30:30,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:30:30,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:30,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:30,420 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:30:30,421 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:30:30,428 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; 6#L554-11true [2019-01-14 02:30:30,429 INFO L796 eck$LassoCheckResult]: Loop: 6#L554-11true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 8#L554-1true assume test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 >= 0; 12#L554-3true test_fun_#t~short9 := test_fun_#t~short7; 14#L554-4true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3#L554-6true test_fun_#t~short11 := test_fun_#t~short9; 4#L554-7true assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; 5#L554-9true assume !!test_fun_#t~short11;havoc test_fun_#t~mem10;havoc test_fun_#t~short9;havoc test_fun_#t~short11;havoc test_fun_#t~mem8;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; 6#L554-11true [2019-01-14 02:30:30,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:30,434 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:30:30,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:30,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:30,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:30,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:30,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:30,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:30,579 INFO L82 PathProgramCache]: Analyzing trace with hash -334850282, now seen corresponding path program 1 times [2019-01-14 02:30:30,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:30,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:30,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:30,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:30,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:30,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:30,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1211446548, now seen corresponding path program 1 times [2019-01-14 02:30:30,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:30,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:30,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:30,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:30,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:31,537 WARN L181 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-01-14 02:30:32,060 WARN L181 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-01-14 02:30:32,437 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-14 02:30:32,466 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:30:32,467 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:30:32,467 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:30:32,468 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:30:32,468 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:30:32,468 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:30:32,468 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:30:32,468 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:30:32,468 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.05-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2019-01-14 02:30:32,469 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:30:32,469 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:30:32,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:32,524 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:32,526 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:32,529 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:32,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:32,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:32,544 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:32,547 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:32,551 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:32,558 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:32,563 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:32,572 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:32,573 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:32,583 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:32,585 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:32,887 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-01-14 02:30:33,064 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-01-14 02:30:33,065 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:33,068 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:33,083 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:33,099 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:33,102 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:33,668 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-14 02:30:33,816 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:30:33,822 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:30:33,824 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:33,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:33,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:33,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:33,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:33,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:33,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:33,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:33,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:33,834 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:33,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:33,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:33,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:33,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:33,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:33,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:33,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:33,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:33,838 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:33,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:33,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:33,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:33,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:33,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:33,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:33,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:33,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:33,843 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:33,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:33,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:33,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:33,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:33,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:33,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:33,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:33,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:33,848 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:33,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:33,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:33,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:33,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:33,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:33,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:33,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:33,858 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:33,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:33,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:33,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:33,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:33,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:33,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:33,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:33,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:33,863 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:33,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:33,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:33,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:33,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:33,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:33,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:33,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:33,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:33,869 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:33,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:33,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:33,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:33,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:33,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:33,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:33,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:33,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:33,875 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:33,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:33,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:33,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:33,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:33,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:33,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:33,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:33,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:33,881 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:33,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:33,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:33,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:33,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:33,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:33,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:33,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:33,891 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:33,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:33,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:33,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:33,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:33,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:33,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:33,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:33,902 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:33,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:33,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:33,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:33,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:33,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:33,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:33,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:33,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:33,908 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:33,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:33,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:33,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:33,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:33,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:33,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:33,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:33,926 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:33,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:33,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:33,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:33,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:33,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:33,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:33,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:33,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:33,930 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:33,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:33,930 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:30:33,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:33,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:33,938 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:30:33,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:33,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:33,996 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:33,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:33,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:33,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:33,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:34,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:34,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:34,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:34,018 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:34,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:34,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:34,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:34,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:34,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:34,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:34,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:34,033 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:34,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:34,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:34,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:34,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:34,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:34,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:34,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:34,040 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:34,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:34,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:34,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:34,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:34,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:34,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:34,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:34,048 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:34,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:34,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:34,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:34,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:34,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:34,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:34,123 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:30:34,140 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:30:34,142 INFO L444 ModelExtractionUtils]: 19 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:30:34,144 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:30:34,147 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:30:34,147 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:30:34,148 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2019-01-14 02:30:34,228 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2019-01-14 02:30:34,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:30:34,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:34,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:34,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:34,584 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:34,601 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:30:34,603 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 4 states. [2019-01-14 02:30:34,941 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 4 states. Result 42 states and 57 transitions. Complement of second has 10 states. [2019-01-14 02:30:34,942 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:34,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:30:34,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2019-01-14 02:30:34,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 7 letters. [2019-01-14 02:30:34,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:34,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 9 letters. Loop has 7 letters. [2019-01-14 02:30:34,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:34,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 14 letters. [2019-01-14 02:30:34,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:34,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 57 transitions. [2019-01-14 02:30:34,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:30:34,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 24 states and 33 transitions. [2019-01-14 02:30:34,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:30:34,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:30:34,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-01-14 02:30:34,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:30:34,960 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 02:30:34,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-01-14 02:30:34,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-14 02:30:34,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 02:30:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2019-01-14 02:30:34,984 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-01-14 02:30:34,984 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-01-14 02:30:34,984 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:30:34,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2019-01-14 02:30:34,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:30:34,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:34,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:34,986 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:30:34,986 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:30:34,987 INFO L794 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; 169#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 170#L554-1 [2019-01-14 02:30:34,987 INFO L796 eck$LassoCheckResult]: Loop: 170#L554-1 assume !test_fun_#t~short7; 171#L554-3 test_fun_#t~short9 := test_fun_#t~short7; 178#L554-4 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 164#L554-6 test_fun_#t~short11 := test_fun_#t~short9; 165#L554-7 assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; 176#L554-9 assume !!test_fun_#t~short11;havoc test_fun_#t~mem10;havoc test_fun_#t~short9;havoc test_fun_#t~short11;havoc test_fun_#t~mem8;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; 180#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 170#L554-1 [2019-01-14 02:30:34,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:34,987 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-14 02:30:34,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:34,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:34,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:34,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:34,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:35,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:35,012 INFO L82 PathProgramCache]: Analyzing trace with hash -74889736, now seen corresponding path program 1 times [2019-01-14 02:30:35,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:35,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:35,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:35,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:35,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:35,105 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:35,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:30:35,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:30:35,108 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:30:35,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:30:35,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:30:35,112 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 02:30:35,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:30:35,154 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-01-14 02:30:35,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:30:35,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2019-01-14 02:30:35,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:30:35,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2019-01-14 02:30:35,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:30:35,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:30:35,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-01-14 02:30:35,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:30:35,160 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-14 02:30:35,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-01-14 02:30:35,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-01-14 02:30:35,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 02:30:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-01-14 02:30:35,165 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-14 02:30:35,165 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-14 02:30:35,165 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:30:35,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-01-14 02:30:35,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:30:35,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:35,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:35,167 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:30:35,168 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:30:35,169 INFO L794 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 222#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; 223#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 228#L554-1 [2019-01-14 02:30:35,169 INFO L796 eck$LassoCheckResult]: Loop: 228#L554-1 assume !test_fun_#t~short7; 229#L554-3 test_fun_#t~short9 := test_fun_#t~short7; 236#L554-4 assume !test_fun_#t~short9; 224#L554-6 test_fun_#t~short11 := test_fun_#t~short9; 225#L554-7 assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; 234#L554-9 assume !!test_fun_#t~short11;havoc test_fun_#t~mem10;havoc test_fun_#t~short9;havoc test_fun_#t~short11;havoc test_fun_#t~mem8;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; 238#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 228#L554-1 [2019-01-14 02:30:35,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:35,169 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-01-14 02:30:35,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:35,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:35,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:35,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:35,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:35,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:35,190 INFO L82 PathProgramCache]: Analyzing trace with hash -73042694, now seen corresponding path program 1 times [2019-01-14 02:30:35,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:35,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:35,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:35,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:30:35,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:35,228 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:35,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:30:35,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:30:35,229 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:30:35,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:30:35,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:30:35,231 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-01-14 02:30:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:30:35,357 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-01-14 02:30:35,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:30:35,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2019-01-14 02:30:35,361 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:30:35,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2019-01-14 02:30:35,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:30:35,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:30:35,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:30:35,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:30:35,361 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:30:35,362 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:30:35,362 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:30:35,362 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:30:35,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:30:35,362 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:30:35,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:30:35,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:30:35 BoogieIcfgContainer [2019-01-14 02:30:35,368 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:30:35,369 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:30:35,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:30:35,369 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:30:35,369 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:30" (3/4) ... [2019-01-14 02:30:35,372 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:30:35,373 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:30:35,373 INFO L168 Benchmark]: Toolchain (without parser) took 6219.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.6 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -210.7 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:35,375 INFO L168 Benchmark]: CDTParser took 0.16 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:35,375 INFO L168 Benchmark]: CACSL2BoogieTranslator took 592.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:35,376 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.17 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:30:35,377 INFO L168 Benchmark]: Boogie Preprocessor took 50.50 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:35,378 INFO L168 Benchmark]: RCFGBuilder took 436.72 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: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:35,378 INFO L168 Benchmark]: BuchiAutomizer took 5066.66 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 1.2 GB in the end (delta: -50.0 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:35,379 INFO L168 Benchmark]: Witness Printer took 4.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:30:35,384 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.16 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 592.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.17 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 50.50 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 436.72 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: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5066.66 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 1.2 GB in the end (delta: -50.0 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 44 SDslu, 39 SDs, 0 SdLazy, 59 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital225 mio100 ax108 hnf100 lsp87 ukn65 mio100 lsp35 div100 bol100 ite100 ukn100 eq172 hnf89 smp92 dnf171 smp95 tf100 neg93 sie125 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 65ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...