./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loop-new/nested_true-unreach-call_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/loop-new/nested_true-unreach-call_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 a881e1073186594f4727f809fbe5d917ff145543 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 23:10:49,057 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:10:49,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:10:49,071 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:10:49,071 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:10:49,072 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:10:49,073 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:10:49,076 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:10:49,078 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:10:49,078 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:10:49,079 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:10:49,080 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:10:49,081 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:10:49,082 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:10:49,083 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:10:49,088 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:10:49,089 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:10:49,091 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:10:49,096 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:10:49,102 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:10:49,106 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:10:49,108 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:10:49,113 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:10:49,115 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:10:49,115 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:10:49,116 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:10:49,117 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:10:49,118 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:10:49,119 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:10:49,120 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:10:49,120 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:10:49,121 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:10:49,121 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:10:49,121 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:10:49,122 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:10:49,123 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:10:49,124 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:10:49,155 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:10:49,158 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:10:49,159 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:10:49,159 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:10:49,160 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:10:49,160 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:10:49,160 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:10:49,160 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:10:49,160 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:10:49,163 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:10:49,163 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:10:49,163 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:10:49,164 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:10:49,164 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:10:49,164 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:10:49,164 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:10:49,164 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:10:49,165 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:10:49,165 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:10:49,165 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:10:49,165 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:10:49,165 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:10:49,165 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:10:49,168 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:10:49,168 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:10:49,168 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:10:49,168 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:10:49,169 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:10:49,169 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:10:49,169 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:10:49,169 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:10:49,170 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:10:49,170 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 -> a881e1073186594f4727f809fbe5d917ff145543 [2019-01-01 23:10:49,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:10:49,242 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:10:49,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:10:49,252 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:10:49,253 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:10:49,253 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-new/nested_true-unreach-call_true-termination.i [2019-01-01 23:10:49,322 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d039c708/ad6940c1c4b947099285ecadc7bb4113/FLAGf32143037 [2019-01-01 23:10:49,760 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:10:49,761 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-new/nested_true-unreach-call_true-termination.i [2019-01-01 23:10:49,768 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d039c708/ad6940c1c4b947099285ecadc7bb4113/FLAGf32143037 [2019-01-01 23:10:50,115 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d039c708/ad6940c1c4b947099285ecadc7bb4113 [2019-01-01 23:10:50,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:10:50,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:10:50,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:10:50,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:10:50,128 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:10:50,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:10:50" (1/1) ... [2019-01-01 23:10:50,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d4e13c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:10:50, skipping insertion in model container [2019-01-01 23:10:50,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:10:50" (1/1) ... [2019-01-01 23:10:50,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:10:50,167 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:10:50,425 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:10:50,433 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:10:50,459 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:10:50,481 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:10:50,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:10:50 WrapperNode [2019-01-01 23:10:50,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:10:50,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:10:50,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:10:50,483 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:10:50,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:10:50" (1/1) ... [2019-01-01 23:10:50,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:10:50" (1/1) ... [2019-01-01 23:10:50,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:10:50,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:10:50,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:10:50,523 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:10:50,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:10:50" (1/1) ... [2019-01-01 23:10:50,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:10:50" (1/1) ... [2019-01-01 23:10:50,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:10:50" (1/1) ... [2019-01-01 23:10:50,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:10:50" (1/1) ... [2019-01-01 23:10:50,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:10:50" (1/1) ... [2019-01-01 23:10:50,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:10:50" (1/1) ... [2019-01-01 23:10:50,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:10:50" (1/1) ... [2019-01-01 23:10:50,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:10:50,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:10:50,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:10:50,550 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:10:50,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:10:50" (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 23:10:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:10:50,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:10:50,990 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:10:50,990 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 23:10:50,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:10:50 BoogieIcfgContainer [2019-01-01 23:10:50,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:10:50,997 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:10:50,997 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:10:51,005 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:10:51,007 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:10:51,008 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:10:50" (1/3) ... [2019-01-01 23:10:51,009 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@428e0c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:10:51, skipping insertion in model container [2019-01-01 23:10:51,009 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:10:51,009 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:10:50" (2/3) ... [2019-01-01 23:10:51,010 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@428e0c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:10:51, skipping insertion in model container [2019-01-01 23:10:51,010 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:10:51,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:10:50" (3/3) ... [2019-01-01 23:10:51,012 INFO L375 chiAutomizerObserver]: Analyzing ICFG nested_true-unreach-call_true-termination.i [2019-01-01 23:10:51,094 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:10:51,095 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:10:51,095 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:10:51,095 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:10:51,096 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:10:51,096 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:10:51,096 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:10:51,096 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:10:51,097 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:10:51,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 23:10:51,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 23:10:51,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:10:51,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:10:51,145 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 23:10:51,145 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:10:51,145 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:10:51,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 23:10:51,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 23:10:51,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:10:51,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:10:51,149 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 23:10:51,149 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:10:51,157 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post5, main_#t~post4, main_#t~post3, main_~n~0, main_~m~0, main_~k~0, main_~i~0, main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~k~0 := 0;havoc main_~i~0;havoc main_~j~0; 3#L15true assume !!(10 <= main_~n~0 && main_~n~0 <= 10000); 7#L16true assume !!(10 <= main_~m~0 && main_~m~0 <= 10000);main_~i~0 := 0; 15#L17-3true [2019-01-01 23:10:51,158 INFO L796 eck$LassoCheckResult]: Loop: 15#L17-3true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 4#L18-3true assume !(main_~j~0 < main_~m~0); 5#L17-2true main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 15#L17-3true [2019-01-01 23:10:51,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:10:51,165 INFO L82 PathProgramCache]: Analyzing trace with hash 30949, now seen corresponding path program 1 times [2019-01-01 23:10:51,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:10:51,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:10:51,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:10:51,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:10:51,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:10:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:10:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:10:51,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:10:51,283 INFO L82 PathProgramCache]: Analyzing trace with hash 48858, now seen corresponding path program 1 times [2019-01-01 23:10:51,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:10:51,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:10:51,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:10:51,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:10:51,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:10:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:10:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:10:51,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:10:51,308 INFO L82 PathProgramCache]: Analyzing trace with hash 922020726, now seen corresponding path program 1 times [2019-01-01 23:10:51,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:10:51,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:10:51,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:10:51,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:10:51,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:10:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:10:51,419 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 23:10:51,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:10:51,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:10:51,499 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:10:51,500 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:10:51,500 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:10:51,501 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:10:51,501 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:10:51,501 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:10:51,501 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:10:51,502 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:10:51,502 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested_true-unreach-call_true-termination.i_Iteration1_Loop [2019-01-01 23:10:51,502 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:10:51,502 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:10:51,527 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 23:10:51,566 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 23:10:51,611 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 23:10:51,753 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:10:51,754 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:10:51,766 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:10:51,766 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:10:51,786 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:10:51,786 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:10:51,812 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:10:51,812 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:10:51,837 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:10:51,838 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:10:51,967 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:10:51,969 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:10:51,969 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:10:51,969 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:10:51,969 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:10:51,970 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:10:51,970 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:10:51,970 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:10:51,970 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:10:51,970 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested_true-unreach-call_true-termination.i_Iteration1_Loop [2019-01-01 23:10:51,970 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:10:51,970 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:10:51,972 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 23:10:52,038 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 23:10:52,128 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 23:10:52,308 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:10:52,313 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:10:52,315 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 23:10:52,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:10:52,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:10:52,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:10:52,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:10:52,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:10:52,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:10:52,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:10:52,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:10:52,325 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 23:10:52,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:10:52,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:10:52,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:10:52,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:10:52,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:10:52,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:10:52,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:10:52,335 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:10:52,348 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:10:52,348 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:10:52,352 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:10:52,352 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:10:52,353 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:10:52,353 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-01 23:10:52,355 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:10:52,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:10:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:10:52,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:10:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:10:52,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:10:52,531 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 23:10:52,546 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 23:10:52,548 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-01-01 23:10:52,611 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 40 states and 55 transitions. Complement of second has 7 states. [2019-01-01 23:10:52,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:10:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:10:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2019-01-01 23:10:52,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-01 23:10:52,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:10:52,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 23:10:52,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:10:52,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-01 23:10:52,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:10:52,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 55 transitions. [2019-01-01 23:10:52,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 23:10:52,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 11 states and 14 transitions. [2019-01-01 23:10:52,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 23:10:52,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 23:10:52,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-01-01 23:10:52,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:10:52,631 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 23:10:52,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-01-01 23:10:52,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-01 23:10:52,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 23:10:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-01 23:10:52,658 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 23:10:52,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 23:10:52,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 23:10:52,663 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 4 states. [2019-01-01 23:10:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:10:52,856 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-01-01 23:10:52,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 23:10:52,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-01-01 23:10:52,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 23:10:52,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 17 transitions. [2019-01-01 23:10:52,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 23:10:52,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 23:10:52,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-01-01 23:10:52,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:10:52,861 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-01 23:10:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-01-01 23:10:52,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2019-01-01 23:10:52,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 23:10:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-01 23:10:52,863 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 23:10:52,863 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 23:10:52,864 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:10:52,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-01-01 23:10:52,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 23:10:52,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:10:52,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:10:52,866 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 23:10:52,867 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 23:10:52,867 INFO L794 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post5, main_#t~post4, main_#t~post3, main_~n~0, main_~m~0, main_~k~0, main_~i~0, main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~k~0 := 0;havoc main_~i~0;havoc main_~j~0; 127#L15 assume !!(10 <= main_~n~0 && main_~n~0 <= 10000); 128#L16 assume !!(10 <= main_~m~0 && main_~m~0 <= 10000);main_~i~0 := 0; 136#L17-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 129#L18-3 [2019-01-01 23:10:52,867 INFO L796 eck$LassoCheckResult]: Loop: 129#L18-3 assume !!(main_~j~0 < main_~m~0);main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5; 130#L18-2 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 129#L18-3 [2019-01-01 23:10:52,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:10:52,867 INFO L82 PathProgramCache]: Analyzing trace with hash 959438, now seen corresponding path program 1 times [2019-01-01 23:10:52,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:10:52,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:10:52,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:10:52,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:10:52,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:10:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:10:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:10:52,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:10:52,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 1 times [2019-01-01 23:10:52,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:10:52,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:10:52,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:10:52,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:10:52,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:10:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:10:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:10:52,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:10:52,889 INFO L82 PathProgramCache]: Analyzing trace with hash 922020784, now seen corresponding path program 1 times [2019-01-01 23:10:52,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:10:52,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:10:52,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:10:52,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:10:52,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:10:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:10:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:10:52,937 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:10:52,937 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:10:52,937 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:10:52,938 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:10:52,938 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:10:52,938 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:10:52,938 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:10:52,938 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:10:52,938 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested_true-unreach-call_true-termination.i_Iteration2_Loop [2019-01-01 23:10:52,939 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:10:52,939 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:10:52,940 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 23:10:52,950 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 23:10:52,953 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 23:10:52,959 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 23:10:53,036 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:10:53,036 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:10:53,047 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:10:53,048 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:10:53,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:10:53,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:10:53,225 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:10:53,226 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:10:53,227 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:10:53,227 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:10:53,227 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:10:53,227 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:10:53,227 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:10:53,227 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:10:53,229 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:10:53,229 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested_true-unreach-call_true-termination.i_Iteration2_Loop [2019-01-01 23:10:53,229 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:10:53,229 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:10:53,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:10:53,240 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 23:10:53,243 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 23:10:53,249 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 23:10:53,350 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:10:53,350 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:10:53,351 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 23:10:53,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:10:53,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:10:53,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:10:53,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:10:53,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:10:53,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:10:53,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:10:53,360 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:10:53,366 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:10:53,367 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:10:53,367 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:10:53,367 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:10:53,368 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:10:53,368 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~m~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-01-01 23:10:53,368 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:10:53,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:10:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:10:53,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:10:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:10:53,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:10:53,836 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 23:10:53,836 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 23:10:53,836 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 23:10:53,882 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 7 states. [2019-01-01 23:10:53,885 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 23:10:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:10:53,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-01 23:10:53,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 23:10:53,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:10:53,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 23:10:53,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:10:53,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 23:10:53,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:10:53,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-01 23:10:53,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 23:10:53,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 16 states and 20 transitions. [2019-01-01 23:10:53,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 23:10:53,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 23:10:53,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-01-01 23:10:53,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:10:53,890 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-01 23:10:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-01-01 23:10:53,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-01-01 23:10:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 23:10:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-01-01 23:10:53,892 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-01 23:10:53,892 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-01 23:10:53,893 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:10:53,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2019-01-01 23:10:53,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 23:10:53,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:10:53,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:10:53,894 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:10:53,894 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 23:10:53,895 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~post5, main_#t~post4, main_#t~post3, main_~n~0, main_~m~0, main_~k~0, main_~i~0, main_~j~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~k~0 := 0;havoc main_~i~0;havoc main_~j~0; 209#L15 assume !!(10 <= main_~n~0 && main_~n~0 <= 10000); 210#L16 assume !!(10 <= main_~m~0 && main_~m~0 <= 10000);main_~i~0 := 0; 213#L17-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 207#L18-3 assume !!(main_~j~0 < main_~m~0);main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5; 208#L18-2 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 211#L18-3 assume !(main_~j~0 < main_~m~0); 203#L17-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 204#L17-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 205#L18-3 [2019-01-01 23:10:53,895 INFO L796 eck$LassoCheckResult]: Loop: 205#L18-3 assume !!(main_~j~0 < main_~m~0);main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5; 206#L18-2 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 205#L18-3 [2019-01-01 23:10:53,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:10:53,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1605343291, now seen corresponding path program 1 times [2019-01-01 23:10:53,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:10:53,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:10:53,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:10:53,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:10:53,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:10:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:10:53,955 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 23:10:53,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:10:53,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:10:53,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:10:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:10:53,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:10:54,113 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 23:10:54,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:10:54,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-01 23:10:54,145 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:10:54,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:10:54,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 2 times [2019-01-01 23:10:54,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:10:54,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:10:54,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:10:54,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:10:54,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:10:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:10:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:10:54,202 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:10:54,202 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:10:54,202 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:10:54,202 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:10:54,202 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:10:54,202 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:10:54,203 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:10:54,203 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:10:54,203 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested_true-unreach-call_true-termination.i_Iteration3_Loop [2019-01-01 23:10:54,203 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:10:54,203 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:10:54,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:10:54,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:10:54,216 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 23:10:54,223 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 23:10:54,275 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:10:54,276 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:10:54,282 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:10:54,282 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:10:54,307 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:10:54,307 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:10:54,446 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:10:54,448 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:10:54,449 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:10:54,449 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:10:54,449 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:10:54,449 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:10:54,449 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:10:54,449 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:10:54,449 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:10:54,451 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested_true-unreach-call_true-termination.i_Iteration3_Loop [2019-01-01 23:10:54,451 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:10:54,451 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:10:54,452 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 23:10:54,466 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 23:10:54,468 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 23:10:54,472 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 23:10:54,566 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:10:54,567 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:10:54,567 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 23:10:54,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:10:54,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:10:54,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:10:54,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:10:54,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:10:54,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:10:54,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:10:54,574 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:10:54,579 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:10:54,579 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:10:54,580 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:10:54,580 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:10:54,580 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:10:54,580 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~m~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-01-01 23:10:54,581 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:10:54,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:10:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:10:54,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:10:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:10:54,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:10:54,690 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 23:10:54,691 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 23:10:54,691 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-01 23:10:54,713 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 24 transitions. Complement of second has 7 states. [2019-01-01 23:10:54,714 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 23:10:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:10:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-01 23:10:54,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 23:10:54,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:10:54,716 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:10:54,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:10:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:10:54,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:10:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:10:54,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:10:54,837 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 23:10:54,838 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 23:10:54,838 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-01 23:10:54,860 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 24 transitions. Complement of second has 7 states. [2019-01-01 23:10:54,862 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 23:10:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:10:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-01 23:10:54,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 23:10:54,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:10:54,863 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:10:54,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:10:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:10:54,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:10:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:10:54,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:10:54,917 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 23:10:54,917 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 23:10:54,918 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-01 23:10:54,950 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 6 states. [2019-01-01 23:10:54,950 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 23:10:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:10:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-01 23:10:54,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 23:10:54,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:10:54,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 23:10:54,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:10:54,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-01 23:10:54,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:10:54,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-01-01 23:10:54,954 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:10:54,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2019-01-01 23:10:54,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:10:54,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:10:54,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:10:54,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:10:54,954 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:10:54,954 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:10:54,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 23:10:54,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 23:10:54,957 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 7 states. [2019-01-01 23:10:54,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:10:54,957 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:10:54,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:10:54,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:10:54,958 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:10:54,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:10:54,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:10:54,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:10:54,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:10:54,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:10:54,959 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:10:54,959 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:10:54,959 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:10:54,959 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:10:54,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:10:54,959 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:10:54,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:10:54,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:10:54 BoogieIcfgContainer [2019-01-01 23:10:54,968 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:10:54,969 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:10:54,969 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:10:54,969 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:10:54,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:10:50" (3/4) ... [2019-01-01 23:10:54,974 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:10:54,974 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:10:54,975 INFO L168 Benchmark]: Toolchain (without parser) took 4854.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 947.3 MB in the beginning and 882.9 MB in the end (delta: 64.5 MB). Peak memory consumption was 168.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:10:54,977 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:10:54,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.01 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:10:54,980 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.90 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:10:54,980 INFO L168 Benchmark]: Boogie Preprocessor took 26.34 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:10:54,981 INFO L168 Benchmark]: RCFGBuilder took 441.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:10:54,982 INFO L168 Benchmark]: BuchiAutomizer took 3971.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 882.9 MB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:10:54,982 INFO L168 Benchmark]: Witness Printer took 5.26 ms. Allocated memory is still 1.1 GB. Free memory is still 882.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:10:54,987 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.01 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.90 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.34 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 441.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3971.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 882.9 MB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.26 ms. Allocated memory is still 1.1 GB. Free memory is still 882.9 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function m + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function m + -1 * j and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 50 SDslu, 25 SDs, 0 SdLazy, 46 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf98 lsp65 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...