./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.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 2f8c9504db0ceae8da468539322e1d0ba6c4e9f7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:00:33,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:00:33,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:00:33,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:00:33,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:00:33,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:00:33,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:00:33,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:00:33,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:00:33,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:00:33,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:00:33,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:00:33,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:00:33,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:00:33,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:00:33,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:00:33,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:00:33,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:00:33,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:00:33,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:00:33,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:00:33,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:00:33,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:00:33,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:00:33,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:00:33,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:00:33,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:00:33,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:00:33,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:00:33,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:00:33,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:00:33,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:00:33,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:00:33,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:00:33,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:00:33,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:00:33,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:00:33,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:00:33,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:00:33,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:00:33,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:00:33,097 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 03:00:33,115 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:00:33,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:00:33,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:00:33,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:00:33,122 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:00:33,122 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:00:33,122 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:00:33,122 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:00:33,123 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:00:33,123 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:00:33,124 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:00:33,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:00:33,125 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:00:33,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:00:33,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:00:33,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:00:33,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:00:33,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:00:33,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:00:33,127 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:00:33,128 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:00:33,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:00:33,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:00:33,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:00:33,129 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:00:33,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:00:33,129 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:00:33,130 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:00:33,131 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:00:33,131 INFO L138 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 -> 2f8c9504db0ceae8da468539322e1d0ba6c4e9f7 [2019-11-28 03:00:33,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:00:33,506 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:00:33,510 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:00:33,512 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:00:33,512 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:00:33,514 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i [2019-11-28 03:00:33,584 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1ef4740/5544c01430604bbb81b99e9ae5db9492/FLAGc34b34929 [2019-11-28 03:00:34,150 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:00:34,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i [2019-11-28 03:00:34,167 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1ef4740/5544c01430604bbb81b99e9ae5db9492/FLAGc34b34929 [2019-11-28 03:00:34,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1ef4740/5544c01430604bbb81b99e9ae5db9492 [2019-11-28 03:00:34,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:00:34,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:00:34,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:00:34,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:00:34,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:00:34,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:00:34" (1/1) ... [2019-11-28 03:00:34,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@588ffba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:34, skipping insertion in model container [2019-11-28 03:00:34,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:00:34" (1/1) ... [2019-11-28 03:00:34,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:00:34,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:00:34,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:00:34,890 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:00:34,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:00:35,011 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:00:35,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:35 WrapperNode [2019-11-28 03:00:35,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:00:35,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:00:35,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:00:35,013 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:00:35,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:35" (1/1) ... [2019-11-28 03:00:35,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:35" (1/1) ... [2019-11-28 03:00:35,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:00:35,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:00:35,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:00:35,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:00:35,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:35" (1/1) ... [2019-11-28 03:00:35,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:35" (1/1) ... [2019-11-28 03:00:35,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:35" (1/1) ... [2019-11-28 03:00:35,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:35" (1/1) ... [2019-11-28 03:00:35,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:35" (1/1) ... [2019-11-28 03:00:35,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:35" (1/1) ... [2019-11-28 03:00:35,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:35" (1/1) ... [2019-11-28 03:00:35,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:00:35,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:00:35,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:00:35,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:00:35,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:35" (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-11-28 03:00:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:00:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:00:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:00:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:00:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:00:35,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:00:35,459 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:00:35,460 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 03:00:35,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:00:35 BoogieIcfgContainer [2019-11-28 03:00:35,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:00:35,462 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:00:35,462 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:00:35,465 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:00:35,466 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:00:35,466 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:00:34" (1/3) ... [2019-11-28 03:00:35,468 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ecd371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:00:35, skipping insertion in model container [2019-11-28 03:00:35,468 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:00:35,468 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:35" (2/3) ... [2019-11-28 03:00:35,468 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ecd371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:00:35, skipping insertion in model container [2019-11-28 03:00:35,469 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:00:35,469 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:00:35" (3/3) ... [2019-11-28 03:00:35,470 INFO L371 chiAutomizerObserver]: Analyzing ICFG Velroyen-alloca.i [2019-11-28 03:00:35,510 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:00:35,510 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:00:35,510 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:00:35,510 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:00:35,511 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:00:35,511 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:00:35,511 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:00:35,511 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:00:35,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-28 03:00:35,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 03:00:35,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:35,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:35,551 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:00:35,551 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:00:35,551 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:00:35,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-28 03:00:35,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 03:00:35,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:35,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:35,554 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:00:35,554 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:00:35,560 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 14#L552-3true [2019-11-28 03:00:35,561 INFO L796 eck$LassoCheckResult]: Loop: 14#L552-3true call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 11#L551-1true assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 8#L552true assume !main_#t~short7; 12#L552-2true assume !main_#t~short7;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); 14#L552-3true [2019-11-28 03:00:35,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:35,566 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 03:00:35,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:35,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590360916] [2019-11-28 03:00:35,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:35,713 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:35,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:35,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1144151, now seen corresponding path program 1 times [2019-11-28 03:00:35,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:35,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649938701] [2019-11-28 03:00:35,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:35,740 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:35,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:35,742 INFO L82 PathProgramCache]: Analyzing trace with hash 889571353, now seen corresponding path program 1 times [2019-11-28 03:00:35,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:35,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133938049] [2019-11-28 03:00:35,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:35,777 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:35,930 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-11-28 03:00:36,090 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-11-28 03:00:36,151 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:00:36,152 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:00:36,152 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:00:36,152 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:00:36,152 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:00:36,153 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:36,153 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:00:36,153 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:00:36,153 INFO L133 ssoRankerPreferences]: Filename of dumped script: Velroyen-alloca.i_Iteration1_Lasso [2019-11-28 03:00:36,154 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:00:36,154 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:00:36,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:36,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:36,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:36,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:36,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:36,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:36,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:36,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:36,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:36,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:36,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:36,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:36,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:36,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:36,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:36,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:36,653 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:00:36,658 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:36,676 INFO L120 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-11-28 03:00:36,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:36,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:36,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:36,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:36,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:36,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:36,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:36,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:36,709 INFO L120 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-11-28 03:00:36,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:36,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:36,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:36,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:36,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:36,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:36,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:36,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:36,738 INFO L120 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-11-28 03:00:36,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:36,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:36,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:36,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:36,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:36,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:36,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:36,745 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:36,760 INFO L120 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-11-28 03:00:36,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:36,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:36,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:36,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:36,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:36,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:36,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:36,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:36,783 INFO L120 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-11-28 03:00:36,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:36,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:36,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:36,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:36,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:36,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:36,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:36,791 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:36,799 INFO L120 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-11-28 03:00:36,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:36,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:36,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:36,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:36,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:36,815 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:00:36,821 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:36,831 INFO L120 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 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:36,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:36,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:36,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:36,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:36,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:36,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:36,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:36,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:36,858 INFO L120 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-11-28 03:00:36,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:36,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:36,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:36,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:36,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:36,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:00:36,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:36,885 INFO L120 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-11-28 03:00:36,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:36,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:36,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:36,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:36,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:36,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:36,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:36,913 INFO L120 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-11-28 03:00:36,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:36,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:36,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:36,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:36,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:36,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:36,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:36,943 INFO L120 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-11-28 03:00:36,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:36,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:36,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:36,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:36,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:36,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:36,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:36,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:36,964 INFO L120 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-11-28 03:00:36,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:36,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:36,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:36,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:36,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:36,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:00:36,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:36,986 INFO L120 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-11-28 03:00:36,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:36,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:36,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:36,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:36,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:36,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:37,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:37,025 INFO L120 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-11-28 03:00:37,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:37,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:37,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:37,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:37,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:37,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:37,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:37,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:37,051 INFO L120 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-11-28 03:00:37,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:37,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:37,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:37,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:37,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:37,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:00:37,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:37,075 INFO L120 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-11-28 03:00:37,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:37,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:37,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:37,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:37,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:37,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:00:37,089 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:00:37,118 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-28 03:00:37,118 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:37,134 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:00:37,145 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:00:37,145 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:00:37,146 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2019-11-28 03:00:37,222 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 03:00:37,242 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 03:00:37,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:37,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:00:37,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:00:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:37,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:00:37,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:00:37,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:00:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:37,408 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-11-28 03:00:37,409 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2019-11-28 03:00:37,524 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 42 states and 56 transitions. Complement of second has 10 states. [2019-11-28 03:00:37,524 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-11-28 03:00:37,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:00:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-28 03:00:37,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-28 03:00:37,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:00:37,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 03:00:37,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:00:37,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-28 03:00:37,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:00:37,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2019-11-28 03:00:37,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 03:00:37,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 23 states and 35 transitions. [2019-11-28 03:00:37,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 03:00:37,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 03:00:37,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 35 transitions. [2019-11-28 03:00:37,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:00:37,545 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2019-11-28 03:00:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 35 transitions. [2019-11-28 03:00:37,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-11-28 03:00:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 03:00:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-11-28 03:00:37,581 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-28 03:00:37,582 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-28 03:00:37,582 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:00:37,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-11-28 03:00:37,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 03:00:37,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:37,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:37,585 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:00:37,586 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:00:37,586 INFO L794 eck$LassoCheckResult]: Stem: 123#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 116#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 117#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 129#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 130#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 125#L552-2 [2019-11-28 03:00:37,586 INFO L796 eck$LassoCheckResult]: Loop: 125#L552-2 assume !main_#t~short7;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); 128#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 133#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 124#L552 assume !main_#t~short7; 125#L552-2 [2019-11-28 03:00:37,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:37,587 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2019-11-28 03:00:37,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:37,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806482112] [2019-11-28 03:00:37,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:37,659 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:37,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:37,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1943531, now seen corresponding path program 2 times [2019-11-28 03:00:37,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:37,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167767505] [2019-11-28 03:00:37,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:37,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:37,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167767505] [2019-11-28 03:00:37,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:37,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:00:37,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805053554] [2019-11-28 03:00:37,721 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:00:37,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:37,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:00:37,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:00:37,726 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-28 03:00:37,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:37,770 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-11-28 03:00:37,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:00:37,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2019-11-28 03:00:37,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 03:00:37,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 27 transitions. [2019-11-28 03:00:37,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 03:00:37,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 03:00:37,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-11-28 03:00:37,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:00:37,775 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-28 03:00:37,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-11-28 03:00:37,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 03:00:37,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 03:00:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-11-28 03:00:37,779 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-28 03:00:37,779 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-28 03:00:37,779 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:00:37,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2019-11-28 03:00:37,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 03:00:37,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:37,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:37,781 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:00:37,782 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:00:37,782 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 170#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 171#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 184#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 178#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 180#L552-2 [2019-11-28 03:00:37,782 INFO L796 eck$LassoCheckResult]: Loop: 180#L552-2 assume main_#t~short7;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 187#L553 assume main_#t~mem8 < 0;havoc main_#t~mem8;call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); 183#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 186#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 189#L552 assume !main_#t~short7; 180#L552-2 [2019-11-28 03:00:37,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:37,783 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 2 times [2019-11-28 03:00:37,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:37,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295682122] [2019-11-28 03:00:37,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:37,808 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:37,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:37,809 INFO L82 PathProgramCache]: Analyzing trace with hash 48745192, now seen corresponding path program 1 times [2019-11-28 03:00:37,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:37,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884693477] [2019-11-28 03:00:37,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:37,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884693477] [2019-11-28 03:00:37,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:37,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:00:37,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669861377] [2019-11-28 03:00:37,842 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:00:37,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:37,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:00:37,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:00:37,843 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 03:00:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:37,912 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-11-28 03:00:37,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:00:37,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-11-28 03:00:37,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 03:00:37,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 38 transitions. [2019-11-28 03:00:37,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 03:00:37,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-28 03:00:37,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2019-11-28 03:00:37,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:00:37,916 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-11-28 03:00:37,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2019-11-28 03:00:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-11-28 03:00:37,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 03:00:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-11-28 03:00:37,919 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-28 03:00:37,919 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-28 03:00:37,920 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:00:37,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-11-28 03:00:37,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 03:00:37,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:37,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:37,922 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:00:37,922 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:00:37,922 INFO L794 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 230#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 231#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 247#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 249#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 239#L552-2 [2019-11-28 03:00:37,923 INFO L796 eck$LassoCheckResult]: Loop: 239#L552-2 assume main_#t~short7;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 252#L553 assume main_#t~mem8 < 0;havoc main_#t~mem8;call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); 235#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 244#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 238#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 239#L552-2 [2019-11-28 03:00:37,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:37,923 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 3 times [2019-11-28 03:00:37,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:37,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972057423] [2019-11-28 03:00:37,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:37,970 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:37,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:37,971 INFO L82 PathProgramCache]: Analyzing trace with hash 48745190, now seen corresponding path program 1 times [2019-11-28 03:00:37,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:37,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898530526] [2019-11-28 03:00:37,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:37,992 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:37,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:37,994 INFO L82 PathProgramCache]: Analyzing trace with hash 707540352, now seen corresponding path program 1 times [2019-11-28 03:00:37,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:37,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340173652] [2019-11-28 03:00:37,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:38,053 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:38,209 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2019-11-28 03:00:38,479 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-11-28 03:00:38,792 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-11-28 03:00:38,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:00:38 BoogieIcfgContainer [2019-11-28 03:00:38,820 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:00:38,822 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:00:38,822 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:00:38,822 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:00:38,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:00:35" (3/4) ... [2019-11-28 03:00:38,827 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 03:00:38,906 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 03:00:38,906 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:00:38,912 INFO L168 Benchmark]: Toolchain (without parser) took 4428.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -155.7 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:38,913 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:00:38,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 531.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -143.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:38,915 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:00:38,922 INFO L168 Benchmark]: Boogie Preprocessor took 24.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:38,924 INFO L168 Benchmark]: RCFGBuilder took 380.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:38,926 INFO L168 Benchmark]: BuchiAutomizer took 3358.00 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -37.2 MB). Peak memory consumption was 297.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:38,927 INFO L168 Benchmark]: Witness Printer took 84.51 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-11-28 03:00:38,935 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 531.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -143.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 380.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3358.00 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -37.2 MB). Peak memory consumption was 297.4 MB. Max. memory is 11.5 GB. * Witness Printer took 84.51 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. * 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) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 16 SDslu, 27 SDs, 0 SdLazy, 75 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital99 mio100 ax118 hnf100 lsp76 ukn72 mio100 lsp41 div100 bol100 ite100 ukn100 eq144 hnf92 smp83 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 552]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37e819eb=2, NULL=0, \result=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ef6f8d3=0, NULL=0, x=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37e819eb=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@37a1c8ec=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@48858da2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@6045ea1e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@724e6cc1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@1c6b0952=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@651acbc2=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@5444f8b1=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 552]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L549] int* x = __builtin_alloca (sizeof(int)); [L550] *x = __VERIFIER_nondet_int() [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 Loop: [L552] COND TRUE -5 <= *x && *x <= 35 [L553] EXPR \read(*x) [L553] COND TRUE *x < 0 [L554] *x = -5 [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...