./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 9becd42a466bdbd2531661a22b57e70854c9d9ea ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:57:10,727 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:57:10,732 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:57:10,746 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:57:10,747 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:57:10,748 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:57:10,749 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:57:10,751 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:57:10,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:57:10,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:57:10,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:57:10,754 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:57:10,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:57:10,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:57:10,757 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:57:10,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:57:10,759 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:57:10,761 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:57:10,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:57:10,765 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:57:10,766 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:57:10,767 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:57:10,769 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:57:10,770 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:57:10,770 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:57:10,771 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:57:10,772 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:57:10,773 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:57:10,774 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:57:10,775 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:57:10,775 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:57:10,776 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:57:10,776 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:57:10,776 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:57:10,777 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:57:10,778 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:57:10,778 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:57:10,795 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:57:10,795 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:57:10,796 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:57:10,796 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:57:10,796 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:57:10,797 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:57:10,797 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:57:10,797 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:57:10,797 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:57:10,797 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:57:10,798 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:57:10,798 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:57:10,798 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:57:10,798 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:57:10,798 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:57:10,798 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:57:10,799 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:57:10,799 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:57:10,799 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:57:10,799 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:57:10,799 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:57:10,799 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:57:10,800 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:57:10,800 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:57:10,800 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:57:10,800 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:57:10,800 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:57:10,800 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:57:10,801 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:57:10,801 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:57:10,801 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:57:10,802 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:57:10,802 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9becd42a466bdbd2531661a22b57e70854c9d9ea [2019-01-01 22:57:10,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:57:10,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:57:10,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:57:10,891 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:57:10,891 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:57:10,892 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2019-01-01 22:57:10,959 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8862661ba/c41734e7f00e4b86a39dffb9cf99dcc3/FLAGfb5d1b247 [2019-01-01 22:57:11,463 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:57:11,464 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2019-01-01 22:57:11,479 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8862661ba/c41734e7f00e4b86a39dffb9cf99dcc3/FLAGfb5d1b247 [2019-01-01 22:57:11,745 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8862661ba/c41734e7f00e4b86a39dffb9cf99dcc3 [2019-01-01 22:57:11,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:57:11,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:57:11,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:57:11,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:57:11,761 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:57:11,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:57:11" (1/1) ... [2019-01-01 22:57:11,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35916119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:11, skipping insertion in model container [2019-01-01 22:57:11,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:57:11" (1/1) ... [2019-01-01 22:57:11,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:57:11,824 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:57:12,172 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:57:12,191 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:57:12,359 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:57:12,430 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:57:12,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:12 WrapperNode [2019-01-01 22:57:12,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:57:12,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:57:12,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:57:12,432 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:57:12,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:12" (1/1) ... [2019-01-01 22:57:12,468 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:12" (1/1) ... [2019-01-01 22:57:12,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:57:12,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:57:12,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:57:12,500 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:57:12,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:12" (1/1) ... [2019-01-01 22:57:12,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:12" (1/1) ... [2019-01-01 22:57:12,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:12" (1/1) ... [2019-01-01 22:57:12,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:12" (1/1) ... [2019-01-01 22:57:12,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:12" (1/1) ... [2019-01-01 22:57:12,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:12" (1/1) ... [2019-01-01 22:57:12,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:12" (1/1) ... [2019-01-01 22:57:12,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:57:12,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:57:12,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:57:12,563 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:57:12,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:12" (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-01 22:57:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:57:12,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:57:12,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 22:57:12,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 22:57:12,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 22:57:12,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:57:12,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:57:12,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:57:13,100 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:57:13,101 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-01 22:57:13,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:57:13 BoogieIcfgContainer [2019-01-01 22:57:13,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:57:13,102 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:57:13,102 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:57:13,106 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:57:13,107 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:57:13,107 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:57:11" (1/3) ... [2019-01-01 22:57:13,109 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51f9370d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:57:13, skipping insertion in model container [2019-01-01 22:57:13,109 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:57:13,109 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:12" (2/3) ... [2019-01-01 22:57:13,109 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51f9370d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:57:13, skipping insertion in model container [2019-01-01 22:57:13,110 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:57:13,110 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:57:13" (3/3) ... [2019-01-01 22:57:13,111 INFO L375 chiAutomizerObserver]: Analyzing ICFG simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2019-01-01 22:57:13,172 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:57:13,173 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:57:13,173 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:57:13,173 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:57:13,174 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:57:13,174 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:57:13,174 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:57:13,174 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:57:13,174 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:57:13,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-01-01 22:57:13,217 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-01-01 22:57:13,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:13,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:13,229 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:57:13,229 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 22:57:13,229 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:57:13,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-01-01 22:57:13,233 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-01-01 22:57:13,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:13,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:13,235 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:57:13,235 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 22:57:13,244 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 12#L629true assume main_~a~0.base == 0 && main_~a~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 5#L621true [2019-01-01 22:57:13,245 INFO L796 eck$LassoCheckResult]: Loop: 5#L621true assume true; 5#L621true [2019-01-01 22:57:13,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:13,251 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-01-01 22:57:13,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:13,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:13,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:13,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:13,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:13,403 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-01 22:57:13,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:57:13,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:57:13,408 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:57:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:13,409 INFO L82 PathProgramCache]: Analyzing trace with hash 103, now seen corresponding path program 1 times [2019-01-01 22:57:13,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:13,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:13,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:13,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:13,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:13,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:57:13,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:57:13,482 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-01-01 22:57:13,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:57:13,525 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-01 22:57:13,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:57:13,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2019-01-01 22:57:13,530 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 22:57:13,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 17 transitions. [2019-01-01 22:57:13,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 22:57:13,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 22:57:13,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-01-01 22:57:13,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:57:13,538 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-01 22:57:13,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-01-01 22:57:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-01 22:57:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 22:57:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-01-01 22:57:13,572 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-01 22:57:13,572 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-01 22:57:13,572 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:57:13,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-01-01 22:57:13,573 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 22:57:13,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:13,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:13,574 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 22:57:13,574 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:57:13,575 INFO L794 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 59#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 57#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 58#L629-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 53#L633-2 [2019-01-01 22:57:13,575 INFO L796 eck$LassoCheckResult]: Loop: 53#L633-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 55#L636 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 61#L636-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 53#L633-2 [2019-01-01 22:57:13,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:13,575 INFO L82 PathProgramCache]: Analyzing trace with hash 925733, now seen corresponding path program 1 times [2019-01-01 22:57:13,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:13,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:13,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:13,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:13,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:13,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:13,599 INFO L82 PathProgramCache]: Analyzing trace with hash 49877, now seen corresponding path program 1 times [2019-01-01 22:57:13,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:13,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:13,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:13,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:13,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:13,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:13,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1808728113, now seen corresponding path program 1 times [2019-01-01 22:57:13,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:13,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:13,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:13,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:13,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:14,433 WARN L181 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2019-01-01 22:57:14,478 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:57:14,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:57:14,711 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:57:14,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:57:14,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 22:57:14,879 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:157, output treesize:133 [2019-01-01 22:57:15,186 WARN L181 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-01 22:57:15,316 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:57:15,317 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:57:15,317 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:57:15,318 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:57:15,318 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:57:15,318 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:57:15,318 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:57:15,318 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:57:15,318 INFO L131 ssoRankerPreferences]: Filename of dumped script: simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i_Iteration2_Lasso [2019-01-01 22:57:15,319 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:57:15,319 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:57:15,342 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-01 22:57:15,349 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-01 22:57:15,352 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-01 22:57:15,366 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-01 22:57:15,372 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-01 22:57:15,377 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-01 22:57:15,657 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-01 22:57:15,657 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-01 22:57:15,660 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-01 22:57:15,664 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-01 22:57:15,667 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-01 22:57:15,675 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-01 22:57:15,677 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-01 22:57:15,678 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-01 22:57:15,686 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-01 22:57:15,690 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-01 22:57:15,707 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-01 22:57:16,320 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:57:16,325 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:57:16,328 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-01 22:57:16,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:16,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:57:16,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:16,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:16,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:16,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:57:16,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:57:16,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:16,337 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-01 22:57:16,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:16,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:57:16,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:16,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:16,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:16,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:57:16,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:57:16,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:16,342 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-01 22:57:16,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:16,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:57:16,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:16,344 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:57:16,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:16,347 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:57:16,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:57:16,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:16,360 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-01 22:57:16,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:16,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:16,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:16,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:16,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:57:16,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:57:16,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:16,371 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-01 22:57:16,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:16,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:57:16,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:16,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:16,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:16,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:57:16,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:57:16,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:16,375 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-01 22:57:16,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:16,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:16,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:16,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:16,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:57:16,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:57:16,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:16,420 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-01 22:57:16,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:16,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:16,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:16,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:16,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:57:16,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:57:16,457 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:57:16,472 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:57:16,472 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:57:16,478 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:57:16,480 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:57:16,480 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:57:16,481 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 59 Supporting invariants [] [2019-01-01 22:57:16,492 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-01-01 22:57:16,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:16,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:57:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:16,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:57:16,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:57:16,604 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:57:16,605 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 22:57:16,662 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 7 states. [2019-01-01 22:57:16,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 22:57:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:57:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-01 22:57:16,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 22:57:16,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:57:16,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 22:57:16,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:57:16,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-01 22:57:16,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:57:16,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-01-01 22:57:16,672 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-01-01 22:57:16,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 21 transitions. [2019-01-01 22:57:16,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 22:57:16,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 22:57:16,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-01-01 22:57:16,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:57:16,674 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-01-01 22:57:16,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-01-01 22:57:16,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-01 22:57:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 22:57:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-01-01 22:57:16,677 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-01-01 22:57:16,677 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-01-01 22:57:16,677 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:57:16,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-01-01 22:57:16,678 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-01-01 22:57:16,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:16,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:16,679 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:57:16,679 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:57:16,680 INFO L794 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 147#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 145#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 146#L629-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 139#L633-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1; 140#L633-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 135#L645-2 [2019-01-01 22:57:16,680 INFO L796 eck$LassoCheckResult]: Loop: 135#L645-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 137#L646 assume !(1 != main_#t~mem5);havoc main_#t~mem5; 134#L646-2 call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 135#L645-2 [2019-01-01 22:57:16,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:16,681 INFO L82 PathProgramCache]: Analyzing trace with hash 889630004, now seen corresponding path program 1 times [2019-01-01 22:57:16,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:16,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:16,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:16,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:16,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:16,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:16,704 INFO L82 PathProgramCache]: Analyzing trace with hash 71723, now seen corresponding path program 1 times [2019-01-01 22:57:16,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:16,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:16,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:16,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:16,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:16,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:16,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1275692520, now seen corresponding path program 1 times [2019-01-01 22:57:16,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:16,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:16,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:16,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:16,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:16,793 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-01 22:57:16,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:57:16,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 22:57:17,080 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-01 22:57:17,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 22:57:17,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 22:57:17,081 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-01-01 22:57:17,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:57:17,221 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-01-01 22:57:17,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 22:57:17,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2019-01-01 22:57:17,226 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6 [2019-01-01 22:57:17,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 35 transitions. [2019-01-01 22:57:17,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-01 22:57:17,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-01 22:57:17,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2019-01-01 22:57:17,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:57:17,229 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-01-01 22:57:17,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2019-01-01 22:57:17,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2019-01-01 22:57:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 22:57:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-01-01 22:57:17,233 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-01-01 22:57:17,233 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-01-01 22:57:17,233 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:57:17,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2019-01-01 22:57:17,234 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-01-01 22:57:17,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:17,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:17,235 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:57:17,235 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 22:57:17,235 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 208#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 206#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 207#L629-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 199#L633-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 202#L636 assume main_~t~0.base == 0 && main_~t~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 205#L621-1 [2019-01-01 22:57:17,236 INFO L796 eck$LassoCheckResult]: Loop: 205#L621-1 assume true; 205#L621-1 [2019-01-01 22:57:17,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:17,236 INFO L82 PathProgramCache]: Analyzing trace with hash 889630056, now seen corresponding path program 1 times [2019-01-01 22:57:17,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:17,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:17,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:17,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:17,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:17,272 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-01 22:57:17,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:57:17,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:57:17,272 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:57:17,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:17,273 INFO L82 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 1 times [2019-01-01 22:57:17,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:17,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:17,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:17,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:17,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:17,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:57:17,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:57:17,290 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 22:57:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:57:17,304 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-01-01 22:57:17,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:57:17,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-01-01 22:57:17,306 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-01-01 22:57:17,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 21 transitions. [2019-01-01 22:57:17,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-01 22:57:17,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-01 22:57:17,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-01-01 22:57:17,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:57:17,309 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-01 22:57:17,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-01-01 22:57:17,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-01-01 22:57:17,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 22:57:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-01-01 22:57:17,313 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-01 22:57:17,313 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-01 22:57:17,313 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:57:17,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-01-01 22:57:17,314 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 22:57:17,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:17,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:17,316 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:57:17,316 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 22:57:17,316 INFO L794 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 249#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 247#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 248#L629-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 242#L633-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1; 243#L633-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 239#L645-2 assume !(main_~p~0.base != 0 || main_~p~0.offset != 0); 240#L645-3 main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; 241#L654-2 [2019-01-01 22:57:17,316 INFO L796 eck$LassoCheckResult]: Loop: 241#L654-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;call ULTIMATE.dealloc(main_~p~0.base, main_~p~0.offset);main_~p~0.base, main_~p~0.offset := main_~tmp~0.base, main_~tmp~0.offset; 241#L654-2 [2019-01-01 22:57:17,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:17,317 INFO L82 PathProgramCache]: Analyzing trace with hash 235943235, now seen corresponding path program 1 times [2019-01-01 22:57:17,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:17,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:17,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:17,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:17,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:17,369 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-01 22:57:17,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:57:17,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:57:17,369 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:57:17,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:17,370 INFO L82 PathProgramCache]: Analyzing trace with hash 95, now seen corresponding path program 1 times [2019-01-01 22:57:17,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:17,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:17,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:17,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:17,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:17,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:57:17,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:57:17,470 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-01 22:57:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:57:17,522 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-01-01 22:57:17,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:57:17,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2019-01-01 22:57:17,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 22:57:17,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 22 transitions. [2019-01-01 22:57:17,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-01 22:57:17,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-01 22:57:17,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-01-01 22:57:17,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:57:17,526 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-01 22:57:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-01-01 22:57:17,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-01-01 22:57:17,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 22:57:17,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-01-01 22:57:17,530 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-01 22:57:17,530 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-01 22:57:17,530 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:57:17,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-01-01 22:57:17,532 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 22:57:17,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:17,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:17,533 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:57:17,533 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:57:17,533 INFO L794 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 296#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 294#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 295#L629-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 290#L633-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 291#L636 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 298#L636-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 292#L633-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1; 293#L633-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 286#L645-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 287#L646 [2019-01-01 22:57:17,535 INFO L796 eck$LassoCheckResult]: Loop: 287#L646 assume !(1 != main_#t~mem5);havoc main_#t~mem5; 284#L646-2 call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 285#L645-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 287#L646 [2019-01-01 22:57:17,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:17,536 INFO L82 PathProgramCache]: Analyzing trace with hash -840462870, now seen corresponding path program 1 times [2019-01-01 22:57:17,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:17,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:17,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:17,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:17,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:17,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:17,575 INFO L82 PathProgramCache]: Analyzing trace with hash 78503, now seen corresponding path program 2 times [2019-01-01 22:57:17,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:17,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:17,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:17,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:17,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:17,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:17,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1430024222, now seen corresponding path program 1 times [2019-01-01 22:57:17,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:17,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:17,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:17,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:57:17,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:17,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:57:17,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:57:17,790 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:57:17,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:17,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:57:18,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:57:18,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:57:18,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 22:57:18,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:18,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 22:57:18,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 22:57:18,295 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:18,300 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:18,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:18,311 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-01-01 22:57:18,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-01-01 22:57:18,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:57:18,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-01 22:57:18,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:18,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:18,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:18,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:18 [2019-01-01 22:57:18,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-01 22:57:18,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2019-01-01 22:57:18,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:57:18,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-01 22:57:18,504 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:18,512 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:18,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:18,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:18,530 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:40, output treesize:14 [2019-01-01 22:57:18,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 22:57:18,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-01 22:57:18,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:18,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:18,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:18,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-01-01 22:57:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:57:18,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:57:18,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-01-01 22:57:18,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 22:57:18,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-01-01 22:57:18,694 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 14 states. [2019-01-01 22:57:19,134 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2019-01-01 22:57:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:57:19,406 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-01-01 22:57:19,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 22:57:19,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-01-01 22:57:19,408 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 22:57:19,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 25 transitions. [2019-01-01 22:57:19,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-01 22:57:19,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-01 22:57:19,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2019-01-01 22:57:19,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:57:19,410 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-01-01 22:57:19,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2019-01-01 22:57:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-01-01 22:57:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 22:57:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-01-01 22:57:19,414 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-01-01 22:57:19,414 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-01-01 22:57:19,414 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:57:19,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-01-01 22:57:19,416 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 22:57:19,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:19,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:19,417 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:57:19,417 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:57:19,417 INFO L794 eck$LassoCheckResult]: Stem: 406#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 405#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 403#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 404#L629-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 398#L633-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 399#L636 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 407#L636-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 400#L633-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 401#L636 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 409#L636-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 408#L633-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1; 402#L633-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 394#L645-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 395#L646 [2019-01-01 22:57:19,417 INFO L796 eck$LassoCheckResult]: Loop: 395#L646 assume !(1 != main_#t~mem5);havoc main_#t~mem5; 392#L646-2 call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 393#L645-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 395#L646 [2019-01-01 22:57:19,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:19,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1481323766, now seen corresponding path program 2 times [2019-01-01 22:57:19,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:19,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:19,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:19,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:19,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:19,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:19,471 INFO L82 PathProgramCache]: Analyzing trace with hash 78503, now seen corresponding path program 3 times [2019-01-01 22:57:19,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:19,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:19,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:19,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:57:19,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:19,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:19,482 INFO L82 PathProgramCache]: Analyzing trace with hash -672604782, now seen corresponding path program 2 times [2019-01-01 22:57:19,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:19,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:19,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:19,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:57:19,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:57:19,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:57:19,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:57:19,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:57:19,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 22:57:19,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:57:19,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:57:19,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 22:57:19,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:19,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:19,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 22:57:20,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:57:20,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:57:20,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 22:57:20,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 22:57:20,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 22:57:20,045 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,047 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,056 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-01-01 22:57:20,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-01-01 22:57:20,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:57:20,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-01 22:57:20,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2019-01-01 22:57:20,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:57:20,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:57:20,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 22:57:20,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2019-01-01 22:57:20,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 22:57:20,183 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,192 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,206 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:39, output treesize:22 [2019-01-01 22:57:20,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2019-01-01 22:57:20,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-01-01 22:57:20,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:18 [2019-01-01 22:57:20,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2019-01-01 22:57:20,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-01 22:57:20,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2019-01-01 22:57:20,322 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,324 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,340 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:33, output treesize:11 [2019-01-01 22:57:20,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 22:57:20,362 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 22:57:20,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-01 22:57:20,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:57:20,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-01-01 22:57:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:57:20,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:57:20,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-01-01 22:57:20,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 22:57:20,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-01-01 22:57:20,492 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 5 Second operand 17 states. [2019-01-01 22:57:20,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:57:20,747 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-01 22:57:20,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 22:57:20,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 16 transitions. [2019-01-01 22:57:20,749 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:57:20,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2019-01-01 22:57:20,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:57:20,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:57:20,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:57:20,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:57:20,750 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:57:20,750 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:57:20,750 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:57:20,750 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:57:20,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:57:20,750 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:57:20,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:57:20,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:57:20 BoogieIcfgContainer [2019-01-01 22:57:20,757 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:57:20,757 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:57:20,758 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:57:20,758 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:57:20,758 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:57:13" (3/4) ... [2019-01-01 22:57:20,762 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:57:20,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:57:20,763 INFO L168 Benchmark]: Toolchain (without parser) took 9012.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.4 MB). Free memory was 952.7 MB in the beginning and 953.4 MB in the end (delta: -703.3 kB). Peak memory consumption was 212.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:20,764 INFO L168 Benchmark]: CDTParser took 0.18 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-01 22:57:20,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 677.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:20,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.22 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-01 22:57:20,766 INFO L168 Benchmark]: Boogie Preprocessor took 62.77 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-01 22:57:20,767 INFO L168 Benchmark]: RCFGBuilder took 539.10 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:20,767 INFO L168 Benchmark]: BuchiAutomizer took 7654.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 953.4 MB in the end (delta: 133.3 MB). Peak memory consumption was 207.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:20,768 INFO L168 Benchmark]: Witness Printer took 5.08 ms. Allocated memory is still 1.2 GB. Free memory is still 953.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:57:20,772 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.18 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 677.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.22 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. * Boogie Preprocessor took 62.77 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 539.10 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7654.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 953.4 MB in the end (delta: 133.3 MB). Peak memory consumption was 207.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.08 ms. Allocated memory is still 1.2 GB. Free memory is still 953.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (6 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 59 and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 5.9s. Construction of modules took 0.5s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 67 SDtfs, 132 SDslu, 66 SDs, 0 SdLazy, 273 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN2 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital188 mio100 ax100 hnf100 lsp94 ukn50 mio100 lsp31 div100 bol100 ite100 ukn100 eq185 hnf92 smp100 dnf170 smp100 tf100 neg95 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms 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: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...