./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_04.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/NO_04.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.25-f470102 [2019-11-28 20:31:06,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:31:06,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:31:06,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:31:06,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:31:06,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:31:06,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:31:06,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:31:06,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:31:06,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:31:06,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:31:06,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:31:06,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:31:06,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:31:06,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:31:06,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:31:06,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:31:06,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:31:06,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:31:06,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:31:06,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:31:06,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:31:06,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:31:06,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:31:06,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:31:06,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:31:06,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:31:06,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:31:06,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:31:06,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:31:06,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:31:06,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:31:06,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:31:06,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:31:06,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:31:06,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:31:06,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:31:06,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:31:06,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:31:06,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:31:06,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:31:06,963 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:31:06,988 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:31:06,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:31:06,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:31:06,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:31:06,990 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:31:06,990 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:31:06,990 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:31:06,990 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:31:06,991 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:31:06,991 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:31:06,991 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:31:06,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:31:06,992 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:31:06,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:31:06,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:31:06,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:31:06,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:31:06,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:31:06,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:31:06,993 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:31:06,993 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:31:06,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:31:06,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:31:06,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:31:06,994 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:31:06,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:31:06,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:31:06,995 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:31:06,995 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:31:06,996 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:31:06,996 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d3fb7268073fcc251f9902f5b4913f30f169781 [2019-11-28 20:31:07,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:31:07,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:31:07,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:31:07,328 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:31:07,329 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:31:07,329 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_04.c [2019-11-28 20:31:07,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f2fddc2f/a7e9737f380b494e9dab3f3a72076311/FLAG3f0c9ec36 [2019-11-28 20:31:07,907 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:31:07,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_04.c [2019-11-28 20:31:07,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f2fddc2f/a7e9737f380b494e9dab3f3a72076311/FLAG3f0c9ec36 [2019-11-28 20:31:08,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f2fddc2f/a7e9737f380b494e9dab3f3a72076311 [2019-11-28 20:31:08,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:31:08,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:31:08,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:31:08,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:31:08,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:31:08,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:31:08" (1/1) ... [2019-11-28 20:31:08,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eb65c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:08, skipping insertion in model container [2019-11-28 20:31:08,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:31:08" (1/1) ... [2019-11-28 20:31:08,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:31:08,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:31:08,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:31:08,580 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:31:08,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:31:08,610 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:31:08,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:08 WrapperNode [2019-11-28 20:31:08,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:31:08,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:31:08,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:31:08,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:31:08,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:08" (1/1) ... [2019-11-28 20:31:08,630 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:08" (1/1) ... [2019-11-28 20:31:08,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:31:08,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:31:08,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:31:08,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:31:08,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:08" (1/1) ... [2019-11-28 20:31:08,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:08" (1/1) ... [2019-11-28 20:31:08,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:08" (1/1) ... [2019-11-28 20:31:08,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:08" (1/1) ... [2019-11-28 20:31:08,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:08" (1/1) ... [2019-11-28 20:31:08,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:08" (1/1) ... [2019-11-28 20:31:08,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:08" (1/1) ... [2019-11-28 20:31:08,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:31:08,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:31:08,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:31:08,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:31:08,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:08,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:31:08,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:31:08,989 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:31:08,989 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-28 20:31:08,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:31:08 BoogieIcfgContainer [2019-11-28 20:31:08,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:31:08,992 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:31:08,993 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:31:08,997 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:31:09,003 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:31:09,004 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:31:08" (1/3) ... [2019-11-28 20:31:09,005 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5114780a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:31:09, skipping insertion in model container [2019-11-28 20:31:09,006 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:31:09,006 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:08" (2/3) ... [2019-11-28 20:31:09,007 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5114780a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:31:09, skipping insertion in model container [2019-11-28 20:31:09,007 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:31:09,007 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:31:08" (3/3) ... [2019-11-28 20:31:09,009 INFO L371 chiAutomizerObserver]: Analyzing ICFG NO_04.c [2019-11-28 20:31:09,110 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:31:09,110 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:31:09,111 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:31:09,111 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:31:09,111 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:31:09,111 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:31:09,111 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:31:09,112 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:31:09,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-28 20:31:09,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 20:31:09,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:09,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:09,156 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:31:09,156 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:31:09,156 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:31:09,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-28 20:31:09,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 20:31:09,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:09,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:09,159 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:31:09,159 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:31:09,166 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-11-28 20:31:09,167 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-11-28 20:31:09,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:09,172 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 20:31:09,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:09,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385958883] [2019-11-28 20:31:09,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:09,262 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:09,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:09,264 INFO L82 PathProgramCache]: Analyzing trace with hash 39990, now seen corresponding path program 1 times [2019-11-28 20:31:09,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:09,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378726657] [2019-11-28 20:31:09,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:09,287 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:09,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:09,289 INFO L82 PathProgramCache]: Analyzing trace with hash 963511, now seen corresponding path program 1 times [2019-11-28 20:31:09,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:09,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60335907] [2019-11-28 20:31:09,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:09,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60335907] [2019-11-28 20:31:09,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:31:09,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:31:09,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744237632] [2019-11-28 20:31:09,480 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:09,481 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:09,482 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:09,482 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:09,482 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:09,483 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:09,483 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:09,483 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:09,483 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_04.c_Iteration1_Loop [2019-11-28 20:31:09,483 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:09,484 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:09,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:09,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:09,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:09,643 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:09,644 INFO L404 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-11-28 20:31:09,655 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:09,655 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:09,669 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:09,669 INFO L440 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) [2019-11-28 20:31:09,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:09,685 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:09,695 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:09,695 INFO L440 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) [2019-11-28 20:31:09,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:09,711 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:09,738 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:09,738 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:10,070 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:10,072 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:10,073 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:10,073 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:10,073 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:10,073 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:10,073 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:10,073 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:10,074 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:10,074 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_04.c_Iteration1_Loop [2019-11-28 20:31:10,074 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:10,074 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:10,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:10,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:10,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:10,187 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:10,193 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:10,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:31:10,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:10,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:10,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:10,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:10,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:10,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:31:10,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:10,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:31:10,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:10,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:10,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:10,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:10,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:10,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:31:10,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:10,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:31:10,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:10,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:10,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:10,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:10,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:10,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:10,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:31:10,276 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:10,289 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:31:10,290 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 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) [2019-11-28 20:31:10,312 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:10,312 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:10,313 INFO L510 LassoAnalysis]: Proved termination. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:10,313 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-28 20:31:10,320 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:31:10,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:10,357 WARN L262 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:10,358 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:10,370 WARN L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:31:10,370 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:10,450 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:31:10,452 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 4 states. [2019-11-28 20:31:10,609 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-11-28 20:31:10,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:31:10,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2019-11-28 20:31:10,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 64 transitions. Stem has 1 letters. Loop has 3 letters. [2019-11-28 20:31:10,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:10,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 64 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-28 20:31:10,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:10,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 64 transitions. Stem has 1 letters. Loop has 6 letters. [2019-11-28 20:31:10,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:10,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 102 transitions. [2019-11-28 20:31:10,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-11-28 20:31:10,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 37 states and 54 transitions. [2019-11-28 20:31:10,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-28 20:31:10,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-28 20:31:10,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 54 transitions. [2019-11-28 20:31:10,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:10,640 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 54 transitions. [2019-11-28 20:31:10,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 54 transitions. [2019-11-28 20:31:10,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2019-11-28 20:31:10,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 20:31:10,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-11-28 20:31:10,674 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-11-28 20:31:10,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:31:10,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:31:10,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:31:10,679 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 4 states. [2019-11-28 20:31:10,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:31:10,722 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2019-11-28 20:31:10,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:31:10,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. [2019-11-28 20:31:10,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-11-28 20:31:10,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 18 states and 25 transitions. [2019-11-28 20:31:10,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-28 20:31:10,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-28 20:31:10,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-28 20:31:10,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:31:10,728 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-28 20:31:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-28 20:31:10,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 11. [2019-11-28 20:31:10,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 20:31:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-11-28 20:31:10,731 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-11-28 20:31:10,731 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-11-28 20:31:10,731 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:31:10,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-11-28 20:31:10,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 20:31:10,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:10,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:10,733 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:31:10,733 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:31:10,734 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-11-28 20:31:10,734 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-11-28 20:31:10,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:10,735 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-28 20:31:10,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:10,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191318555] [2019-11-28 20:31:10,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:10,743 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:10,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:10,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1192172983, now seen corresponding path program 1 times [2019-11-28 20:31:10,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:10,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906721868] [2019-11-28 20:31:10,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:10,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:10,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906721868] [2019-11-28 20:31:10,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:31:10,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:31:10,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045723970] [2019-11-28 20:31:10,786 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:31:10,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:31:10,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:31:10,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:31:10,788 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-28 20:31:10,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:31:10,833 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2019-11-28 20:31:10,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:31:10,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2019-11-28 20:31:10,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-28 20:31:10,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 23 transitions. [2019-11-28 20:31:10,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 20:31:10,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 20:31:10,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-11-28 20:31:10,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:31:10,836 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 20:31:10,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-11-28 20:31:10,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-11-28 20:31:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 20:31:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-28 20:31:10,839 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 20:31:10,839 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 20:31:10,839 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:31:10,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-28 20:31:10,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-28 20:31:10,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:10,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:10,841 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:31:10,841 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:31:10,841 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-11-28 20:31:10,841 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-11-28 20:31:10,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:10,842 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-28 20:31:10,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:10,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404696279] [2019-11-28 20:31:10,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:10,848 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:10,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:10,849 INFO L82 PathProgramCache]: Analyzing trace with hash 2090456946, now seen corresponding path program 1 times [2019-11-28 20:31:10,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:10,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418883864] [2019-11-28 20:31:10,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:10,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418883864] [2019-11-28 20:31:10,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:31:10,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:31:10,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341511070] [2019-11-28 20:31:10,894 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:31:10,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:31:10,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:31:10,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:31:10,895 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-11-28 20:31:10,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:31:10,964 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2019-11-28 20:31:10,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:31:10,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2019-11-28 20:31:10,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 20:31:10,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 21 transitions. [2019-11-28 20:31:10,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 20:31:10,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 20:31:10,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-11-28 20:31:10,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:31:10,969 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-28 20:31:10,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-11-28 20:31:10,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2019-11-28 20:31:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 20:31:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-28 20:31:10,973 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-28 20:31:10,973 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-28 20:31:10,974 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:31:10,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-28 20:31:10,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 20:31:10,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:10,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:10,977 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:31:10,977 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:31:10,977 INFO L794 eck$LassoCheckResult]: Stem: 261#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; 258#L15-2 [2019-11-28 20:31:10,978 INFO L796 eck$LassoCheckResult]: Loop: 258#L15-2 assume !!(main_~i~0 < 100);main_~a~0 := 2 + main_~i~0;main_~j~0 := 0; 262#L18-2 assume !!(main_~j~0 < main_~a~0);main_~k~0 := 3 + (main_~i~0 + main_~j~0); 263#L20-2 assume !!(main_~k~0 >= 0);main_~b~0 := 4 + (main_~i~0 + main_~j~0 + main_~k~0);main_~l~0 := 0; 259#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); 260#L25-2 assume !(main_~m~0 >= 0); 264#L25-3 main_~l~0 := 1 + main_~l~0; 265#L23-2 assume !(main_~l~0 < main_~b~0); 268#L23-3 main_~k~0 := main_~k~0 - 1; 269#L20-2 assume !(main_~k~0 >= 0); 266#L20-3 main_~j~0 := 1 + main_~j~0; 267#L18-2 assume !(main_~j~0 < main_~a~0); 257#L18-3 main_~i~0 := 1 + main_~i~0; 258#L15-2 [2019-11-28 20:31:10,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:10,978 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-28 20:31:10,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:10,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14573535] [2019-11-28 20:31:10,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:10,996 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:10,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:10,999 INFO L82 PathProgramCache]: Analyzing trace with hash -591153991, now seen corresponding path program 1 times [2019-11-28 20:31:10,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:11,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134345806] [2019-11-28 20:31:11,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:11,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134345806] [2019-11-28 20:31:11,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:31:11,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:31:11,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253246024] [2019-11-28 20:31:11,095 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:31:11,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:31:11,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:31:11,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:31:11,097 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-11-28 20:31:11,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:31:11,158 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-11-28 20:31:11,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:31:11,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 6 transitions. [2019-11-28 20:31:11,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 20:31:11,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 6 transitions. [2019-11-28 20:31:11,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 20:31:11,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-28 20:31:11,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2019-11-28 20:31:11,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:31:11,160 INFO L688 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-11-28 20:31:11,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2019-11-28 20:31:11,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-11-28 20:31:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 20:31:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-11-28 20:31:11,163 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-11-28 20:31:11,163 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-11-28 20:31:11,163 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:31:11,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2019-11-28 20:31:11,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 20:31:11,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:11,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:11,164 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:31:11,165 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 20:31:11,165 INFO L794 eck$LassoCheckResult]: Stem: 293#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; 294#L15-2 assume !!(main_~i~0 < 100);main_~a~0 := 2 + main_~i~0;main_~j~0 := 0; 295#L18-2 assume !!(main_~j~0 < main_~a~0);main_~k~0 := 3 + (main_~i~0 + main_~j~0); 296#L20-2 assume !!(main_~k~0 >= 0);main_~b~0 := 4 + (main_~i~0 + main_~j~0 + main_~k~0);main_~l~0 := 0; 291#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); 292#L25-2 [2019-11-28 20:31:11,165 INFO L796 eck$LassoCheckResult]: Loop: 292#L25-2 assume !!(main_~m~0 >= 0);main_~m~0 := main_~m~0 - 0; 292#L25-2 [2019-11-28 20:31:11,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:11,166 INFO L82 PathProgramCache]: Analyzing trace with hash 29869746, now seen corresponding path program 1 times [2019-11-28 20:31:11,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:11,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843595468] [2019-11-28 20:31:11,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:11,197 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:11,198 INFO L82 PathProgramCache]: Analyzing trace with hash 77, now seen corresponding path program 1 times [2019-11-28 20:31:11,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:11,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422149584] [2019-11-28 20:31:11,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:11,211 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:11,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:11,213 INFO L82 PathProgramCache]: Analyzing trace with hash 925962172, now seen corresponding path program 1 times [2019-11-28 20:31:11,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:11,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329109793] [2019-11-28 20:31:11,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:11,232 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:11,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:31:11 BoogieIcfgContainer [2019-11-28 20:31:11,339 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:31:11,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:31:11,341 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:31:11,341 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:31:11,342 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:31:08" (3/4) ... [2019-11-28 20:31:11,346 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 20:31:11,415 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:31:11,415 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:31:11,418 INFO L168 Benchmark]: Toolchain (without parser) took 3083.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 956.3 MB in the beginning and 941.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 149.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:31:11,419 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:31:11,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.37 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 944.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:31:11,421 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:31:11,421 INFO L168 Benchmark]: Boogie Preprocessor took 27.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:31:11,422 INFO L168 Benchmark]: RCFGBuilder took 252.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:31:11,423 INFO L168 Benchmark]: BuchiAutomizer took 2347.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 941.7 MB in the end (delta: 170.3 MB). Peak memory consumption was 170.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:31:11,423 INFO L168 Benchmark]: Witness Printer took 74.62 ms. Allocated memory is still 1.2 GB. Free memory is still 941.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:31:11,428 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.37 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 944.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 252.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2347.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 941.7 MB in the end (delta: 170.3 MB). Peak memory consumption was 170.3 MB. Max. memory is 11.5 GB. * Witness Printer took 74.62 ms. Allocated memory is still 1.2 GB. Free memory is still 941.7 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 6 locations. The remainder module has 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 34 SDtfs, 111 SDslu, 45 SDs, 0 SdLazy, 97 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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: 29ms 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...