./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/NO_04_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-restricted-15/NO_04_false-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8d3fb7268073fcc251f9902f5b4913f30f169781 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:39:27,083 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:39:27,085 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:39:27,097 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:39:27,098 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:39:27,099 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:39:27,100 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:39:27,102 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:39:27,104 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:39:27,105 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:39:27,106 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:39:27,106 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:39:27,107 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:39:27,108 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:39:27,110 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:39:27,111 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:39:27,112 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:39:27,114 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:39:27,116 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:39:27,118 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:39:27,119 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:39:27,121 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:39:27,123 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:39:27,124 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:39:27,124 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:39:27,125 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:39:27,126 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:39:27,127 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:39:27,128 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:39:27,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:39:27,130 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:39:27,131 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:39:27,131 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:39:27,131 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:39:27,133 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:39:27,133 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:39:27,134 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:39:27,166 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:39:27,167 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:39:27,168 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:39:27,168 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:39:27,168 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:39:27,169 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:39:27,169 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:39:27,169 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:39:27,169 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:39:27,169 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:39:27,170 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:39:27,175 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:39:27,175 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:39:27,175 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:39:27,175 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:39:27,175 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:39:27,175 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:39:27,176 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:39:27,176 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:39:27,176 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:39:27,176 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:39:27,176 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:39:27,177 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:39:27,179 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:39:27,179 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:39:27,179 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:39:27,179 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:39:27,179 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:39:27,180 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:39:27,181 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d3fb7268073fcc251f9902f5b4913f30f169781 [2019-01-01 21:39:27,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:39:27,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:39:27,255 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:39:27,256 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:39:27,257 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:39:27,258 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/NO_04_false-termination_true-no-overflow.c [2019-01-01 21:39:27,325 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f02746f0/0bc2a15182754b2990cbd7469ed3dd7c/FLAGf8fc5d215 [2019-01-01 21:39:27,816 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:39:27,817 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/NO_04_false-termination_true-no-overflow.c [2019-01-01 21:39:27,824 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f02746f0/0bc2a15182754b2990cbd7469ed3dd7c/FLAGf8fc5d215 [2019-01-01 21:39:28,188 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f02746f0/0bc2a15182754b2990cbd7469ed3dd7c [2019-01-01 21:39:28,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:39:28,193 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:39:28,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:39:28,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:39:28,197 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:39:28,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:39:28" (1/1) ... [2019-01-01 21:39:28,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f9b7a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:28, skipping insertion in model container [2019-01-01 21:39:28,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:39:28" (1/1) ... [2019-01-01 21:39:28,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:39:28,228 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:39:28,450 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:39:28,456 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:39:28,489 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:39:28,507 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:39:28,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:28 WrapperNode [2019-01-01 21:39:28,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:39:28,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:39:28,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:39:28,510 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:39:28,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:28" (1/1) ... [2019-01-01 21:39:28,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:28" (1/1) ... [2019-01-01 21:39:28,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:39:28,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:39:28,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:39:28,544 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:39:28,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:28" (1/1) ... [2019-01-01 21:39:28,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:28" (1/1) ... [2019-01-01 21:39:28,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:28" (1/1) ... [2019-01-01 21:39:28,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:28" (1/1) ... [2019-01-01 21:39:28,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:28" (1/1) ... [2019-01-01 21:39:28,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:28" (1/1) ... [2019-01-01 21:39:28,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:28" (1/1) ... [2019-01-01 21:39:28,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:39:28,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:39:28,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:39:28,564 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:39:28,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:28" (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 21:39:28,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:39:28,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:39:28,991 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:39:28,991 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-01 21:39:28,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:39:28 BoogieIcfgContainer [2019-01-01 21:39:28,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:39:28,992 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:39:28,992 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:39:29,005 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:39:29,006 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:39:29,006 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:39:28" (1/3) ... [2019-01-01 21:39:29,007 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bc6a3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:39:29, skipping insertion in model container [2019-01-01 21:39:29,007 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:39:29,007 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:39:28" (2/3) ... [2019-01-01 21:39:29,008 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bc6a3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:39:29, skipping insertion in model container [2019-01-01 21:39:29,008 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:39:29,008 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:39:28" (3/3) ... [2019-01-01 21:39:29,014 INFO L375 chiAutomizerObserver]: Analyzing ICFG NO_04_false-termination_true-no-overflow.c [2019-01-01 21:39:29,081 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:39:29,081 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:39:29,082 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:39:29,082 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:39:29,082 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:39:29,082 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:39:29,082 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:39:29,082 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:39:29,083 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:39:29,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 21:39:29,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 21:39:29,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:29,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:29,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:39:29,130 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:39:29,130 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:39:29,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 21:39:29,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 21:39:29,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:29,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:29,133 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:39:29,133 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:39:29,142 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0, main_~l~0, main_~m~0, main_~a~0, main_~b~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~l~0;havoc main_~m~0;havoc main_~a~0;havoc main_~b~0;main_~i~0 := 0; 15#L15-2true [2019-01-01 21:39:29,142 INFO L796 eck$LassoCheckResult]: Loop: 15#L15-2true assume !!(main_~i~0 < 100);main_~a~0 := 2 + main_~i~0;main_~j~0 := 0; 5#L18-2true assume !(main_~j~0 < main_~a~0); 3#L18-3true main_~i~0 := 1 + main_~i~0; 15#L15-2true [2019-01-01 21:39:29,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:29,151 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:39:29,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:29,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:29,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:29,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:29,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:29,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:29,251 INFO L82 PathProgramCache]: Analyzing trace with hash 39990, now seen corresponding path program 1 times [2019-01-01 21:39:29,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:29,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:29,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:29,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:29,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:29,270 INFO L82 PathProgramCache]: Analyzing trace with hash 963511, now seen corresponding path program 1 times [2019-01-01 21:39:29,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:29,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:29,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:29,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:29,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:29,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 21:39:29,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:39:29,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:39:29,490 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:29,492 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:29,492 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:29,492 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:29,492 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:39:29,492 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:29,492 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:29,493 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:29,493 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_04_false-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:39:29,493 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:29,493 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:29,517 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 21:39:29,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:39:29,552 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 21:39:29,891 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 21:39:29,898 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:29,899 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 21:39:29,912 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:29,912 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 21:39:29,943 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:29,943 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} 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 21:39:29,949 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:29,950 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:29,973 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:39:29,973 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 21:39:29,979 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:39:29,980 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 21:39:30,009 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:39:30,010 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:39:30,350 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:39:30,352 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:39:30,352 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:39:30,352 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:39:30,352 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:39:30,353 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:39:30,353 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:39:30,353 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:39:30,353 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:39:30,353 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_04_false-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:39:30,353 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:39:30,353 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:39:30,358 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 21:39:30,374 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 21:39:30,381 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 21:39:30,619 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 21:39:30,620 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:39:30,625 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:39:30,627 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 21:39:30,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:30,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:30,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:30,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:30,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:30,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:30,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:30,642 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 21:39:30,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:30,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:30,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:30,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:30,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:39:30,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:39:30,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:39:30,657 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 21:39:30,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:39:30,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:39:30,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:39:30,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:39:30,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:39:30,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:39:30,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:39:30,674 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:39:30,682 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:39:30,682 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:39:30,685 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:39:30,685 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:39:30,685 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:39:30,686 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-01 21:39:30,689 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:39:30,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:30,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:30,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:30,877 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 21:39:30,892 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:39:30,894 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 4 states. [2019-01-01 21:39:31,147 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 4 states. Result 60 states and 102 transitions. Complement of second has 9 states. [2019-01-01 21:39:31,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:39:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:39:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2019-01-01 21:39:31,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 64 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-01 21:39:31,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:31,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 64 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 21:39:31,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:31,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 64 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-01 21:39:31,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:39:31,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 102 transitions. [2019-01-01 21:39:31,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-01-01 21:39:31,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 37 states and 54 transitions. [2019-01-01 21:39:31,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 21:39:31,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-01 21:39:31,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 54 transitions. [2019-01-01 21:39:31,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:39:31,172 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 54 transitions. [2019-01-01 21:39:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 54 transitions. [2019-01-01 21:39:31,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2019-01-01 21:39:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 21:39:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-01-01 21:39:31,207 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-01-01 21:39:31,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:39:31,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:39:31,211 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 4 states. [2019-01-01 21:39:31,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:31,301 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2019-01-01 21:39:31,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:39:31,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. [2019-01-01 21:39:31,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-01-01 21:39:31,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 18 states and 25 transitions. [2019-01-01 21:39:31,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 21:39:31,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-01 21:39:31,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-01 21:39:31,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:39:31,306 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 21:39:31,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-01 21:39:31,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 11. [2019-01-01 21:39:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:39:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-01-01 21:39:31,309 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-01 21:39:31,309 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-01 21:39:31,309 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:39:31,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-01-01 21:39:31,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 21:39:31,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:31,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:31,310 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:39:31,310 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:39:31,311 INFO L794 eck$LassoCheckResult]: Stem: 185#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0, main_~l~0, main_~m~0, main_~a~0, main_~b~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~l~0;havoc main_~m~0;havoc main_~a~0;havoc main_~b~0;main_~i~0 := 0; 181#L15-2 [2019-01-01 21:39:31,311 INFO L796 eck$LassoCheckResult]: Loop: 181#L15-2 assume !!(main_~i~0 < 100);main_~a~0 := 2 + main_~i~0;main_~j~0 := 0; 186#L18-2 assume !!(main_~j~0 < main_~a~0);main_~k~0 := 3 + (main_~i~0 + main_~j~0); 187#L20-2 assume !(main_~k~0 >= 0); 189#L20-3 main_~j~0 := 1 + main_~j~0; 190#L18-2 assume !(main_~j~0 < main_~a~0); 180#L18-3 main_~i~0 := 1 + main_~i~0; 181#L15-2 [2019-01-01 21:39:31,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:31,311 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-01 21:39:31,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:31,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:31,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:31,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:31,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:31,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:31,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1192172983, now seen corresponding path program 1 times [2019-01-01 21:39:31,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:31,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:31,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:31,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:31,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:31,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:39:31,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:39:31,431 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:39:31,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:39:31,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:39:31,432 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-01 21:39:31,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:31,803 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2019-01-01 21:39:31,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:39:31,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2019-01-01 21:39:31,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-01-01 21:39:31,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 23 transitions. [2019-01-01 21:39:31,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-01 21:39:31,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 21:39:31,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-01-01 21:39:31,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:39:31,807 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-01 21:39:31,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-01-01 21:39:31,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-01-01 21:39:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 21:39:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-01-01 21:39:31,810 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 21:39:31,810 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 21:39:31,811 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:39:31,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-01-01 21:39:31,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-01 21:39:31,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:31,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:31,815 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:39:31,819 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:39:31,819 INFO L794 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0, main_~l~0, main_~m~0, main_~a~0, main_~b~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~l~0;havoc main_~m~0;havoc main_~a~0;havoc main_~b~0;main_~i~0 := 0; 218#L15-2 [2019-01-01 21:39:31,820 INFO L796 eck$LassoCheckResult]: Loop: 218#L15-2 assume !!(main_~i~0 < 100);main_~a~0 := 2 + main_~i~0;main_~j~0 := 0; 223#L18-2 assume !!(main_~j~0 < main_~a~0);main_~k~0 := 3 + (main_~i~0 + main_~j~0); 224#L20-2 assume !!(main_~k~0 >= 0);main_~b~0 := 4 + (main_~i~0 + main_~j~0 + main_~k~0);main_~l~0 := 0; 219#L23-2 assume !(main_~l~0 < main_~b~0); 220#L23-3 main_~k~0 := main_~k~0 - 1; 228#L20-2 assume !(main_~k~0 >= 0); 226#L20-3 main_~j~0 := 1 + main_~j~0; 227#L18-2 assume !(main_~j~0 < main_~a~0); 217#L18-3 main_~i~0 := 1 + main_~i~0; 218#L15-2 [2019-01-01 21:39:31,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:31,820 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-01-01 21:39:31,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:31,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:31,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:31,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:31,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:31,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:31,830 INFO L82 PathProgramCache]: Analyzing trace with hash 2090456946, now seen corresponding path program 1 times [2019-01-01 21:39:31,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:31,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:31,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:31,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:31,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:31,881 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 21:39:31,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:39:31,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:39:31,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:31,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:32,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:32,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 21:39:32,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2019-01-01 21:39:32,046 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:39:32,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 21:39:32,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:39:32,046 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-01-01 21:39:32,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:32,393 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2019-01-01 21:39:32,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:39:32,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2019-01-01 21:39:32,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-01-01 21:39:32,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 34 transitions. [2019-01-01 21:39:32,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:39:32,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:39:32,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-01-01 21:39:32,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:39:32,397 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-01 21:39:32,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-01-01 21:39:32,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2019-01-01 21:39:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 21:39:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-01-01 21:39:32,401 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-01 21:39:32,401 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-01 21:39:32,401 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:39:32,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2019-01-01 21:39:32,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-01-01 21:39:32,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:32,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:32,403 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:39:32,403 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:39:32,403 INFO L794 eck$LassoCheckResult]: Stem: 300#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0, main_~l~0, main_~m~0, main_~a~0, main_~b~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~l~0;havoc main_~m~0;havoc main_~a~0;havoc main_~b~0;main_~i~0 := 0; 296#L15-2 [2019-01-01 21:39:32,403 INFO L796 eck$LassoCheckResult]: Loop: 296#L15-2 assume !!(main_~i~0 < 100);main_~a~0 := 2 + main_~i~0;main_~j~0 := 0; 301#L18-2 assume !!(main_~j~0 < main_~a~0);main_~k~0 := 3 + (main_~i~0 + main_~j~0); 302#L20-2 assume !!(main_~k~0 >= 0);main_~b~0 := 4 + (main_~i~0 + main_~j~0 + main_~k~0);main_~l~0 := 0; 312#L23-2 assume !!(main_~l~0 < main_~b~0);main_~m~0 := 1000 + (main_~i~0 + main_~j~0 + main_~k~0 + main_~l~0); 310#L25-2 assume !(main_~m~0 >= 0); 311#L25-3 main_~l~0 := 1 + main_~l~0; 309#L23-2 assume !(main_~l~0 < main_~b~0); 307#L23-3 main_~k~0 := main_~k~0 - 1; 306#L20-2 assume !!(main_~k~0 >= 0);main_~b~0 := 4 + (main_~i~0 + main_~j~0 + main_~k~0);main_~l~0 := 0; 297#L23-2 assume !(main_~l~0 < main_~b~0); 298#L23-3 main_~k~0 := main_~k~0 - 1; 308#L20-2 assume !(main_~k~0 >= 0); 304#L20-3 main_~j~0 := 1 + main_~j~0; 305#L18-2 assume !(main_~j~0 < main_~a~0); 295#L18-3 main_~i~0 := 1 + main_~i~0; 296#L15-2 [2019-01-01 21:39:32,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:32,404 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-01-01 21:39:32,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:32,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:32,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:32,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:32,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:32,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:32,409 INFO L82 PathProgramCache]: Analyzing trace with hash -552941264, now seen corresponding path program 1 times [2019-01-01 21:39:32,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:32,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:32,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:32,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:39:32,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:39:32,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:39:32,485 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 21:39:32,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:39:32,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:39:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 21:39:32,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 21:39:32,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2019-01-01 21:39:32,673 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:39:32,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 21:39:32,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-01-01 21:39:32,673 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. cyclomatic complexity: 7 Second operand 11 states. [2019-01-01 21:39:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:39:32,856 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-01 21:39:32,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:39:32,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 6 transitions. [2019-01-01 21:39:32,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:39:32,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 6 transitions. [2019-01-01 21:39:32,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:39:32,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:39:32,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2019-01-01 21:39:32,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:39:32,860 INFO L705 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-01 21:39:32,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2019-01-01 21:39:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-01 21:39:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:39:32,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-01 21:39:32,862 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-01 21:39:32,862 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-01 21:39:32,862 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:39:32,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2019-01-01 21:39:32,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:39:32,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:39:32,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:39:32,863 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:39:32,863 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:39:32,863 INFO L794 eck$LassoCheckResult]: Stem: 383#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0, main_~l~0, main_~m~0, main_~a~0, main_~b~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~l~0;havoc main_~m~0;havoc main_~a~0;havoc main_~b~0;main_~i~0 := 0; 384#L15-2 assume !!(main_~i~0 < 100);main_~a~0 := 2 + main_~i~0;main_~j~0 := 0; 385#L18-2 assume !!(main_~j~0 < main_~a~0);main_~k~0 := 3 + (main_~i~0 + main_~j~0); 386#L20-2 assume !!(main_~k~0 >= 0);main_~b~0 := 4 + (main_~i~0 + main_~j~0 + main_~k~0);main_~l~0 := 0; 381#L23-2 assume !!(main_~l~0 < main_~b~0);main_~m~0 := 1000 + (main_~i~0 + main_~j~0 + main_~k~0 + main_~l~0); 382#L25-2 [2019-01-01 21:39:32,864 INFO L796 eck$LassoCheckResult]: Loop: 382#L25-2 assume !!(main_~m~0 >= 0);main_~m~0 := main_~m~0 - 0; 382#L25-2 [2019-01-01 21:39:32,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:32,864 INFO L82 PathProgramCache]: Analyzing trace with hash 29869746, now seen corresponding path program 1 times [2019-01-01 21:39:32,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:32,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:32,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:32,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:32,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:32,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:32,877 INFO L82 PathProgramCache]: Analyzing trace with hash 77, now seen corresponding path program 1 times [2019-01-01 21:39:32,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:32,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:32,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:32,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:32,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:32,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:39:32,885 INFO L82 PathProgramCache]: Analyzing trace with hash 925962172, now seen corresponding path program 1 times [2019-01-01 21:39:32,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:39:32,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:39:32,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:32,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:39:32,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:39:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:39:33,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:39:33 BoogieIcfgContainer [2019-01-01 21:39:33,062 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:39:33,063 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:39:33,063 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:39:33,063 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:39:33,064 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:39:28" (3/4) ... [2019-01-01 21:39:33,067 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 21:39:33,125 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 21:39:33,125 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:39:33,126 INFO L168 Benchmark]: Toolchain (without parser) took 4934.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 951.4 MB in the beginning and 900.3 MB in the end (delta: 51.1 MB). Peak memory consumption was 183.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:39:33,127 INFO L168 Benchmark]: CDTParser took 0.15 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 21:39:33,128 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.47 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.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 21:39:33,128 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.18 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:39:33,129 INFO L168 Benchmark]: Boogie Preprocessor took 19.64 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:39:33,129 INFO L168 Benchmark]: RCFGBuilder took 427.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:39:33,138 INFO L168 Benchmark]: BuchiAutomizer took 4070.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 900.3 MB in the end (delta: 201.9 MB). Peak memory consumption was 201.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:39:33,139 INFO L168 Benchmark]: Witness Printer took 62.41 ms. Allocated memory is still 1.2 GB. Free memory is still 900.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:39:33,144 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.15 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 315.47 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.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 34.18 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.64 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 427.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4070.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 900.3 MB in the end (delta: 201.9 MB). Peak memory consumption was 201.9 MB. Max. memory is 11.5 GB. * Witness Printer took 62.41 ms. Allocated memory is still 1.2 GB. Free memory is still 900.3 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 (4 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.3s. Construction of modules took 0.6s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 32 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: 33 SDtfs, 129 SDslu, 60 SDs, 0 SdLazy, 135 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax163 hnf96 lsp60 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf91 smp100 dnf100 smp100 tf106 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 25]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {a=2, \result=0, b=7, m=1003, l=0, i=0, k=3, j=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 25]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] int k; [L9] int l; [L10] int m; [L11] int a; [L12] int b; [L13] i = 0 [L15] COND TRUE i < 100 [L16] a = i+2 [L17] j = 0 [L18] COND TRUE j < a [L19] k = i+j+3 [L20] COND TRUE k >= 0 [L21] b = i+j+k+4 [L22] l = 0 [L23] COND TRUE l < b [L24] m = i+j+k+l+1000 Loop: [L25] COND TRUE m >= 0 [L26] m = m-0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...