./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Ex08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/Ex08.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 0f19c27ba74e1ebec32cb641e6640521812ace19 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.2.0-5485861 [2020-10-26 04:16:21,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:16:21,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:16:21,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:16:21,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:16:21,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:16:21,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:16:21,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:16:21,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:16:21,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:16:21,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:16:21,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:16:21,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:16:21,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:16:21,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:16:21,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:16:21,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:16:21,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:16:21,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:16:22,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:16:22,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:16:22,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:16:22,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:16:22,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:16:22,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:16:22,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:16:22,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:16:22,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:16:22,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:16:22,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:16:22,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:16:22,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:16:22,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:16:22,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:16:22,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:16:22,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:16:22,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:16:22,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:16:22,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:16:22,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:16:22,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:16:22,044 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-26 04:16:22,072 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:16:22,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:16:22,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:16:22,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:16:22,074 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:16:22,074 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:16:22,074 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:16:22,075 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:16:22,075 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:16:22,075 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:16:22,075 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:16:22,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:16:22,076 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:16:22,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:16:22,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:16:22,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:16:22,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:16:22,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:16:22,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:16:22,077 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:16:22,077 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:16:22,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:16:22,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:16:22,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:16:22,078 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:16:22,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:16:22,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:16:22,079 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:16:22,079 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:16:22,080 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:16:22,081 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 0f19c27ba74e1ebec32cb641e6640521812ace19 [2020-10-26 04:16:22,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:16:22,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:16:22,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:16:22,564 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:16:22,564 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:16:22,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Ex08.c [2020-10-26 04:16:22,669 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3966bcef6/73d6d1d655194c69af09dbe163cd1d8b/FLAGb2c2521ec [2020-10-26 04:16:23,275 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:16:23,276 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2020-10-26 04:16:23,284 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3966bcef6/73d6d1d655194c69af09dbe163cd1d8b/FLAGb2c2521ec [2020-10-26 04:16:23,645 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3966bcef6/73d6d1d655194c69af09dbe163cd1d8b [2020-10-26 04:16:23,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:16:23,655 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:16:23,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:16:23,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:16:23,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:16:23,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:16:23" (1/1) ... [2020-10-26 04:16:23,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@864457f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:16:23, skipping insertion in model container [2020-10-26 04:16:23,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:16:23" (1/1) ... [2020-10-26 04:16:23,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:16:23,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:16:23,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:16:23,846 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:16:23,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:16:23,877 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:16:23,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:16:23 WrapperNode [2020-10-26 04:16:23,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:16:23,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:16:23,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:16:23,879 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:16:23,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:16:23" (1/1) ... [2020-10-26 04:16:23,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:16:23" (1/1) ... [2020-10-26 04:16:23,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:16:23,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:16:23,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:16:23,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:16:23,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:16:23" (1/1) ... [2020-10-26 04:16:23,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:16:23" (1/1) ... [2020-10-26 04:16:23,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:16:23" (1/1) ... [2020-10-26 04:16:23,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:16:23" (1/1) ... [2020-10-26 04:16:23,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:16:23" (1/1) ... [2020-10-26 04:16:23,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:16:23" (1/1) ... [2020-10-26 04:16:23,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:16:23" (1/1) ... [2020-10-26 04:16:23,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:16:23,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:16:23,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:16:23,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:16:23,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:16:23" (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 [2020-10-26 04:16:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:16:24,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:16:24,189 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:16:24,189 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-10-26 04:16:24,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:16:24 BoogieIcfgContainer [2020-10-26 04:16:24,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:16:24,193 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:16:24,193 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:16:24,197 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:16:24,198 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:16:24,199 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:16:23" (1/3) ... [2020-10-26 04:16:24,200 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79612194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:16:24, skipping insertion in model container [2020-10-26 04:16:24,200 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:16:24,200 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:16:23" (2/3) ... [2020-10-26 04:16:24,201 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79612194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:16:24, skipping insertion in model container [2020-10-26 04:16:24,201 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:16:24,201 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:16:24" (3/3) ... [2020-10-26 04:16:24,203 INFO L373 chiAutomizerObserver]: Analyzing ICFG Ex08.c [2020-10-26 04:16:24,260 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:16:24,261 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:16:24,261 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:16:24,261 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:16:24,262 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:16:24,262 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:16:24,262 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:16:24,262 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:16:24,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-10-26 04:16:24,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:16:24,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:24,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:24,312 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-10-26 04:16:24,313 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:16:24,313 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:16:24,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-10-26 04:16:24,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:16:24,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:24,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:24,316 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-10-26 04:16:24,316 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:16:24,325 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 5#L18-1true [2020-10-26 04:16:24,326 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true assume !!(main_~i~0 > 0); 6#L12true assume 1 == main_~i~0;main_~up~0 := 1; 3#L12-2true assume 10 == main_~i~0;main_~up~0 := 0; 9#L15-1true assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5#L18-1true [2020-10-26 04:16:24,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:24,334 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-10-26 04:16:24,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:24,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194164609] [2020-10-26 04:16:24,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:24,447 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:24,452 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:24,470 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:24,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:24,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1234538, now seen corresponding path program 1 times [2020-10-26 04:16:24,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:24,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038356968] [2020-10-26 04:16:24,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:16:24,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038356968] [2020-10-26 04:16:24,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:16:24,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:16:24,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215409161] [2020-10-26 04:16:24,581 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:16:24,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:24,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:16:24,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:16:24,610 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-10-26 04:16:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:24,823 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2020-10-26 04:16:24,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:16:24,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 19 transitions. [2020-10-26 04:16:24,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:16:24,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 14 transitions. [2020-10-26 04:16:24,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-26 04:16:24,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-26 04:16:24,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. [2020-10-26 04:16:24,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:16:24,840 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-10-26 04:16:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. [2020-10-26 04:16:24,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-10-26 04:16:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-26 04:16:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2020-10-26 04:16:24,875 INFO L714 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-10-26 04:16:24,876 INFO L594 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-10-26 04:16:24,876 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:16:24,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2020-10-26 04:16:24,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:16:24,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:24,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:24,879 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-10-26 04:16:24,880 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:16:24,880 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 34#L18-1 [2020-10-26 04:16:24,881 INFO L796 eck$LassoCheckResult]: Loop: 34#L18-1 assume !!(main_~i~0 > 0); 39#L12 assume !(1 == main_~i~0); 37#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 38#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 34#L18-1 [2020-10-26 04:16:24,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:24,883 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2020-10-26 04:16:24,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:24,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976482654] [2020-10-26 04:16:24,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:24,902 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:24,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:24,915 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:24,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:24,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1236460, now seen corresponding path program 1 times [2020-10-26 04:16:24,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:24,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363836291] [2020-10-26 04:16:24,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:16:24,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363836291] [2020-10-26 04:16:24,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:16:24,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 04:16:24,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342824181] [2020-10-26 04:16:24,960 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:16:24,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:24,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:16:24,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:16:24,962 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-10-26 04:16:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:24,997 INFO L93 Difference]: Finished difference Result 13 states and 20 transitions. [2020-10-26 04:16:24,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:16:24,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 20 transitions. [2020-10-26 04:16:25,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-26 04:16:25,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 20 transitions. [2020-10-26 04:16:25,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-26 04:16:25,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-26 04:16:25,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 20 transitions. [2020-10-26 04:16:25,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:16:25,004 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2020-10-26 04:16:25,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 20 transitions. [2020-10-26 04:16:25,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-26 04:16:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-26 04:16:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2020-10-26 04:16:25,010 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2020-10-26 04:16:25,010 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2020-10-26 04:16:25,015 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:16:25,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2020-10-26 04:16:25,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-26 04:16:25,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:25,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:25,018 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-10-26 04:16:25,020 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:16:25,020 INFO L794 eck$LassoCheckResult]: Stem: 61#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 62#L18-1 [2020-10-26 04:16:25,021 INFO L796 eck$LassoCheckResult]: Loop: 62#L18-1 assume !!(main_~i~0 > 0); 71#L12 assume !(1 == main_~i~0); 70#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 66#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 62#L18-1 [2020-10-26 04:16:25,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:25,023 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2020-10-26 04:16:25,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:25,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127257356] [2020-10-26 04:16:25,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:25,032 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:25,040 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:25,041 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:25,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:25,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1236462, now seen corresponding path program 1 times [2020-10-26 04:16:25,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:25,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380454570] [2020-10-26 04:16:25,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:25,060 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:25,070 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:25,072 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:25,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:25,075 INFO L82 PathProgramCache]: Analyzing trace with hash 29865613, now seen corresponding path program 1 times [2020-10-26 04:16:25,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:25,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720265293] [2020-10-26 04:16:25,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:25,097 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:25,108 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:25,112 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:25,186 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:25,187 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:25,187 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:25,187 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:25,188 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 04:16:25,188 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:25,188 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:25,188 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:25,189 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2020-10-26 04:16:25,189 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:25,189 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:25,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:25,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:25,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:25,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:25,325 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:25,326 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) [2020-10-26 04:16:25,333 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:25,333 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 [2020-10-26 04:16:25,348 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:25,348 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 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 [2020-10-26 04:16:25,384 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:25,385 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:25,389 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:25,389 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:25,430 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:25,431 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 [2020-10-26 04:16:25,440 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:25,440 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2020-10-26 04:16:25,476 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:25,476 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:25,522 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 04:16:25,523 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:25,537 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 04:16:25,570 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:25,570 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:25,570 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:25,570 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:25,570 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:16:25,570 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:25,571 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:25,571 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:25,572 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2020-10-26 04:16:25,572 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:25,572 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:25,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:25,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:25,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:25,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:25,679 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:25,685 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2020-10-26 04:16:25,689 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 [2020-10-26 04:16:25,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:25,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:25,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:25,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:25,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:16:25,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:16:25,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2020-10-26 04:16:25,753 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 [2020-10-26 04:16:25,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:25,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:25,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:25,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:25,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:16:25,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:16:25,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:25,794 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 [2020-10-26 04:16:25,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:25,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:25,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:25,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:25,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:25,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:16:25,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:16:25,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:25,832 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 [2020-10-26 04:16:25,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:25,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:25,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:25,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:25,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:25,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:16:25,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:16:25,850 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:16:25,856 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-26 04:16:25,857 INFO L444 ModelExtractionUtils]: 0 out of 3 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 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:25,861 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:16:25,861 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 04:16:25,861 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:16:25,862 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-26 04:16:25,887 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 04:16:25,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:25,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:16:25,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:25,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:16:25,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:16:26,092 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-26 04:16:26,093 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-26 04:16:26,185 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 34 states and 50 transitions. Complement of second has 7 states. [2020-10-26 04:16:26,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 04:16:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-26 04:16:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-10-26 04:16:26,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 4 letters. [2020-10-26 04:16:26,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:26,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2020-10-26 04:16:26,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:26,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 8 letters. [2020-10-26 04:16:26,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:26,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2020-10-26 04:16:26,198 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2020-10-26 04:16:26,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 29 states and 43 transitions. [2020-10-26 04:16:26,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-26 04:16:26,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 04:16:26,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 43 transitions. [2020-10-26 04:16:26,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:26,202 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2020-10-26 04:16:26,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 43 transitions. [2020-10-26 04:16:26,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2020-10-26 04:16:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-26 04:16:26,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2020-10-26 04:16:26,206 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2020-10-26 04:16:26,206 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2020-10-26 04:16:26,206 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:16:26,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2020-10-26 04:16:26,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2020-10-26 04:16:26,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:26,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:26,208 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:16:26,208 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:16:26,209 INFO L794 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 151#L18-1 assume !!(main_~i~0 > 0); 159#L12 [2020-10-26 04:16:26,209 INFO L796 eck$LassoCheckResult]: Loop: 159#L12 assume !(1 == main_~i~0); 165#L12-2 assume !(10 == main_~i~0); 156#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 157#L18-1 assume !!(main_~i~0 > 0); 159#L12 [2020-10-26 04:16:26,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:26,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2020-10-26 04:16:26,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:26,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955060836] [2020-10-26 04:16:26,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:26,216 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:26,218 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:26,220 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:26,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:26,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1391414, now seen corresponding path program 1 times [2020-10-26 04:16:26,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:26,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357227090] [2020-10-26 04:16:26,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:26,227 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:26,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:26,232 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:26,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:26,233 INFO L82 PathProgramCache]: Analyzing trace with hash 925835935, now seen corresponding path program 1 times [2020-10-26 04:16:26,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:26,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731069625] [2020-10-26 04:16:26,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:26,240 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:26,244 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:26,246 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:26,279 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:26,279 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:26,279 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:26,279 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:26,279 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 04:16:26,279 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:26,279 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:26,280 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:26,280 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2020-10-26 04:16:26,280 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:26,280 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:26,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:26,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:26,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:26,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:26,402 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:26,403 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:26,411 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:26,411 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:26,417 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:26,417 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:26,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:26,457 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:26,462 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:26,462 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:26,492 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:26,492 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:26,498 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:26,498 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=-8} Honda state: {ULTIMATE.start_main_~up~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:26,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:26,525 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:26,567 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 04:16:26,567 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:26,663 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 04:16:26,665 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:26,665 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:26,666 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:26,666 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:26,666 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:16:26,666 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:26,666 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:26,666 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:26,666 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2020-10-26 04:16:26,666 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:26,666 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:26,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:26,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:26,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:26,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:26,812 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:26,812 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:26,820 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 [2020-10-26 04:16:26,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:26,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:26,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:26,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:26,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:16:26,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:16:26,836 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:26,876 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 [2020-10-26 04:16:26,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:26,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:26,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:26,879 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-26 04:16:26,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:26,880 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-26 04:16:26,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:26,883 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:26,924 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 [2020-10-26 04:16:26,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:26,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:26,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:26,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:26,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:16:26,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:26,935 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:26,977 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 [2020-10-26 04:16:26,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:26,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:26,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:26,980 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-26 04:16:26,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:26,982 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-26 04:16:26,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:26,987 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:16:26,992 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-26 04:16:26,992 INFO L444 ModelExtractionUtils]: 0 out of 3 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:27,001 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:16:27,001 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 04:16:27,001 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:16:27,001 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:27,041 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 04:16:27,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:27,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:16:27,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:27,077 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:16:27,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:16:27,122 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-26 04:16:27,122 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 35 transitions. cyclomatic complexity: 14 Second operand 4 states. [2020-10-26 04:16:27,163 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 35 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 40 states and 58 transitions. Complement of second has 7 states. [2020-10-26 04:16:27,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 04:16:27,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-26 04:16:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2020-10-26 04:16:27,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-26 04:16:27,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:27,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2020-10-26 04:16:27,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:27,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 8 letters. [2020-10-26 04:16:27,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:27,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2020-10-26 04:16:27,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-26 04:16:27,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 31 states and 48 transitions. [2020-10-26 04:16:27,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-26 04:16:27,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-26 04:16:27,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 48 transitions. [2020-10-26 04:16:27,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:27,171 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 48 transitions. [2020-10-26 04:16:27,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 48 transitions. [2020-10-26 04:16:27,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-10-26 04:16:27,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-26 04:16:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2020-10-26 04:16:27,203 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 48 transitions. [2020-10-26 04:16:27,203 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 48 transitions. [2020-10-26 04:16:27,203 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 04:16:27,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 48 transitions. [2020-10-26 04:16:27,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-26 04:16:27,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:27,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:27,205 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 04:16:27,207 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:16:27,207 INFO L794 eck$LassoCheckResult]: Stem: 255#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 256#L18-1 assume !!(main_~i~0 > 0); 267#L12 assume 1 == main_~i~0;main_~up~0 := 1; 266#L12-2 assume !(10 == main_~i~0); 272#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 273#L18-1 [2020-10-26 04:16:27,208 INFO L796 eck$LassoCheckResult]: Loop: 273#L18-1 assume !!(main_~i~0 > 0); 280#L12 assume !(1 == main_~i~0); 274#L12-2 assume !(10 == main_~i~0); 275#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 273#L18-1 [2020-10-26 04:16:27,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:27,208 INFO L82 PathProgramCache]: Analyzing trace with hash 29863751, now seen corresponding path program 1 times [2020-10-26 04:16:27,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:27,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085708756] [2020-10-26 04:16:27,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:27,223 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:27,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:27,233 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:27,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:27,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1236522, now seen corresponding path program 1 times [2020-10-26 04:16:27,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:27,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63404024] [2020-10-26 04:16:27,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:27,247 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:27,250 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:27,251 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:27,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:27,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1816492656, now seen corresponding path program 1 times [2020-10-26 04:16:27,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:27,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527271553] [2020-10-26 04:16:27,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:27,259 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:27,264 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:27,266 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:27,306 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:27,306 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:27,307 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:27,307 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:27,307 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 04:16:27,307 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:27,307 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:27,307 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:27,307 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2020-10-26 04:16:27,307 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:27,307 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:27,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:27,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:27,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:27,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:27,466 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:27,467 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:27,473 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:27,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:27,484 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:27,484 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] Waiting until toolchain timeout for monitored process 22 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:27,524 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:27,524 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:27,534 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:27,534 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:27,559 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:27,559 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:27,602 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 04:16:27,602 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:27,623 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:27,623 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=14} Honda state: {ULTIMATE.start_main_~i~0=14} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0=1}, {ULTIMATE.start_main_~i~0=0}, {ULTIMATE.start_main_~i~0=0}] Lambdas: [1, 0, 7] Nus: [0, 1] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:27,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:27,662 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:27,672 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:27,672 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2020-10-26 04:16:27,740 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:27,740 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:27,740 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:27,740 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:27,740 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 04:16:27,740 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:27,740 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:27,741 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:27,741 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2020-10-26 04:16:27,741 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:27,741 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:27,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:27,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:27,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:27,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:27,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:27,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:27,922 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:27,922 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:27,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:27,929 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:27,939 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:27,939 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:28,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:28,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:28,010 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:28,010 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:28,034 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:28,034 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:28,037 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:28,037 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_6=0} Honda state: {v_rep~unnamed0~0~false_6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:28,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:28,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:28,064 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:28,064 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:28,088 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:28,088 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 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 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:28,118 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 04:16:28,118 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:28,145 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 04:16:28,146 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:28,146 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:28,146 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:28,146 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:28,146 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:16:28,146 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:28,147 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:28,147 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:28,147 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2020-10-26 04:16:28,147 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:28,147 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:28,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:28,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:28,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:28,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:28,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:28,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:28,327 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:28,328 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:28,343 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 [2020-10-26 04:16:28,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:28,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:28,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:28,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:28,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:28,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:16:28,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:28,351 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:28,393 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 [2020-10-26 04:16:28,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:28,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:28,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:28,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:28,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:28,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:16:28,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:28,399 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 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:28,439 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 [2020-10-26 04:16:28,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:28,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:28,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:28,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:28,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:16:28,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:16:28,449 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:28,489 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 [2020-10-26 04:16:28,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:28,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:28,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:28,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:28,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:16:28,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:28,500 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:28,539 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 [2020-10-26 04:16:28,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:28,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:28,542 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-26 04:16:28,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:28,552 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-10-26 04:16:28,552 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:28,570 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:16:28,596 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-26 04:16:28,597 INFO L444 ModelExtractionUtils]: 0 out of 11 variables were initially zero. Simplification set additionally 6 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:28,600 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:28,607 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2020-10-26 04:16:28,607 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:16:28,607 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 21 Supporting invariants [-1*ULTIMATE.start_main_~i~0 + 10 >= 0] [2020-10-26 04:16:28,645 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-10-26 04:16:28,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:28,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:16:28,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:28,719 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 04:16:28,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:16:28,745 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-26 04:16:28,745 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 48 transitions. cyclomatic complexity: 21 Second operand 5 states. [2020-10-26 04:16:28,864 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 48 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 45 states and 67 transitions. Complement of second has 8 states. [2020-10-26 04:16:28,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 04:16:28,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 04:16:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-10-26 04:16:28,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 5 letters. Loop has 4 letters. [2020-10-26 04:16:28,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:28,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 9 letters. Loop has 4 letters. [2020-10-26 04:16:28,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:28,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 5 letters. Loop has 8 letters. [2020-10-26 04:16:28,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:28,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 67 transitions. [2020-10-26 04:16:28,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-26 04:16:28,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 44 states and 66 transitions. [2020-10-26 04:16:28,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 04:16:28,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-26 04:16:28,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 66 transitions. [2020-10-26 04:16:28,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:28,873 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 66 transitions. [2020-10-26 04:16:28,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 66 transitions. [2020-10-26 04:16:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2020-10-26 04:16:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-26 04:16:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2020-10-26 04:16:28,878 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2020-10-26 04:16:28,879 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2020-10-26 04:16:28,879 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 04:16:28,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 63 transitions. [2020-10-26 04:16:28,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-26 04:16:28,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:28,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:28,881 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-26 04:16:28,881 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:16:28,881 INFO L794 eck$LassoCheckResult]: Stem: 394#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 395#L18-1 assume !!(main_~i~0 > 0); 412#L12 assume 1 == main_~i~0;main_~up~0 := 1; 409#L12-2 assume !(10 == main_~i~0); 403#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 404#L18-1 assume !!(main_~i~0 > 0); 400#L12 assume !(1 == main_~i~0); 401#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 426#L15-1 [2020-10-26 04:16:28,882 INFO L796 eck$LassoCheckResult]: Loop: 426#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 425#L18-1 assume !!(main_~i~0 > 0); 423#L12 assume !(1 == main_~i~0); 424#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 426#L15-1 [2020-10-26 04:16:28,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:28,882 INFO L82 PathProgramCache]: Analyzing trace with hash 612785863, now seen corresponding path program 1 times [2020-10-26 04:16:28,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:28,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586400410] [2020-10-26 04:16:28,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:16:28,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586400410] [2020-10-26 04:16:28,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699361687] [2020-10-26 04:16:28,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:28,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-26 04:16:28,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:16:28,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:28,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-10-26 04:16:28,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622727192] [2020-10-26 04:16:28,941 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:16:28,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:28,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1737972, now seen corresponding path program 2 times [2020-10-26 04:16:28,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:28,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822050421] [2020-10-26 04:16:28,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:28,947 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:28,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:28,951 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:28,986 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:28,986 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:28,986 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:28,986 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:28,986 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 04:16:28,986 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:28,986 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:28,986 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:28,986 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2020-10-26 04:16:28,986 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:28,987 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:28,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:28,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:28,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:29,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:29,096 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:29,097 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:29,103 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:29,103 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:29,109 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:29,109 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:29,146 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:29,146 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:29,151 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:29,151 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_8=1} Honda state: {v_rep~unnamed0~0~true_8=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:29,190 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:29,190 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:29,195 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:29,195 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_8=0} Honda state: {v_rep~unnamed0~0~false_8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:29,237 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:29,237 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 43 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:29,279 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 04:16:29,279 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:29,422 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 04:16:29,423 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:29,423 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:29,424 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:29,424 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:29,424 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:16:29,424 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:29,424 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:29,424 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:29,424 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2020-10-26 04:16:29,424 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:29,424 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:29,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:29,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:29,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:29,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:29,536 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:29,537 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:29,542 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 [2020-10-26 04:16:29,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:29,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:29,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:29,544 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-26 04:16:29,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:29,546 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-26 04:16:29,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:16:29,548 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 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:29,571 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 [2020-10-26 04:16:29,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:29,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:29,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:29,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:29,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:16:29,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:16:29,579 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:29,620 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 [2020-10-26 04:16:29,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:29,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:29,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:29,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:29,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:16:29,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:29,630 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:29,668 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 [2020-10-26 04:16:29,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:29,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:29,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:29,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:29,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:29,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:16:29,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:29,674 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:16:29,678 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-26 04:16:29,679 INFO L444 ModelExtractionUtils]: 0 out of 3 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:29,682 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:16:29,682 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 04:16:29,682 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:16:29,682 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:29,710 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 04:16:29,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:29,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:16:29,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:29,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:16:29,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:16:29,769 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-26 04:16:29,769 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 63 transitions. cyclomatic complexity: 27 Second operand 3 states. [2020-10-26 04:16:29,813 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 63 transitions. cyclomatic complexity: 27. Second operand 3 states. Result 104 states and 159 transitions. Complement of second has 7 states. [2020-10-26 04:16:29,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 04:16:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 04:16:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-10-26 04:16:29,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2020-10-26 04:16:29,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:29,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 4 letters. [2020-10-26 04:16:29,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:29,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 8 letters. [2020-10-26 04:16:29,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:29,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 159 transitions. [2020-10-26 04:16:29,826 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-10-26 04:16:29,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 86 states and 132 transitions. [2020-10-26 04:16:29,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-10-26 04:16:29,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2020-10-26 04:16:29,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 132 transitions. [2020-10-26 04:16:29,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:29,830 INFO L691 BuchiCegarLoop]: Abstraction has 86 states and 132 transitions. [2020-10-26 04:16:29,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 132 transitions. [2020-10-26 04:16:29,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2020-10-26 04:16:29,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-26 04:16:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2020-10-26 04:16:29,850 INFO L714 BuchiCegarLoop]: Abstraction has 81 states and 126 transitions. [2020-10-26 04:16:29,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:29,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 04:16:29,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-26 04:16:29,851 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand 4 states. [2020-10-26 04:16:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:29,888 INFO L93 Difference]: Finished difference Result 115 states and 174 transitions. [2020-10-26 04:16:29,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 04:16:29,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 174 transitions. [2020-10-26 04:16:29,892 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2020-10-26 04:16:29,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 115 states and 174 transitions. [2020-10-26 04:16:29,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2020-10-26 04:16:29,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2020-10-26 04:16:29,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 174 transitions. [2020-10-26 04:16:29,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:29,895 INFO L691 BuchiCegarLoop]: Abstraction has 115 states and 174 transitions. [2020-10-26 04:16:29,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 174 transitions. [2020-10-26 04:16:29,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2020-10-26 04:16:29,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-26 04:16:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 150 transitions. [2020-10-26 04:16:29,905 INFO L714 BuchiCegarLoop]: Abstraction has 97 states and 150 transitions. [2020-10-26 04:16:29,905 INFO L594 BuchiCegarLoop]: Abstraction has 97 states and 150 transitions. [2020-10-26 04:16:29,905 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 04:16:29,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 150 transitions. [2020-10-26 04:16:29,907 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2020-10-26 04:16:29,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:29,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:29,908 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-10-26 04:16:29,908 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:16:29,908 INFO L794 eck$LassoCheckResult]: Stem: 816#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 817#L18-1 assume !!(main_~i~0 > 0); 834#L12 assume 1 == main_~i~0;main_~up~0 := 1; 830#L12-2 assume !(10 == main_~i~0); 828#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 829#L18-1 assume !!(main_~i~0 > 0); 883#L12 assume !(1 == main_~i~0); 860#L12-2 assume !(10 == main_~i~0); 889#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 868#L18-1 [2020-10-26 04:16:29,908 INFO L796 eck$LassoCheckResult]: Loop: 868#L18-1 assume !!(main_~i~0 > 0); 881#L12 assume 1 == main_~i~0;main_~up~0 := 1; 871#L12-2 assume !(10 == main_~i~0); 878#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 868#L18-1 [2020-10-26 04:16:29,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:29,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1816492658, now seen corresponding path program 1 times [2020-10-26 04:16:29,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:29,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426803948] [2020-10-26 04:16:29,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-26 04:16:29,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426803948] [2020-10-26 04:16:29,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:16:29,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 04:16:29,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524167535] [2020-10-26 04:16:29,948 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:16:29,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:29,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1234602, now seen corresponding path program 1 times [2020-10-26 04:16:29,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:29,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490108971] [2020-10-26 04:16:29,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:16:29,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490108971] [2020-10-26 04:16:29,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:16:29,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 04:16:29,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972351570] [2020-10-26 04:16:29,978 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:16:29,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:29,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:16:29,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:16:29,980 INFO L87 Difference]: Start difference. First operand 97 states and 150 transitions. cyclomatic complexity: 64 Second operand 3 states. [2020-10-26 04:16:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:29,991 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2020-10-26 04:16:29,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:16:29,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 103 transitions. [2020-10-26 04:16:29,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-10-26 04:16:29,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 63 states and 81 transitions. [2020-10-26 04:16:29,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-10-26 04:16:29,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-10-26 04:16:29,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 81 transitions. [2020-10-26 04:16:29,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:29,994 INFO L691 BuchiCegarLoop]: Abstraction has 63 states and 81 transitions. [2020-10-26 04:16:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 81 transitions. [2020-10-26 04:16:29,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2020-10-26 04:16:29,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-26 04:16:30,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2020-10-26 04:16:30,000 INFO L714 BuchiCegarLoop]: Abstraction has 60 states and 78 transitions. [2020-10-26 04:16:30,000 INFO L594 BuchiCegarLoop]: Abstraction has 60 states and 78 transitions. [2020-10-26 04:16:30,000 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 04:16:30,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 78 transitions. [2020-10-26 04:16:30,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-26 04:16:30,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:30,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:30,003 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2020-10-26 04:16:30,003 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:16:30,003 INFO L794 eck$LassoCheckResult]: Stem: 997#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 998#L18-1 assume !!(main_~i~0 > 0); 1027#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1026#L12-2 assume !(10 == main_~i~0); 1024#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1022#L18-1 assume !!(main_~i~0 > 0); 1018#L12 assume !(1 == main_~i~0); 1020#L12-2 assume !(10 == main_~i~0); 1019#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1017#L18-1 assume !!(main_~i~0 > 0); 1015#L12 assume !(1 == main_~i~0); 1012#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1006#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1007#L18-1 assume !!(main_~i~0 > 0); 1005#L12 assume 1 == main_~i~0;main_~up~0 := 1; 993#L12-2 [2020-10-26 04:16:30,003 INFO L796 eck$LassoCheckResult]: Loop: 993#L12-2 assume !(10 == main_~i~0); 994#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1008#L18-1 assume !!(main_~i~0 > 0); 1003#L12 assume 1 == main_~i~0;main_~up~0 := 1; 993#L12-2 [2020-10-26 04:16:30,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:30,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1399375584, now seen corresponding path program 1 times [2020-10-26 04:16:30,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:30,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814160596] [2020-10-26 04:16:30,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-26 04:16:30,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814160596] [2020-10-26 04:16:30,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:16:30,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:16:30,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363199975] [2020-10-26 04:16:30,029 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:16:30,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:30,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1573480, now seen corresponding path program 1 times [2020-10-26 04:16:30,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:30,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258392177] [2020-10-26 04:16:30,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:30,034 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:30,036 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:30,037 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:30,069 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:30,069 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:30,070 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:30,070 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:30,070 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 04:16:30,070 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:30,070 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:30,070 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:30,070 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2020-10-26 04:16:30,070 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:30,070 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:30,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:30,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:30,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:30,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:30,155 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:30,155 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:30,159 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:30,159 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:30,163 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:30,163 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_10=0} Honda state: {v_rep~unnamed0~0~false_10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:30,193 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:30,193 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:30,196 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:30,196 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:30,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:30,220 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:30,223 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:30,223 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_10=1} Honda state: {v_rep~unnamed0~0~true_10=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:30,248 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:30,248 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 53 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 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:30,275 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 04:16:30,275 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:30,320 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 04:16:30,321 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:30,321 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:30,321 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:30,321 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:30,322 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:16:30,322 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:30,322 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:30,322 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:30,322 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2020-10-26 04:16:30,322 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:30,322 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:30,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:30,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:30,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:30,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:30,410 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:30,410 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:30,415 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 [2020-10-26 04:16:30,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:30,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:30,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:30,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:30,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:16:30,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:16:30,425 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 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:30,450 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 [2020-10-26 04:16:30,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:30,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:30,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:30,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:30,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:16:30,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:16:30,458 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:30,482 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 [2020-10-26 04:16:30,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:30,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:30,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:30,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:30,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:30,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:16:30,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:30,488 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 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:30,511 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 [2020-10-26 04:16:30,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:30,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:30,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:30,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:30,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:30,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:16:30,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:16:30,517 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:16:30,525 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-26 04:16:30,525 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:30,529 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:16:30,529 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 04:16:30,529 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:16:30,529 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2020-10-26 04:16:30,550 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 04:16:30,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:30,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:16:30,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:30,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:16:30,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:16:30,641 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 [2020-10-26 04:16:30,641 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 78 transitions. cyclomatic complexity: 25 Second operand 5 states. [2020-10-26 04:16:30,724 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 78 transitions. cyclomatic complexity: 25. Second operand 5 states. Result 119 states and 154 transitions. Complement of second has 9 states. [2020-10-26 04:16:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-26 04:16:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 04:16:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2020-10-26 04:16:30,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 15 letters. Loop has 4 letters. [2020-10-26 04:16:30,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:30,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 19 letters. Loop has 4 letters. [2020-10-26 04:16:30,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:30,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 15 letters. Loop has 8 letters. [2020-10-26 04:16:30,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:30,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 154 transitions. [2020-10-26 04:16:30,729 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2020-10-26 04:16:30,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 115 states and 148 transitions. [2020-10-26 04:16:30,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2020-10-26 04:16:30,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2020-10-26 04:16:30,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 148 transitions. [2020-10-26 04:16:30,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:30,731 INFO L691 BuchiCegarLoop]: Abstraction has 115 states and 148 transitions. [2020-10-26 04:16:30,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 148 transitions. [2020-10-26 04:16:30,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2020-10-26 04:16:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-26 04:16:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 132 transitions. [2020-10-26 04:16:30,739 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 132 transitions. [2020-10-26 04:16:30,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:30,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 04:16:30,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-26 04:16:30,740 INFO L87 Difference]: Start difference. First operand 101 states and 132 transitions. Second operand 4 states. [2020-10-26 04:16:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:30,770 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2020-10-26 04:16:30,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 04:16:30,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 122 transitions. [2020-10-26 04:16:30,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-10-26 04:16:30,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 92 states and 116 transitions. [2020-10-26 04:16:30,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-10-26 04:16:30,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-10-26 04:16:30,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 116 transitions. [2020-10-26 04:16:30,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:30,781 INFO L691 BuchiCegarLoop]: Abstraction has 92 states and 116 transitions. [2020-10-26 04:16:30,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 116 transitions. [2020-10-26 04:16:30,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2020-10-26 04:16:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-26 04:16:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2020-10-26 04:16:30,787 INFO L714 BuchiCegarLoop]: Abstraction has 74 states and 95 transitions. [2020-10-26 04:16:30,787 INFO L594 BuchiCegarLoop]: Abstraction has 74 states and 95 transitions. [2020-10-26 04:16:30,787 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-26 04:16:30,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 95 transitions. [2020-10-26 04:16:30,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-26 04:16:30,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:30,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:30,789 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 3, 3, 2, 2, 2, 1, 1] [2020-10-26 04:16:30,789 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:16:30,789 INFO L794 eck$LassoCheckResult]: Stem: 1459#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1460#L18-1 assume !!(main_~i~0 > 0); 1487#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1484#L12-2 assume !(10 == main_~i~0); 1482#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1480#L18-1 assume !!(main_~i~0 > 0); 1477#L12 assume !(1 == main_~i~0); 1479#L12-2 assume !(10 == main_~i~0); 1478#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1476#L18-1 assume !!(main_~i~0 > 0); 1475#L12 assume !(1 == main_~i~0); 1474#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 1469#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1463#L18-1 assume !!(main_~i~0 > 0); 1464#L12 assume !(1 == main_~i~0); 1468#L12-2 assume !(10 == main_~i~0); 1514#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1512#L18-1 assume !!(main_~i~0 > 0); 1510#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1466#L12-2 [2020-10-26 04:16:30,790 INFO L796 eck$LassoCheckResult]: Loop: 1466#L12-2 assume !(10 == main_~i~0); 1528#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1527#L18-1 assume !!(main_~i~0 > 0); 1465#L12 assume 1 == main_~i~0;main_~up~0 := 1; 1466#L12-2 [2020-10-26 04:16:30,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:30,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1376811083, now seen corresponding path program 2 times [2020-10-26 04:16:30,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:30,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739585750] [2020-10-26 04:16:30,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-26 04:16:30,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739585750] [2020-10-26 04:16:30,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924279861] [2020-10-26 04:16:30,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:30,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 04:16:30,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:16:30,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:16:30,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:30,869 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-26 04:16:30,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:30,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-10-26 04:16:30,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943120044] [2020-10-26 04:16:30,879 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:16:30,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:30,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1573480, now seen corresponding path program 2 times [2020-10-26 04:16:30,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:30,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998542480] [2020-10-26 04:16:30,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:30,895 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:30,900 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:30,901 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:30,945 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:30,945 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:30,945 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:30,945 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:30,945 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 04:16:30,945 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:30,945 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:30,945 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:30,945 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration9_Loop [2020-10-26 04:16:30,945 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:30,946 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:30,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:30,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:30,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:30,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:31,042 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:31,042 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:31,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:31,058 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 61 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 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:31,087 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 04:16:31,087 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:31,147 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 04:16:31,149 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:31,149 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:31,149 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:31,149 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:31,149 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:16:31,149 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:31,149 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:31,149 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:31,149 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration9_Loop [2020-10-26 04:16:31,149 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:31,150 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:31,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:31,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:31,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:31,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:31,244 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:31,244 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:31,248 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 [2020-10-26 04:16:31,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:31,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:31,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:31,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:31,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:31,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:16:31,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:16:31,253 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:16:31,256 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-26 04:16:31,256 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:31,260 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:16:31,260 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 04:16:31,261 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:16:31,261 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2020-10-26 04:16:31,283 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 04:16:31,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:31,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:16:31,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:31,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:16:31,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:16:31,363 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 [2020-10-26 04:16:31,364 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 95 transitions. cyclomatic complexity: 30 Second operand 5 states. [2020-10-26 04:16:31,487 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 95 transitions. cyclomatic complexity: 30. Second operand 5 states. Result 133 states and 164 transitions. Complement of second has 9 states. [2020-10-26 04:16:31,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-26 04:16:31,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 04:16:31,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-10-26 04:16:31,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 19 letters. Loop has 4 letters. [2020-10-26 04:16:31,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:31,490 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 04:16:31,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:31,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:16:31,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:31,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:16:31,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:16:31,568 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-26 04:16:31,568 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 95 transitions. cyclomatic complexity: 30 Second operand 5 states. [2020-10-26 04:16:31,645 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 95 transitions. cyclomatic complexity: 30. Second operand 5 states. Result 133 states and 164 transitions. Complement of second has 9 states. [2020-10-26 04:16:31,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-26 04:16:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 04:16:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-10-26 04:16:31,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 19 letters. Loop has 4 letters. [2020-10-26 04:16:31,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:31,647 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 04:16:31,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:31,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:16:31,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:31,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:16:31,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:16:31,727 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-26 04:16:31,727 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 95 transitions. cyclomatic complexity: 30 Second operand 5 states. [2020-10-26 04:16:31,823 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 95 transitions. cyclomatic complexity: 30. Second operand 5 states. Result 142 states and 176 transitions. Complement of second has 8 states. [2020-10-26 04:16:31,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-26 04:16:31,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 04:16:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-10-26 04:16:31,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 19 letters. Loop has 4 letters. [2020-10-26 04:16:31,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:31,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 23 letters. Loop has 4 letters. [2020-10-26 04:16:31,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:31,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 19 letters. Loop has 8 letters. [2020-10-26 04:16:31,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:31,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 176 transitions. [2020-10-26 04:16:31,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2020-10-26 04:16:31,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 98 states and 123 transitions. [2020-10-26 04:16:31,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2020-10-26 04:16:31,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-10-26 04:16:31,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 123 transitions. [2020-10-26 04:16:31,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:31,832 INFO L691 BuchiCegarLoop]: Abstraction has 98 states and 123 transitions. [2020-10-26 04:16:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 123 transitions. [2020-10-26 04:16:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 79. [2020-10-26 04:16:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-26 04:16:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2020-10-26 04:16:31,836 INFO L714 BuchiCegarLoop]: Abstraction has 79 states and 101 transitions. [2020-10-26 04:16:31,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:31,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 04:16:31,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-26 04:16:31,837 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand 5 states. [2020-10-26 04:16:31,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:31,911 INFO L93 Difference]: Finished difference Result 129 states and 157 transitions. [2020-10-26 04:16:31,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 04:16:31,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 157 transitions. [2020-10-26 04:16:31,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2020-10-26 04:16:31,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 125 states and 153 transitions. [2020-10-26 04:16:31,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-10-26 04:16:31,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-10-26 04:16:31,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 153 transitions. [2020-10-26 04:16:31,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:31,918 INFO L691 BuchiCegarLoop]: Abstraction has 125 states and 153 transitions. [2020-10-26 04:16:31,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 153 transitions. [2020-10-26 04:16:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 91. [2020-10-26 04:16:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-26 04:16:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2020-10-26 04:16:31,927 INFO L714 BuchiCegarLoop]: Abstraction has 91 states and 113 transitions. [2020-10-26 04:16:31,927 INFO L594 BuchiCegarLoop]: Abstraction has 91 states and 113 transitions. [2020-10-26 04:16:31,927 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-26 04:16:31,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 113 transitions. [2020-10-26 04:16:31,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-26 04:16:31,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:31,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:31,929 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 4, 4, 3, 2, 2, 1, 1] [2020-10-26 04:16:31,929 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 2, 1, 1] [2020-10-26 04:16:31,930 INFO L794 eck$LassoCheckResult]: Stem: 2465#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2466#L18-1 assume !!(main_~i~0 > 0); 2508#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2506#L12-2 assume !(10 == main_~i~0); 2504#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2502#L18-1 assume !!(main_~i~0 > 0); 2501#L12 assume !(1 == main_~i~0); 2500#L12-2 assume !(10 == main_~i~0); 2499#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2498#L18-1 assume !!(main_~i~0 > 0); 2482#L12 assume !(1 == main_~i~0); 2488#L12-2 assume !(10 == main_~i~0); 2483#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2481#L18-1 assume !!(main_~i~0 > 0); 2480#L12 assume !(1 == main_~i~0); 2479#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2475#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2476#L18-1 assume !!(main_~i~0 > 0); 2547#L12 assume !(1 == main_~i~0); 2540#L12-2 assume !(10 == main_~i~0); 2545#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2543#L18-1 assume !!(main_~i~0 > 0); 2539#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2525#L12-2 [2020-10-26 04:16:31,934 INFO L796 eck$LassoCheckResult]: Loop: 2525#L12-2 assume !(10 == main_~i~0); 2523#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2522#L18-1 assume !!(main_~i~0 > 0); 2520#L12 assume !(1 == main_~i~0); 2519#L12-2 assume !(10 == main_~i~0); 2518#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2517#L18-1 assume !!(main_~i~0 > 0); 2516#L12 assume !(1 == main_~i~0); 2515#L12-2 assume !(10 == main_~i~0); 2496#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2492#L18-1 assume !!(main_~i~0 > 0); 2489#L12 assume !(1 == main_~i~0); 2490#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2485#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2548#L18-1 assume !!(main_~i~0 > 0); 2487#L12 assume !(1 == main_~i~0); 2486#L12-2 assume !(10 == main_~i~0); 2477#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2478#L18-1 assume !!(main_~i~0 > 0); 2491#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2525#L12-2 [2020-10-26 04:16:31,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:31,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2134050740, now seen corresponding path program 3 times [2020-10-26 04:16:31,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:31,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965181159] [2020-10-26 04:16:31,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-26 04:16:31,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965181159] [2020-10-26 04:16:31,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797524491] [2020-10-26 04:16:31,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-10-26 04:16:32,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-26 04:16:32,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:16:32,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:16:32,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-26 04:16:32,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:32,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2020-10-26 04:16:32,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066213857] [2020-10-26 04:16:32,075 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:16:32,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:32,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1620775762, now seen corresponding path program 1 times [2020-10-26 04:16:32,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:32,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807512443] [2020-10-26 04:16:32,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-26 04:16:32,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807512443] [2020-10-26 04:16:32,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344812262] [2020-10-26 04:16:32,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:32,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:16:32,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-26 04:16:32,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:32,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-10-26 04:16:32,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576687756] [2020-10-26 04:16:32,158 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:16:32,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:32,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 04:16:32,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-26 04:16:32,159 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. cyclomatic complexity: 31 Second operand 5 states. [2020-10-26 04:16:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:32,209 INFO L93 Difference]: Finished difference Result 116 states and 144 transitions. [2020-10-26 04:16:32,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 04:16:32,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 144 transitions. [2020-10-26 04:16:32,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2020-10-26 04:16:32,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 144 transitions. [2020-10-26 04:16:32,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-10-26 04:16:32,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-10-26 04:16:32,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 144 transitions. [2020-10-26 04:16:32,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:32,213 INFO L691 BuchiCegarLoop]: Abstraction has 116 states and 144 transitions. [2020-10-26 04:16:32,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 144 transitions. [2020-10-26 04:16:32,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2020-10-26 04:16:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-26 04:16:32,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2020-10-26 04:16:32,217 INFO L714 BuchiCegarLoop]: Abstraction has 103 states and 127 transitions. [2020-10-26 04:16:32,217 INFO L594 BuchiCegarLoop]: Abstraction has 103 states and 127 transitions. [2020-10-26 04:16:32,217 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-26 04:16:32,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 127 transitions. [2020-10-26 04:16:32,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2020-10-26 04:16:32,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:32,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:32,220 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 5, 5, 3, 3, 2, 1, 1] [2020-10-26 04:16:32,220 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 3, 3, 1, 1] [2020-10-26 04:16:32,220 INFO L794 eck$LassoCheckResult]: Stem: 2810#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2811#L18-1 assume !!(main_~i~0 > 0); 2841#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2838#L12-2 assume !(10 == main_~i~0); 2836#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2834#L18-1 assume !!(main_~i~0 > 0); 2833#L12 assume !(1 == main_~i~0); 2832#L12-2 assume !(10 == main_~i~0); 2831#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2830#L18-1 assume !!(main_~i~0 > 0); 2827#L12 assume !(1 == main_~i~0); 2829#L12-2 assume !(10 == main_~i~0); 2828#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2826#L18-1 assume !!(main_~i~0 > 0); 2825#L12 assume !(1 == main_~i~0); 2824#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2818#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2819#L18-1 assume !!(main_~i~0 > 0); 2905#L12 assume !(1 == main_~i~0); 2904#L12-2 assume !(10 == main_~i~0); 2902#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2900#L18-1 assume !!(main_~i~0 > 0); 2899#L12 assume !(1 == main_~i~0); 2871#L12-2 assume !(10 == main_~i~0); 2889#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2886#L18-1 assume !!(main_~i~0 > 0); 2870#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2867#L12-2 [2020-10-26 04:16:32,221 INFO L796 eck$LassoCheckResult]: Loop: 2867#L12-2 assume !(10 == main_~i~0); 2853#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2881#L18-1 assume !!(main_~i~0 > 0); 2879#L12 assume !(1 == main_~i~0); 2877#L12-2 assume !(10 == main_~i~0); 2875#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2873#L18-1 assume !!(main_~i~0 > 0); 2872#L12 assume !(1 == main_~i~0); 2868#L12-2 assume !(10 == main_~i~0); 2856#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2864#L18-1 assume !!(main_~i~0 > 0); 2860#L12 assume !(1 == main_~i~0); 2855#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 2822#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2823#L18-1 assume !!(main_~i~0 > 0); 2894#L12 assume !(1 == main_~i~0); 2892#L12-2 assume !(10 == main_~i~0); 2893#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2812#L18-1 assume !!(main_~i~0 > 0); 2813#L12 assume !(1 == main_~i~0); 2850#L12-2 assume !(10 == main_~i~0); 2851#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2884#L18-1 assume !!(main_~i~0 > 0); 2869#L12 assume 1 == main_~i~0;main_~up~0 := 1; 2867#L12-2 [2020-10-26 04:16:32,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:32,221 INFO L82 PathProgramCache]: Analyzing trace with hash 442904351, now seen corresponding path program 4 times [2020-10-26 04:16:32,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:32,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323779449] [2020-10-26 04:16:32,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 47 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-26 04:16:32,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323779449] [2020-10-26 04:16:32,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745609773] [2020-10-26 04:16:32,285 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:32,309 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-26 04:16:32,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:16:32,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:16:32,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 47 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-26 04:16:32,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:32,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-10-26 04:16:32,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010414363] [2020-10-26 04:16:32,335 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:16:32,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:32,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1417462851, now seen corresponding path program 2 times [2020-10-26 04:16:32,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:32,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030945807] [2020-10-26 04:16:32,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-26 04:16:32,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030945807] [2020-10-26 04:16:32,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317865943] [2020-10-26 04:16:32,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:32,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 04:16:32,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:16:32,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:16:32,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-26 04:16:32,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:32,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-10-26 04:16:32,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214060004] [2020-10-26 04:16:32,416 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:16:32,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:32,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 04:16:32,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-26 04:16:32,417 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. cyclomatic complexity: 33 Second operand 6 states. [2020-10-26 04:16:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:32,488 INFO L93 Difference]: Finished difference Result 132 states and 163 transitions. [2020-10-26 04:16:32,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 04:16:32,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 163 transitions. [2020-10-26 04:16:32,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2020-10-26 04:16:32,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 132 states and 163 transitions. [2020-10-26 04:16:32,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2020-10-26 04:16:32,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2020-10-26 04:16:32,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 163 transitions. [2020-10-26 04:16:32,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:32,494 INFO L691 BuchiCegarLoop]: Abstraction has 132 states and 163 transitions. [2020-10-26 04:16:32,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 163 transitions. [2020-10-26 04:16:32,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 115. [2020-10-26 04:16:32,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-10-26 04:16:32,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2020-10-26 04:16:32,498 INFO L714 BuchiCegarLoop]: Abstraction has 115 states and 141 transitions. [2020-10-26 04:16:32,498 INFO L594 BuchiCegarLoop]: Abstraction has 115 states and 141 transitions. [2020-10-26 04:16:32,498 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-26 04:16:32,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 141 transitions. [2020-10-26 04:16:32,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2020-10-26 04:16:32,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:32,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:32,501 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 6, 6, 4, 3, 2, 1, 1] [2020-10-26 04:16:32,501 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 4, 3, 1, 1] [2020-10-26 04:16:32,502 INFO L794 eck$LassoCheckResult]: Stem: 3204#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 3205#L18-1 assume !!(main_~i~0 > 0); 3252#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3249#L12-2 assume !(10 == main_~i~0); 3247#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3245#L18-1 assume !!(main_~i~0 > 0); 3244#L12 assume !(1 == main_~i~0); 3243#L12-2 assume !(10 == main_~i~0); 3242#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3239#L18-1 assume !!(main_~i~0 > 0); 3229#L12 assume !(1 == main_~i~0); 3232#L12-2 assume !(10 == main_~i~0); 3230#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3228#L18-1 assume !!(main_~i~0 > 0); 3226#L12 assume !(1 == main_~i~0); 3223#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 3212#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3213#L18-1 assume !!(main_~i~0 > 0); 3269#L12 assume !(1 == main_~i~0); 3268#L12-2 assume !(10 == main_~i~0); 3267#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3266#L18-1 assume !!(main_~i~0 > 0); 3265#L12 assume !(1 == main_~i~0); 3264#L12-2 assume !(10 == main_~i~0); 3263#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3262#L18-1 assume !!(main_~i~0 > 0); 3261#L12 assume !(1 == main_~i~0); 3234#L12-2 assume !(10 == main_~i~0); 3240#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3237#L18-1 assume !!(main_~i~0 > 0); 3233#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3231#L12-2 [2020-10-26 04:16:32,502 INFO L796 eck$LassoCheckResult]: Loop: 3231#L12-2 assume !(10 == main_~i~0); 3221#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3206#L18-1 assume !!(main_~i~0 > 0); 3207#L12 assume !(1 == main_~i~0); 3295#L12-2 assume !(10 == main_~i~0); 3293#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3291#L18-1 assume !!(main_~i~0 > 0); 3289#L12 assume !(1 == main_~i~0); 3288#L12-2 assume !(10 == main_~i~0); 3278#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3285#L18-1 assume !!(main_~i~0 > 0); 3281#L12 assume !(1 == main_~i~0); 3277#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 3201#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3217#L18-1 assume !!(main_~i~0 > 0); 3282#L12 assume !(1 == main_~i~0); 3279#L12-2 assume !(10 == main_~i~0); 3276#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3275#L18-1 assume !!(main_~i~0 > 0); 3274#L12 assume !(1 == main_~i~0); 3273#L12-2 assume !(10 == main_~i~0); 3272#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3271#L18-1 assume !!(main_~i~0 > 0); 3270#L12 assume !(1 == main_~i~0); 3236#L12-2 assume !(10 == main_~i~0); 3241#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3238#L18-1 assume !!(main_~i~0 > 0); 3235#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3231#L12-2 [2020-10-26 04:16:32,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:32,503 INFO L82 PathProgramCache]: Analyzing trace with hash 261204234, now seen corresponding path program 5 times [2020-10-26 04:16:32,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:32,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660943771] [2020-10-26 04:16:32,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 62 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-26 04:16:32,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660943771] [2020-10-26 04:16:32,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543282134] [2020-10-26 04:16:32,544 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:32,590 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-26 04:16:32,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:16:32,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:16:32,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 62 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-26 04:16:32,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:32,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-10-26 04:16:32,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36824001] [2020-10-26 04:16:32,609 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:16:32,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:32,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2080061096, now seen corresponding path program 3 times [2020-10-26 04:16:32,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:32,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385509741] [2020-10-26 04:16:32,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:32,685 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-26 04:16:32,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385509741] [2020-10-26 04:16:32,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76739215] [2020-10-26 04:16:32,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:32,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-26 04:16:32,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:16:32,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 04:16:32,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-26 04:16:32,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:32,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-10-26 04:16:32,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711587524] [2020-10-26 04:16:32,755 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:16:32,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:32,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 04:16:32,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-26 04:16:32,757 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. cyclomatic complexity: 35 Second operand 7 states. [2020-10-26 04:16:32,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:32,826 INFO L93 Difference]: Finished difference Result 148 states and 182 transitions. [2020-10-26 04:16:32,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 04:16:32,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 182 transitions. [2020-10-26 04:16:32,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2020-10-26 04:16:32,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 148 states and 182 transitions. [2020-10-26 04:16:32,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-10-26 04:16:32,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2020-10-26 04:16:32,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 182 transitions. [2020-10-26 04:16:32,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:32,830 INFO L691 BuchiCegarLoop]: Abstraction has 148 states and 182 transitions. [2020-10-26 04:16:32,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 182 transitions. [2020-10-26 04:16:32,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2020-10-26 04:16:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-26 04:16:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2020-10-26 04:16:32,835 INFO L714 BuchiCegarLoop]: Abstraction has 127 states and 155 transitions. [2020-10-26 04:16:32,835 INFO L594 BuchiCegarLoop]: Abstraction has 127 states and 155 transitions. [2020-10-26 04:16:32,835 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-26 04:16:32,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 155 transitions. [2020-10-26 04:16:32,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2020-10-26 04:16:32,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:32,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:32,842 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 7, 7, 5, 3, 2, 1, 1] [2020-10-26 04:16:32,843 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 5, 3, 1, 1] [2020-10-26 04:16:32,844 INFO L794 eck$LassoCheckResult]: Stem: 3652#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 3653#L18-1 assume !!(main_~i~0 > 0); 3699#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3696#L12-2 assume !(10 == main_~i~0); 3694#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3692#L18-1 assume !!(main_~i~0 > 0); 3691#L12 assume !(1 == main_~i~0); 3690#L12-2 assume !(10 == main_~i~0); 3689#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3686#L18-1 assume !!(main_~i~0 > 0); 3676#L12 assume !(1 == main_~i~0); 3679#L12-2 assume !(10 == main_~i~0); 3677#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3675#L18-1 assume !!(main_~i~0 > 0); 3673#L12 assume !(1 == main_~i~0); 3670#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 3660#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3661#L18-1 assume !!(main_~i~0 > 0); 3720#L12 assume !(1 == main_~i~0); 3719#L12-2 assume !(10 == main_~i~0); 3718#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3717#L18-1 assume !!(main_~i~0 > 0); 3716#L12 assume !(1 == main_~i~0); 3715#L12-2 assume !(10 == main_~i~0); 3714#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3713#L18-1 assume !!(main_~i~0 > 0); 3712#L12 assume !(1 == main_~i~0); 3711#L12-2 assume !(10 == main_~i~0); 3710#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3709#L18-1 assume !!(main_~i~0 > 0); 3708#L12 assume !(1 == main_~i~0); 3681#L12-2 assume !(10 == main_~i~0); 3687#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3684#L18-1 assume !!(main_~i~0 > 0); 3680#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3678#L12-2 [2020-10-26 04:16:32,845 INFO L796 eck$LassoCheckResult]: Loop: 3678#L12-2 assume !(10 == main_~i~0); 3668#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3754#L18-1 assume !!(main_~i~0 > 0); 3752#L12 assume !(1 == main_~i~0); 3748#L12-2 assume !(10 == main_~i~0); 3746#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3745#L18-1 assume !!(main_~i~0 > 0); 3743#L12 assume !(1 == main_~i~0); 3741#L12-2 assume !(10 == main_~i~0); 3735#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3738#L18-1 assume !!(main_~i~0 > 0); 3736#L12 assume !(1 == main_~i~0); 3734#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 3649#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3664#L18-1 assume !!(main_~i~0 > 0); 3732#L12 assume !(1 == main_~i~0); 3733#L12-2 assume !(10 == main_~i~0); 3731#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3730#L18-1 assume !!(main_~i~0 > 0); 3729#L12 assume !(1 == main_~i~0); 3728#L12-2 assume !(10 == main_~i~0); 3727#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3726#L18-1 assume !!(main_~i~0 > 0); 3725#L12 assume !(1 == main_~i~0); 3724#L12-2 assume !(10 == main_~i~0); 3723#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3722#L18-1 assume !!(main_~i~0 > 0); 3721#L12 assume !(1 == main_~i~0); 3683#L12-2 assume !(10 == main_~i~0); 3688#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3685#L18-1 assume !!(main_~i~0 > 0); 3682#L12 assume 1 == main_~i~0;main_~up~0 := 1; 3678#L12-2 [2020-10-26 04:16:32,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:32,846 INFO L82 PathProgramCache]: Analyzing trace with hash 759706997, now seen corresponding path program 6 times [2020-10-26 04:16:32,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:32,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893688019] [2020-10-26 04:16:32,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 77 proven. 15 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-26 04:16:32,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893688019] [2020-10-26 04:16:32,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602232938] [2020-10-26 04:16:32,911 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:32,944 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2020-10-26 04:16:32,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:16:32,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 04:16:32,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:33,030 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 71 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-26 04:16:33,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:33,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-10-26 04:16:33,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693974359] [2020-10-26 04:16:33,031 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:16:33,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:33,032 INFO L82 PathProgramCache]: Analyzing trace with hash 148227091, now seen corresponding path program 4 times [2020-10-26 04:16:33,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:33,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876224051] [2020-10-26 04:16:33,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:33,095 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 61 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-26 04:16:33,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876224051] [2020-10-26 04:16:33,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869214551] [2020-10-26 04:16:33,096 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:33,135 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-26 04:16:33,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:16:33,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 04:16:33,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 61 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-26 04:16:33,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:33,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-10-26 04:16:33,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370016057] [2020-10-26 04:16:33,152 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:16:33,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:33,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 04:16:33,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-26 04:16:33,153 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. cyclomatic complexity: 37 Second operand 8 states. [2020-10-26 04:16:33,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:33,247 INFO L93 Difference]: Finished difference Result 164 states and 201 transitions. [2020-10-26 04:16:33,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 04:16:33,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 201 transitions. [2020-10-26 04:16:33,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2020-10-26 04:16:33,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 164 states and 201 transitions. [2020-10-26 04:16:33,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2020-10-26 04:16:33,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2020-10-26 04:16:33,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 201 transitions. [2020-10-26 04:16:33,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:33,251 INFO L691 BuchiCegarLoop]: Abstraction has 164 states and 201 transitions. [2020-10-26 04:16:33,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 201 transitions. [2020-10-26 04:16:33,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 139. [2020-10-26 04:16:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-10-26 04:16:33,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 169 transitions. [2020-10-26 04:16:33,254 INFO L714 BuchiCegarLoop]: Abstraction has 139 states and 169 transitions. [2020-10-26 04:16:33,255 INFO L594 BuchiCegarLoop]: Abstraction has 139 states and 169 transitions. [2020-10-26 04:16:33,255 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-26 04:16:33,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 169 transitions. [2020-10-26 04:16:33,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2020-10-26 04:16:33,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:33,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:33,257 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 8, 8, 6, 3, 2, 1, 1] [2020-10-26 04:16:33,257 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 6, 3, 1, 1] [2020-10-26 04:16:33,257 INFO L794 eck$LassoCheckResult]: Stem: 4159#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 4160#L18-1 assume !!(main_~i~0 > 0); 4207#L12 assume 1 == main_~i~0;main_~up~0 := 1; 4204#L12-2 assume !(10 == main_~i~0); 4202#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4200#L18-1 assume !!(main_~i~0 > 0); 4199#L12 assume !(1 == main_~i~0); 4198#L12-2 assume !(10 == main_~i~0); 4197#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4194#L18-1 assume !!(main_~i~0 > 0); 4184#L12 assume !(1 == main_~i~0); 4187#L12-2 assume !(10 == main_~i~0); 4185#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4183#L18-1 assume !!(main_~i~0 > 0); 4181#L12 assume !(1 == main_~i~0); 4178#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 4167#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4168#L18-1 assume !!(main_~i~0 > 0); 4278#L12 assume !(1 == main_~i~0); 4277#L12-2 assume !(10 == main_~i~0); 4274#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4272#L18-1 assume !!(main_~i~0 > 0); 4270#L12 assume !(1 == main_~i~0); 4269#L12-2 assume !(10 == main_~i~0); 4268#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4266#L18-1 assume !!(main_~i~0 > 0); 4264#L12 assume !(1 == main_~i~0); 4261#L12-2 assume !(10 == main_~i~0); 4258#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4256#L18-1 assume !!(main_~i~0 > 0); 4253#L12 assume !(1 == main_~i~0); 4241#L12-2 assume !(10 == main_~i~0); 4238#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4234#L18-1 assume !!(main_~i~0 > 0); 4233#L12 assume !(1 == main_~i~0); 4191#L12-2 assume !(10 == main_~i~0); 4196#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4193#L18-1 assume !!(main_~i~0 > 0); 4190#L12 assume 1 == main_~i~0;main_~up~0 := 1; 4186#L12-2 [2020-10-26 04:16:33,258 INFO L796 eck$LassoCheckResult]: Loop: 4186#L12-2 assume !(10 == main_~i~0); 4176#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4161#L18-1 assume !!(main_~i~0 > 0); 4162#L12 assume !(1 == main_~i~0); 4237#L12-2 assume !(10 == main_~i~0); 4267#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4265#L18-1 assume !!(main_~i~0 > 0); 4263#L12 assume !(1 == main_~i~0); 4260#L12-2 assume !(10 == main_~i~0); 4240#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4255#L18-1 assume !!(main_~i~0 > 0); 4252#L12 assume !(1 == main_~i~0); 4239#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 4156#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4172#L18-1 assume !!(main_~i~0 > 0); 4232#L12 assume !(1 == main_~i~0); 4231#L12-2 assume !(10 == main_~i~0); 4230#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4229#L18-1 assume !!(main_~i~0 > 0); 4228#L12 assume !(1 == main_~i~0); 4227#L12-2 assume !(10 == main_~i~0); 4226#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4225#L18-1 assume !!(main_~i~0 > 0); 4224#L12 assume !(1 == main_~i~0); 4223#L12-2 assume !(10 == main_~i~0); 4222#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4221#L18-1 assume !!(main_~i~0 > 0); 4220#L12 assume !(1 == main_~i~0); 4219#L12-2 assume !(10 == main_~i~0); 4218#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4217#L18-1 assume !!(main_~i~0 > 0); 4216#L12 assume !(1 == main_~i~0); 4189#L12-2 assume !(10 == main_~i~0); 4195#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4192#L18-1 assume !!(main_~i~0 > 0); 4188#L12 assume 1 == main_~i~0;main_~up~0 := 1; 4186#L12-2 [2020-10-26 04:16:33,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:33,258 INFO L82 PathProgramCache]: Analyzing trace with hash 985437280, now seen corresponding path program 7 times [2020-10-26 04:16:33,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:33,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243504585] [2020-10-26 04:16:33,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 92 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-26 04:16:33,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243504585] [2020-10-26 04:16:33,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588936575] [2020-10-26 04:16:33,299 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:33,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:16:33,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 92 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-26 04:16:33,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:33,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-10-26 04:16:33,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443627853] [2020-10-26 04:16:33,354 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:16:33,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:33,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1636148222, now seen corresponding path program 5 times [2020-10-26 04:16:33,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:33,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042276620] [2020-10-26 04:16:33,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 74 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-26 04:16:33,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042276620] [2020-10-26 04:16:33,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173066833] [2020-10-26 04:16:33,427 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:33,458 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2020-10-26 04:16:33,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:16:33,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 04:16:33,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 74 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-26 04:16:33,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:33,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-10-26 04:16:33,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903830972] [2020-10-26 04:16:33,479 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:16:33,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:33,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-26 04:16:33,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-26 04:16:33,480 INFO L87 Difference]: Start difference. First operand 139 states and 169 transitions. cyclomatic complexity: 39 Second operand 9 states. [2020-10-26 04:16:33,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:33,586 INFO L93 Difference]: Finished difference Result 180 states and 220 transitions. [2020-10-26 04:16:33,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 04:16:33,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 220 transitions. [2020-10-26 04:16:33,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-10-26 04:16:33,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 180 states and 220 transitions. [2020-10-26 04:16:33,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-10-26 04:16:33,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-10-26 04:16:33,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 220 transitions. [2020-10-26 04:16:33,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:33,599 INFO L691 BuchiCegarLoop]: Abstraction has 180 states and 220 transitions. [2020-10-26 04:16:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 220 transitions. [2020-10-26 04:16:33,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 151. [2020-10-26 04:16:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-10-26 04:16:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 183 transitions. [2020-10-26 04:16:33,603 INFO L714 BuchiCegarLoop]: Abstraction has 151 states and 183 transitions. [2020-10-26 04:16:33,603 INFO L594 BuchiCegarLoop]: Abstraction has 151 states and 183 transitions. [2020-10-26 04:16:33,603 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-26 04:16:33,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 183 transitions. [2020-10-26 04:16:33,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2020-10-26 04:16:33,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:33,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:33,608 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 9, 9, 7, 3, 2, 1, 1] [2020-10-26 04:16:33,609 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 7, 3, 1, 1] [2020-10-26 04:16:33,609 INFO L794 eck$LassoCheckResult]: Stem: 4713#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 4714#L18-1 assume !!(main_~i~0 > 0); 4762#L12 assume 1 == main_~i~0;main_~up~0 := 1; 4759#L12-2 assume !(10 == main_~i~0); 4756#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4754#L18-1 assume !!(main_~i~0 > 0); 4752#L12 assume !(1 == main_~i~0); 4751#L12-2 assume !(10 == main_~i~0); 4750#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4747#L18-1 assume !!(main_~i~0 > 0); 4737#L12 assume !(1 == main_~i~0); 4740#L12-2 assume !(10 == main_~i~0); 4738#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4736#L18-1 assume !!(main_~i~0 > 0); 4734#L12 assume !(1 == main_~i~0); 4731#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 4721#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4722#L18-1 assume !!(main_~i~0 > 0); 4789#L12 assume !(1 == main_~i~0); 4788#L12-2 assume !(10 == main_~i~0); 4787#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4786#L18-1 assume !!(main_~i~0 > 0); 4785#L12 assume !(1 == main_~i~0); 4784#L12-2 assume !(10 == main_~i~0); 4783#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4782#L18-1 assume !!(main_~i~0 > 0); 4781#L12 assume !(1 == main_~i~0); 4780#L12-2 assume !(10 == main_~i~0); 4779#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4778#L18-1 assume !!(main_~i~0 > 0); 4777#L12 assume !(1 == main_~i~0); 4776#L12-2 assume !(10 == main_~i~0); 4775#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4774#L18-1 assume !!(main_~i~0 > 0); 4773#L12 assume !(1 == main_~i~0); 4772#L12-2 assume !(10 == main_~i~0); 4771#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4770#L18-1 assume !!(main_~i~0 > 0); 4769#L12 assume !(1 == main_~i~0); 4742#L12-2 assume !(10 == main_~i~0); 4748#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4745#L18-1 assume !!(main_~i~0 > 0); 4741#L12 assume 1 == main_~i~0;main_~up~0 := 1; 4739#L12-2 [2020-10-26 04:16:33,609 INFO L796 eck$LassoCheckResult]: Loop: 4739#L12-2 assume !(10 == main_~i~0); 4729#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4832#L18-1 assume !!(main_~i~0 > 0); 4830#L12 assume !(1 == main_~i~0); 4826#L12-2 assume !(10 == main_~i~0); 4824#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4822#L18-1 assume !!(main_~i~0 > 0); 4821#L12 assume !(1 == main_~i~0); 4819#L12-2 assume !(10 == main_~i~0); 4810#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4815#L18-1 assume !!(main_~i~0 > 0); 4812#L12 assume !(1 == main_~i~0); 4809#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 4710#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4725#L18-1 assume !!(main_~i~0 > 0); 4814#L12 assume !(1 == main_~i~0); 4811#L12-2 assume !(10 == main_~i~0); 4808#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4807#L18-1 assume !!(main_~i~0 > 0); 4806#L12 assume !(1 == main_~i~0); 4805#L12-2 assume !(10 == main_~i~0); 4804#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4803#L18-1 assume !!(main_~i~0 > 0); 4802#L12 assume !(1 == main_~i~0); 4801#L12-2 assume !(10 == main_~i~0); 4800#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4799#L18-1 assume !!(main_~i~0 > 0); 4798#L12 assume !(1 == main_~i~0); 4797#L12-2 assume !(10 == main_~i~0); 4796#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4795#L18-1 assume !!(main_~i~0 > 0); 4794#L12 assume !(1 == main_~i~0); 4793#L12-2 assume !(10 == main_~i~0); 4792#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4791#L18-1 assume !!(main_~i~0 > 0); 4790#L12 assume !(1 == main_~i~0); 4744#L12-2 assume !(10 == main_~i~0); 4749#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4746#L18-1 assume !!(main_~i~0 > 0); 4743#L12 assume 1 == main_~i~0;main_~up~0 := 1; 4739#L12-2 [2020-10-26 04:16:33,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:33,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1480489525, now seen corresponding path program 8 times [2020-10-26 04:16:33,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:33,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853036960] [2020-10-26 04:16:33,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 107 proven. 15 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-26 04:16:33,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853036960] [2020-10-26 04:16:33,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724741097] [2020-10-26 04:16:33,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:33,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 04:16:33,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:16:33,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:16:33,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:33,708 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 107 proven. 15 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-26 04:16:33,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:33,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-10-26 04:16:33,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195921451] [2020-10-26 04:16:33,709 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:16:33,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:33,710 INFO L82 PathProgramCache]: Analyzing trace with hash 505255529, now seen corresponding path program 6 times [2020-10-26 04:16:33,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:33,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37189746] [2020-10-26 04:16:33,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 87 proven. 78 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-26 04:16:33,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37189746] [2020-10-26 04:16:33,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272270204] [2020-10-26 04:16:33,814 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:33,846 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2020-10-26 04:16:33,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:16:33,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-26 04:16:33,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:33,864 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 87 proven. 78 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-26 04:16:33,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:33,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-10-26 04:16:33,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264254609] [2020-10-26 04:16:33,866 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:16:33,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:33,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-26 04:16:33,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-26 04:16:33,867 INFO L87 Difference]: Start difference. First operand 151 states and 183 transitions. cyclomatic complexity: 41 Second operand 10 states. [2020-10-26 04:16:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:33,969 INFO L93 Difference]: Finished difference Result 196 states and 239 transitions. [2020-10-26 04:16:33,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 04:16:33,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 239 transitions. [2020-10-26 04:16:33,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2020-10-26 04:16:33,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 196 states and 239 transitions. [2020-10-26 04:16:33,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2020-10-26 04:16:33,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2020-10-26 04:16:33,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 239 transitions. [2020-10-26 04:16:33,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:33,974 INFO L691 BuchiCegarLoop]: Abstraction has 196 states and 239 transitions. [2020-10-26 04:16:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 239 transitions. [2020-10-26 04:16:33,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 163. [2020-10-26 04:16:33,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-26 04:16:33,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 197 transitions. [2020-10-26 04:16:33,978 INFO L714 BuchiCegarLoop]: Abstraction has 163 states and 197 transitions. [2020-10-26 04:16:33,978 INFO L594 BuchiCegarLoop]: Abstraction has 163 states and 197 transitions. [2020-10-26 04:16:33,979 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-10-26 04:16:33,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 197 transitions. [2020-10-26 04:16:33,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2020-10-26 04:16:33,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:33,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:33,981 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [12, 10, 10, 8, 3, 2, 1, 1] [2020-10-26 04:16:33,982 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 8, 3, 1, 1] [2020-10-26 04:16:33,982 INFO L794 eck$LassoCheckResult]: Stem: 5320#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 5321#L18-1 assume !!(main_~i~0 > 0); 5370#L12 assume 1 == main_~i~0;main_~up~0 := 1; 5367#L12-2 assume !(10 == main_~i~0); 5364#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5362#L18-1 assume !!(main_~i~0 > 0); 5360#L12 assume !(1 == main_~i~0); 5359#L12-2 assume !(10 == main_~i~0); 5358#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5355#L18-1 assume !!(main_~i~0 > 0); 5345#L12 assume !(1 == main_~i~0); 5348#L12-2 assume !(10 == main_~i~0); 5346#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5344#L18-1 assume !!(main_~i~0 > 0); 5342#L12 assume !(1 == main_~i~0); 5339#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 5328#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5329#L18-1 assume !!(main_~i~0 > 0); 5456#L12 assume !(1 == main_~i~0); 5455#L12-2 assume !(10 == main_~i~0); 5454#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5453#L18-1 assume !!(main_~i~0 > 0); 5452#L12 assume !(1 == main_~i~0); 5451#L12-2 assume !(10 == main_~i~0); 5450#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5448#L18-1 assume !!(main_~i~0 > 0); 5447#L12 assume !(1 == main_~i~0); 5446#L12-2 assume !(10 == main_~i~0); 5443#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5441#L18-1 assume !!(main_~i~0 > 0); 5439#L12 assume !(1 == main_~i~0); 5438#L12-2 assume !(10 == main_~i~0); 5437#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5435#L18-1 assume !!(main_~i~0 > 0); 5433#L12 assume !(1 == main_~i~0); 5430#L12-2 assume !(10 == main_~i~0); 5427#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5425#L18-1 assume !!(main_~i~0 > 0); 5422#L12 assume !(1 == main_~i~0); 5410#L12-2 assume !(10 == main_~i~0); 5407#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5403#L18-1 assume !!(main_~i~0 > 0); 5402#L12 assume !(1 == main_~i~0); 5352#L12-2 assume !(10 == main_~i~0); 5357#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5354#L18-1 assume !!(main_~i~0 > 0); 5351#L12 assume 1 == main_~i~0;main_~up~0 := 1; 5347#L12-2 [2020-10-26 04:16:33,982 INFO L796 eck$LassoCheckResult]: Loop: 5347#L12-2 assume !(10 == main_~i~0); 5337#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5322#L18-1 assume !!(main_~i~0 > 0); 5323#L12 assume !(1 == main_~i~0); 5406#L12-2 assume !(10 == main_~i~0); 5436#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5434#L18-1 assume !!(main_~i~0 > 0); 5432#L12 assume !(1 == main_~i~0); 5429#L12-2 assume !(10 == main_~i~0); 5409#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5424#L18-1 assume !!(main_~i~0 > 0); 5421#L12 assume !(1 == main_~i~0); 5408#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 5317#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5333#L18-1 assume !!(main_~i~0 > 0); 5401#L12 assume !(1 == main_~i~0); 5400#L12-2 assume !(10 == main_~i~0); 5399#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5398#L18-1 assume !!(main_~i~0 > 0); 5397#L12 assume !(1 == main_~i~0); 5396#L12-2 assume !(10 == main_~i~0); 5395#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5394#L18-1 assume !!(main_~i~0 > 0); 5393#L12 assume !(1 == main_~i~0); 5392#L12-2 assume !(10 == main_~i~0); 5391#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5390#L18-1 assume !!(main_~i~0 > 0); 5389#L12 assume !(1 == main_~i~0); 5388#L12-2 assume !(10 == main_~i~0); 5387#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5386#L18-1 assume !!(main_~i~0 > 0); 5385#L12 assume !(1 == main_~i~0); 5384#L12-2 assume !(10 == main_~i~0); 5383#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5382#L18-1 assume !!(main_~i~0 > 0); 5381#L12 assume !(1 == main_~i~0); 5380#L12-2 assume !(10 == main_~i~0); 5379#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5378#L18-1 assume !!(main_~i~0 > 0); 5377#L12 assume !(1 == main_~i~0); 5350#L12-2 assume !(10 == main_~i~0); 5356#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5353#L18-1 assume !!(main_~i~0 > 0); 5349#L12 assume 1 == main_~i~0;main_~up~0 := 1; 5347#L12-2 [2020-10-26 04:16:33,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:33,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1019857334, now seen corresponding path program 9 times [2020-10-26 04:16:33,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:33,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347272244] [2020-10-26 04:16:33,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 122 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-26 04:16:34,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347272244] [2020-10-26 04:16:34,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974868093] [2020-10-26 04:16:34,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:34,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2020-10-26 04:16:34,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:16:34,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 04:16:34,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 116 proven. 105 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-26 04:16:34,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:34,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 15 [2020-10-26 04:16:34,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921807355] [2020-10-26 04:16:34,218 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:16:34,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:34,218 INFO L82 PathProgramCache]: Analyzing trace with hash 256924500, now seen corresponding path program 7 times [2020-10-26 04:16:34,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:34,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173204522] [2020-10-26 04:16:34,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 105 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-26 04:16:34,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173204522] [2020-10-26 04:16:34,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771438359] [2020-10-26 04:16:34,320 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:34,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 04:16:34,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 105 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-26 04:16:34,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:34,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-10-26 04:16:34,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399883945] [2020-10-26 04:16:34,367 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:16:34,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:34,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-26 04:16:34,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-26 04:16:34,368 INFO L87 Difference]: Start difference. First operand 163 states and 197 transitions. cyclomatic complexity: 43 Second operand 11 states. [2020-10-26 04:16:34,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:34,496 INFO L93 Difference]: Finished difference Result 212 states and 258 transitions. [2020-10-26 04:16:34,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 04:16:34,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 212 states and 258 transitions. [2020-10-26 04:16:34,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2020-10-26 04:16:34,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 212 states to 212 states and 258 transitions. [2020-10-26 04:16:34,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2020-10-26 04:16:34,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2020-10-26 04:16:34,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 258 transitions. [2020-10-26 04:16:34,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:34,502 INFO L691 BuchiCegarLoop]: Abstraction has 212 states and 258 transitions. [2020-10-26 04:16:34,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 258 transitions. [2020-10-26 04:16:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 175. [2020-10-26 04:16:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-10-26 04:16:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2020-10-26 04:16:34,507 INFO L714 BuchiCegarLoop]: Abstraction has 175 states and 211 transitions. [2020-10-26 04:16:34,507 INFO L594 BuchiCegarLoop]: Abstraction has 175 states and 211 transitions. [2020-10-26 04:16:34,507 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-10-26 04:16:34,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 211 transitions. [2020-10-26 04:16:34,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2020-10-26 04:16:34,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:34,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:34,510 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [13, 11, 11, 9, 3, 2, 1, 1] [2020-10-26 04:16:34,510 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 9, 3, 1, 1] [2020-10-26 04:16:34,510 INFO L794 eck$LassoCheckResult]: Stem: 5989#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 5990#L18-1 assume !!(main_~i~0 > 0); 6039#L12 assume 1 == main_~i~0;main_~up~0 := 1; 6034#L12-2 assume !(10 == main_~i~0); 6032#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6030#L18-1 assume !!(main_~i~0 > 0); 6029#L12 assume !(1 == main_~i~0); 6028#L12-2 assume !(10 == main_~i~0); 6027#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6024#L18-1 assume !!(main_~i~0 > 0); 6014#L12 assume !(1 == main_~i~0); 6017#L12-2 assume !(10 == main_~i~0); 6015#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6013#L18-1 assume !!(main_~i~0 > 0); 6011#L12 assume !(1 == main_~i~0); 6008#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 5997#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5998#L18-1 assume !!(main_~i~0 > 0); 6133#L12 assume !(1 == main_~i~0); 6132#L12-2 assume !(10 == main_~i~0); 6131#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6130#L18-1 assume !!(main_~i~0 > 0); 6129#L12 assume !(1 == main_~i~0); 6128#L12-2 assume !(10 == main_~i~0); 6127#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6126#L18-1 assume !!(main_~i~0 > 0); 6125#L12 assume !(1 == main_~i~0); 6124#L12-2 assume !(10 == main_~i~0); 6123#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6121#L18-1 assume !!(main_~i~0 > 0); 6120#L12 assume !(1 == main_~i~0); 6119#L12-2 assume !(10 == main_~i~0); 6116#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6114#L18-1 assume !!(main_~i~0 > 0); 6112#L12 assume !(1 == main_~i~0); 6111#L12-2 assume !(10 == main_~i~0); 6110#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6108#L18-1 assume !!(main_~i~0 > 0); 6106#L12 assume !(1 == main_~i~0); 6103#L12-2 assume !(10 == main_~i~0); 6100#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6098#L18-1 assume !!(main_~i~0 > 0); 6095#L12 assume !(1 == main_~i~0); 6083#L12-2 assume !(10 == main_~i~0); 6080#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6076#L18-1 assume !!(main_~i~0 > 0); 6075#L12 assume !(1 == main_~i~0); 6019#L12-2 assume !(10 == main_~i~0); 6025#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6022#L18-1 assume !!(main_~i~0 > 0); 6018#L12 assume 1 == main_~i~0;main_~up~0 := 1; 6016#L12-2 [2020-10-26 04:16:34,511 INFO L796 eck$LassoCheckResult]: Loop: 6016#L12-2 assume !(10 == main_~i~0); 6006#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5991#L18-1 assume !!(main_~i~0 > 0); 5992#L12 assume !(1 == main_~i~0); 6079#L12-2 assume !(10 == main_~i~0); 6109#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6107#L18-1 assume !!(main_~i~0 > 0); 6105#L12 assume !(1 == main_~i~0); 6102#L12-2 assume !(10 == main_~i~0); 6082#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6097#L18-1 assume !!(main_~i~0 > 0); 6094#L12 assume !(1 == main_~i~0); 6081#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 5986#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6002#L18-1 assume !!(main_~i~0 > 0); 6074#L12 assume !(1 == main_~i~0); 6073#L12-2 assume !(10 == main_~i~0); 6072#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6071#L18-1 assume !!(main_~i~0 > 0); 6070#L12 assume !(1 == main_~i~0); 6069#L12-2 assume !(10 == main_~i~0); 6068#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6067#L18-1 assume !!(main_~i~0 > 0); 6066#L12 assume !(1 == main_~i~0); 6065#L12-2 assume !(10 == main_~i~0); 6064#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6063#L18-1 assume !!(main_~i~0 > 0); 6062#L12 assume !(1 == main_~i~0); 6061#L12-2 assume !(10 == main_~i~0); 6060#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6059#L18-1 assume !!(main_~i~0 > 0); 6058#L12 assume !(1 == main_~i~0); 6057#L12-2 assume !(10 == main_~i~0); 6056#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6055#L18-1 assume !!(main_~i~0 > 0); 6054#L12 assume !(1 == main_~i~0); 6053#L12-2 assume !(10 == main_~i~0); 6052#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6051#L18-1 assume !!(main_~i~0 > 0); 6050#L12 assume !(1 == main_~i~0); 6049#L12-2 assume !(10 == main_~i~0); 6048#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6047#L18-1 assume !!(main_~i~0 > 0); 6046#L12 assume !(1 == main_~i~0); 6021#L12-2 assume !(10 == main_~i~0); 6026#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6023#L18-1 assume !!(main_~i~0 > 0); 6020#L12 assume 1 == main_~i~0;main_~up~0 := 1; 6016#L12-2 [2020-10-26 04:16:34,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:34,511 INFO L82 PathProgramCache]: Analyzing trace with hash -890757087, now seen corresponding path program 10 times [2020-10-26 04:16:34,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:34,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072104242] [2020-10-26 04:16:34,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:34,585 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 137 proven. 15 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-26 04:16:34,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072104242] [2020-10-26 04:16:34,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773504144] [2020-10-26 04:16:34,586 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:34,621 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-26 04:16:34,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:16:34,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:16:34,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 137 proven. 15 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-26 04:16:34,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:34,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-10-26 04:16:34,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387233804] [2020-10-26 04:16:34,636 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:16:34,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:34,636 INFO L82 PathProgramCache]: Analyzing trace with hash -294604097, now seen corresponding path program 8 times [2020-10-26 04:16:34,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:34,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794458026] [2020-10-26 04:16:34,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:34,649 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:34,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:34,670 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:34,978 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 48 [2020-10-26 04:16:34,997 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:34,997 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:34,997 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:34,997 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:34,997 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 04:16:34,997 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:34,998 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:34,998 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:34,998 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration17_Loop [2020-10-26 04:16:34,998 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:34,998 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:34,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:35,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:35,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:35,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:35,091 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:35,092 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:35,095 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:35,095 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:35,123 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 04:16:35,123 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:35,128 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 04:16:35,150 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:35,150 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:35,150 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:35,150 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:35,150 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:16:35,150 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:35,150 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:35,151 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:35,151 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration17_Loop [2020-10-26 04:16:35,151 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:35,151 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:35,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:35,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:35,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:35,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:35,228 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:35,229 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:35,243 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 [2020-10-26 04:16:35,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:35,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:35,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:35,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:35,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:16:35,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:35,252 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 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:35,276 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 [2020-10-26 04:16:35,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:35,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:35,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:35,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:35,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:35,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:16:35,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:16:35,282 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:16:35,285 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-26 04:16:35,285 INFO L444 ModelExtractionUtils]: 0 out of 3 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 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:35,291 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:16:35,291 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 04:16:35,291 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:16:35,291 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-26 04:16:35,311 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 04:16:35,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:35,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:16:35,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:35,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 04:16:35,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:35,423 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-26 04:16:35,423 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-10-26 04:16:35,423 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 175 states and 211 transitions. cyclomatic complexity: 45 Second operand 7 states. [2020-10-26 04:16:35,641 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 175 states and 211 transitions. cyclomatic complexity: 45. Second operand 7 states. Result 689 states and 821 transitions. Complement of second has 19 states. [2020-10-26 04:16:35,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2020-10-26 04:16:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-26 04:16:35,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2020-10-26 04:16:35,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 51 letters. Loop has 48 letters. [2020-10-26 04:16:35,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:35,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 99 letters. Loop has 48 letters. [2020-10-26 04:16:35,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:35,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 51 letters. Loop has 96 letters. [2020-10-26 04:16:35,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:35,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 689 states and 821 transitions. [2020-10-26 04:16:35,653 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2020-10-26 04:16:35,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 689 states to 536 states and 633 transitions. [2020-10-26 04:16:35,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2020-10-26 04:16:35,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2020-10-26 04:16:35,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 536 states and 633 transitions. [2020-10-26 04:16:35,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:35,658 INFO L691 BuchiCegarLoop]: Abstraction has 536 states and 633 transitions. [2020-10-26 04:16:35,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states and 633 transitions. [2020-10-26 04:16:35,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 405. [2020-10-26 04:16:35,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-10-26 04:16:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 484 transitions. [2020-10-26 04:16:35,668 INFO L714 BuchiCegarLoop]: Abstraction has 405 states and 484 transitions. [2020-10-26 04:16:35,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:35,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 04:16:35,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-26 04:16:35,669 INFO L87 Difference]: Start difference. First operand 405 states and 484 transitions. Second operand 6 states. [2020-10-26 04:16:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:35,723 INFO L93 Difference]: Finished difference Result 277 states and 322 transitions. [2020-10-26 04:16:35,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 04:16:35,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 277 states and 322 transitions. [2020-10-26 04:16:35,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2020-10-26 04:16:35,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 277 states to 249 states and 294 transitions. [2020-10-26 04:16:35,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2020-10-26 04:16:35,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2020-10-26 04:16:35,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 249 states and 294 transitions. [2020-10-26 04:16:35,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:35,729 INFO L691 BuchiCegarLoop]: Abstraction has 249 states and 294 transitions. [2020-10-26 04:16:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states and 294 transitions. [2020-10-26 04:16:35,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 187. [2020-10-26 04:16:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-10-26 04:16:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 223 transitions. [2020-10-26 04:16:35,734 INFO L714 BuchiCegarLoop]: Abstraction has 187 states and 223 transitions. [2020-10-26 04:16:35,734 INFO L594 BuchiCegarLoop]: Abstraction has 187 states and 223 transitions. [2020-10-26 04:16:35,735 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-10-26 04:16:35,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 187 states and 223 transitions. [2020-10-26 04:16:35,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2020-10-26 04:16:35,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:35,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:35,738 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [14, 12, 12, 9, 4, 2, 1, 1] [2020-10-26 04:16:35,738 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 9, 4, 1, 1] [2020-10-26 04:16:35,738 INFO L794 eck$LassoCheckResult]: Stem: 8033#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 8034#L18-1 assume !!(main_~i~0 > 0); 8074#L12 assume 1 == main_~i~0;main_~up~0 := 1; 8071#L12-2 assume !(10 == main_~i~0); 8069#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8067#L18-1 assume !!(main_~i~0 > 0); 8066#L12 assume !(1 == main_~i~0); 8065#L12-2 assume !(10 == main_~i~0); 8064#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8063#L18-1 assume !!(main_~i~0 > 0); 8062#L12 assume !(1 == main_~i~0); 8061#L12-2 assume !(10 == main_~i~0); 8060#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8059#L18-1 assume !!(main_~i~0 > 0); 8056#L12 assume !(1 == main_~i~0); 8058#L12-2 assume !(10 == main_~i~0); 8057#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8055#L18-1 assume !!(main_~i~0 > 0); 8054#L12 assume !(1 == main_~i~0); 8051#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 8042#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8043#L18-1 assume !!(main_~i~0 > 0); 8150#L12 assume !(1 == main_~i~0); 8148#L12-2 assume !(10 == main_~i~0); 8146#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8144#L18-1 assume !!(main_~i~0 > 0); 8142#L12 assume !(1 == main_~i~0); 8140#L12-2 assume !(10 == main_~i~0); 8138#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8136#L18-1 assume !!(main_~i~0 > 0); 8134#L12 assume !(1 == main_~i~0); 8132#L12-2 assume !(10 == main_~i~0); 8130#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8128#L18-1 assume !!(main_~i~0 > 0); 8126#L12 assume !(1 == main_~i~0); 8124#L12-2 assume !(10 == main_~i~0); 8122#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8120#L18-1 assume !!(main_~i~0 > 0); 8118#L12 assume !(1 == main_~i~0); 8116#L12-2 assume !(10 == main_~i~0); 8114#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8112#L18-1 assume !!(main_~i~0 > 0); 8110#L12 assume !(1 == main_~i~0); 8108#L12-2 assume !(10 == main_~i~0); 8106#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8104#L18-1 assume !!(main_~i~0 > 0); 8102#L12 assume !(1 == main_~i~0); 8100#L12-2 assume !(10 == main_~i~0); 8098#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8096#L18-1 assume !!(main_~i~0 > 0); 8094#L12 assume !(1 == main_~i~0); 8086#L12-2 assume !(10 == main_~i~0); 8091#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8089#L18-1 assume !!(main_~i~0 > 0); 8085#L12 assume 1 == main_~i~0;main_~up~0 := 1; 8084#L12-2 [2020-10-26 04:16:35,738 INFO L796 eck$LassoCheckResult]: Loop: 8084#L12-2 assume !(10 == main_~i~0); 8049#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8205#L18-1 assume !!(main_~i~0 > 0); 8155#L12 assume !(1 == main_~i~0); 8047#L12-2 assume !(10 == main_~i~0); 8044#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8045#L18-1 assume !!(main_~i~0 > 0); 8204#L12 assume !(1 == main_~i~0); 8203#L12-2 assume !(10 == main_~i~0); 8202#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8201#L18-1 assume !!(main_~i~0 > 0); 8200#L12 assume !(1 == main_~i~0); 8199#L12-2 assume !(10 == main_~i~0); 8157#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8175#L18-1 assume !!(main_~i~0 > 0); 8171#L12 assume !(1 == main_~i~0); 8156#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 8030#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8046#L18-1 assume !!(main_~i~0 > 0); 8151#L12 assume !(1 == main_~i~0); 8149#L12-2 assume !(10 == main_~i~0); 8147#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8145#L18-1 assume !!(main_~i~0 > 0); 8143#L12 assume !(1 == main_~i~0); 8141#L12-2 assume !(10 == main_~i~0); 8139#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8137#L18-1 assume !!(main_~i~0 > 0); 8135#L12 assume !(1 == main_~i~0); 8133#L12-2 assume !(10 == main_~i~0); 8131#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8129#L18-1 assume !!(main_~i~0 > 0); 8127#L12 assume !(1 == main_~i~0); 8125#L12-2 assume !(10 == main_~i~0); 8123#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8121#L18-1 assume !!(main_~i~0 > 0); 8119#L12 assume !(1 == main_~i~0); 8117#L12-2 assume !(10 == main_~i~0); 8115#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8113#L18-1 assume !!(main_~i~0 > 0); 8111#L12 assume !(1 == main_~i~0); 8109#L12-2 assume !(10 == main_~i~0); 8107#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8105#L18-1 assume !!(main_~i~0 > 0); 8103#L12 assume !(1 == main_~i~0); 8101#L12-2 assume !(10 == main_~i~0); 8099#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8097#L18-1 assume !!(main_~i~0 > 0); 8095#L12 assume !(1 == main_~i~0); 8088#L12-2 assume !(10 == main_~i~0); 8092#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8090#L18-1 assume !!(main_~i~0 > 0); 8087#L12 assume 1 == main_~i~0;main_~up~0 := 1; 8084#L12-2 [2020-10-26 04:16:35,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:35,739 INFO L82 PathProgramCache]: Analyzing trace with hash 260754314, now seen corresponding path program 11 times [2020-10-26 04:16:35,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:35,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780168302] [2020-10-26 04:16:35,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-26 04:16:35,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780168302] [2020-10-26 04:16:35,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647561298] [2020-10-26 04:16:35,789 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:35,824 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2020-10-26 04:16:35,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:16:35,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 04:16:35,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-26 04:16:35,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:35,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-10-26 04:16:35,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229782757] [2020-10-26 04:16:35,859 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:16:35,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:35,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1093459752, now seen corresponding path program 9 times [2020-10-26 04:16:35,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:35,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867433680] [2020-10-26 04:16:35,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:35,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:35,875 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:35,878 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:36,201 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 51 [2020-10-26 04:16:36,214 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:36,214 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:36,215 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:36,215 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:36,215 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 04:16:36,215 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:36,215 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:36,215 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:36,215 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration18_Loop [2020-10-26 04:16:36,215 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:36,216 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:36,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:36,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:36,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:36,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:36,305 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:36,305 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:36,310 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:36,310 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:36,313 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:36,313 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_16=1} Honda state: {v_rep~unnamed0~0~true_16=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:36,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:36,338 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:36,343 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:36,343 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:36,367 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:36,367 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:36,392 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 04:16:36,392 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:36,395 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 04:16:36,418 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:36,418 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:36,418 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:36,418 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:36,418 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:16:36,418 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:36,418 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:36,418 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:36,418 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration18_Loop [2020-10-26 04:16:36,419 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:36,419 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:36,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:36,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:36,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:36,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:36,509 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:36,509 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:36,512 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 [2020-10-26 04:16:36,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:36,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:36,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:36,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:36,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:16:36,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:16:36,524 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 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:36,575 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 [2020-10-26 04:16:36,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:36,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:36,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:36,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:36,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:36,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:16:36,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:16:36,580 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 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:36,604 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 [2020-10-26 04:16:36,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:36,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:36,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:36,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:36,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:36,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:16:36,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:16:36,610 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:16:36,612 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-10-26 04:16:36,613 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:36,616 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:16:36,616 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 04:16:36,616 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:16:36,616 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-26 04:16:36,639 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 04:16:36,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:36,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:16:36,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:36,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 04:16:36,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-26 04:16:36,757 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2020-10-26 04:16:36,757 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 187 states and 223 transitions. cyclomatic complexity: 45 Second operand 8 states. [2020-10-26 04:16:37,080 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 187 states and 223 transitions. cyclomatic complexity: 45. Second operand 8 states. Result 905 states and 1062 transitions. Complement of second has 23 states. [2020-10-26 04:16:37,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2020-10-26 04:16:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-26 04:16:37,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2020-10-26 04:16:37,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 55 letters. Loop has 52 letters. [2020-10-26 04:16:37,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:37,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 107 letters. Loop has 52 letters. [2020-10-26 04:16:37,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:37,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 55 letters. Loop has 104 letters. [2020-10-26 04:16:37,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:37,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 905 states and 1062 transitions. [2020-10-26 04:16:37,096 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2020-10-26 04:16:37,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 905 states to 664 states and 777 transitions. [2020-10-26 04:16:37,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 [2020-10-26 04:16:37,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2020-10-26 04:16:37,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 664 states and 777 transitions. [2020-10-26 04:16:37,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:37,103 INFO L691 BuchiCegarLoop]: Abstraction has 664 states and 777 transitions. [2020-10-26 04:16:37,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states and 777 transitions. [2020-10-26 04:16:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 461. [2020-10-26 04:16:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-10-26 04:16:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 550 transitions. [2020-10-26 04:16:37,115 INFO L714 BuchiCegarLoop]: Abstraction has 461 states and 550 transitions. [2020-10-26 04:16:37,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:37,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 04:16:37,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-26 04:16:37,116 INFO L87 Difference]: Start difference. First operand 461 states and 550 transitions. Second operand 7 states. [2020-10-26 04:16:37,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:37,181 INFO L93 Difference]: Finished difference Result 317 states and 365 transitions. [2020-10-26 04:16:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 04:16:37,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 317 states and 365 transitions. [2020-10-26 04:16:37,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2020-10-26 04:16:37,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 317 states to 281 states and 329 transitions. [2020-10-26 04:16:37,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2020-10-26 04:16:37,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2020-10-26 04:16:37,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 281 states and 329 transitions. [2020-10-26 04:16:37,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:37,188 INFO L691 BuchiCegarLoop]: Abstraction has 281 states and 329 transitions. [2020-10-26 04:16:37,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states and 329 transitions. [2020-10-26 04:16:37,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 199. [2020-10-26 04:16:37,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-10-26 04:16:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 235 transitions. [2020-10-26 04:16:37,192 INFO L714 BuchiCegarLoop]: Abstraction has 199 states and 235 transitions. [2020-10-26 04:16:37,192 INFO L594 BuchiCegarLoop]: Abstraction has 199 states and 235 transitions. [2020-10-26 04:16:37,192 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-10-26 04:16:37,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 199 states and 235 transitions. [2020-10-26 04:16:37,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2020-10-26 04:16:37,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:37,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:37,195 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [15, 13, 13, 9, 5, 2, 1, 1] [2020-10-26 04:16:37,195 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 9, 5, 1, 1] [2020-10-26 04:16:37,196 INFO L794 eck$LassoCheckResult]: Stem: 10446#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 10447#L18-1 assume !!(main_~i~0 > 0); 10495#L12 assume 1 == main_~i~0;main_~up~0 := 1; 10490#L12-2 assume !(10 == main_~i~0); 10487#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10485#L18-1 assume !!(main_~i~0 > 0); 10483#L12 assume !(1 == main_~i~0); 10482#L12-2 assume !(10 == main_~i~0); 10481#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10480#L18-1 assume !!(main_~i~0 > 0); 10479#L12 assume !(1 == main_~i~0); 10478#L12-2 assume !(10 == main_~i~0); 10477#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10476#L18-1 assume !!(main_~i~0 > 0); 10475#L12 assume !(1 == main_~i~0); 10474#L12-2 assume !(10 == main_~i~0); 10473#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10472#L18-1 assume !!(main_~i~0 > 0); 10469#L12 assume !(1 == main_~i~0); 10471#L12-2 assume !(10 == main_~i~0); 10470#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10468#L18-1 assume !!(main_~i~0 > 0); 10467#L12 assume !(1 == main_~i~0); 10464#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 10455#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10456#L18-1 assume !!(main_~i~0 > 0); 10567#L12 assume !(1 == main_~i~0); 10565#L12-2 assume !(10 == main_~i~0); 10563#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10561#L18-1 assume !!(main_~i~0 > 0); 10559#L12 assume !(1 == main_~i~0); 10557#L12-2 assume !(10 == main_~i~0); 10555#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10553#L18-1 assume !!(main_~i~0 > 0); 10551#L12 assume !(1 == main_~i~0); 10549#L12-2 assume !(10 == main_~i~0); 10547#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10545#L18-1 assume !!(main_~i~0 > 0); 10543#L12 assume !(1 == main_~i~0); 10541#L12-2 assume !(10 == main_~i~0); 10539#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10537#L18-1 assume !!(main_~i~0 > 0); 10535#L12 assume !(1 == main_~i~0); 10533#L12-2 assume !(10 == main_~i~0); 10531#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10529#L18-1 assume !!(main_~i~0 > 0); 10527#L12 assume !(1 == main_~i~0); 10525#L12-2 assume !(10 == main_~i~0); 10523#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10521#L18-1 assume !!(main_~i~0 > 0); 10519#L12 assume !(1 == main_~i~0); 10517#L12-2 assume !(10 == main_~i~0); 10515#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10513#L18-1 assume !!(main_~i~0 > 0); 10511#L12 assume !(1 == main_~i~0); 10503#L12-2 assume !(10 == main_~i~0); 10508#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10506#L18-1 assume !!(main_~i~0 > 0); 10502#L12 assume 1 == main_~i~0;main_~up~0 := 1; 10501#L12-2 [2020-10-26 04:16:37,196 INFO L796 eck$LassoCheckResult]: Loop: 10501#L12-2 assume !(10 == main_~i~0); 10462#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10626#L18-1 assume !!(main_~i~0 > 0); 10572#L12 assume !(1 == main_~i~0); 10460#L12-2 assume !(10 == main_~i~0); 10457#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10458#L18-1 assume !!(main_~i~0 > 0); 10625#L12 assume !(1 == main_~i~0); 10624#L12-2 assume !(10 == main_~i~0); 10623#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10622#L18-1 assume !!(main_~i~0 > 0); 10621#L12 assume !(1 == main_~i~0); 10620#L12-2 assume !(10 == main_~i~0); 10619#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10618#L18-1 assume !!(main_~i~0 > 0); 10617#L12 assume !(1 == main_~i~0); 10616#L12-2 assume !(10 == main_~i~0); 10574#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10592#L18-1 assume !!(main_~i~0 > 0); 10588#L12 assume !(1 == main_~i~0); 10573#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 10443#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10459#L18-1 assume !!(main_~i~0 > 0); 10568#L12 assume !(1 == main_~i~0); 10566#L12-2 assume !(10 == main_~i~0); 10564#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10562#L18-1 assume !!(main_~i~0 > 0); 10560#L12 assume !(1 == main_~i~0); 10558#L12-2 assume !(10 == main_~i~0); 10556#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10554#L18-1 assume !!(main_~i~0 > 0); 10552#L12 assume !(1 == main_~i~0); 10550#L12-2 assume !(10 == main_~i~0); 10548#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10546#L18-1 assume !!(main_~i~0 > 0); 10544#L12 assume !(1 == main_~i~0); 10542#L12-2 assume !(10 == main_~i~0); 10540#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10538#L18-1 assume !!(main_~i~0 > 0); 10536#L12 assume !(1 == main_~i~0); 10534#L12-2 assume !(10 == main_~i~0); 10532#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10530#L18-1 assume !!(main_~i~0 > 0); 10528#L12 assume !(1 == main_~i~0); 10526#L12-2 assume !(10 == main_~i~0); 10524#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10522#L18-1 assume !!(main_~i~0 > 0); 10520#L12 assume !(1 == main_~i~0); 10518#L12-2 assume !(10 == main_~i~0); 10516#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10514#L18-1 assume !!(main_~i~0 > 0); 10512#L12 assume !(1 == main_~i~0); 10505#L12-2 assume !(10 == main_~i~0); 10509#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10507#L18-1 assume !!(main_~i~0 > 0); 10504#L12 assume 1 == main_~i~0;main_~up~0 := 1; 10501#L12-2 [2020-10-26 04:16:37,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:37,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1566074253, now seen corresponding path program 12 times [2020-10-26 04:16:37,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:37,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068930280] [2020-10-26 04:16:37,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:37,252 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 211 proven. 45 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-26 04:16:37,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068930280] [2020-10-26 04:16:37,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841875956] [2020-10-26 04:16:37,253 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:37,318 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2020-10-26 04:16:37,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:16:37,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 04:16:37,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 211 proven. 45 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-26 04:16:37,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:37,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-10-26 04:16:37,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971903121] [2020-10-26 04:16:37,340 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:16:37,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:37,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1203416849, now seen corresponding path program 10 times [2020-10-26 04:16:37,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:37,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178069995] [2020-10-26 04:16:37,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:37,348 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:37,354 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:37,356 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:37,719 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 54 [2020-10-26 04:16:37,733 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:37,734 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:37,734 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:37,734 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:37,734 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 04:16:37,734 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:37,734 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:37,734 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:37,735 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration19_Loop [2020-10-26 04:16:37,735 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:37,735 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:37,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:37,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:37,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:37,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:37,828 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:37,828 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:37,832 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:37,832 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:37,835 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:37,835 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:37,861 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:37,861 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:37,865 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:37,865 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_18=1} Honda state: {v_rep~unnamed0~0~true_18=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:37,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:37,889 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 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 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:37,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 04:16:37,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:37,980 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 04:16:37,982 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:37,982 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:37,982 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:37,982 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:37,982 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:16:37,982 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:37,982 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:37,982 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:37,982 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration19_Loop [2020-10-26 04:16:37,982 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:37,983 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:37,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:37,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:38,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:38,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:38,081 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:38,081 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 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 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:38,085 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 [2020-10-26 04:16:38,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:38,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:38,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:38,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:38,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:38,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:16:38,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:16:38,090 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 100 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 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:38,114 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 [2020-10-26 04:16:38,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:38,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:38,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:38,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:38,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:38,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:16:38,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:16:38,118 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:16:38,122 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-26 04:16:38,122 INFO L444 ModelExtractionUtils]: 0 out of 3 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 101 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 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:38,126 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:16:38,126 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 04:16:38,126 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:16:38,126 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-26 04:16:38,148 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 04:16:38,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:38,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:16:38,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:38,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-26 04:16:38,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-26 04:16:38,278 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2020-10-26 04:16:38,278 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 199 states and 235 transitions. cyclomatic complexity: 45 Second operand 9 states. [2020-10-26 04:16:38,694 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 199 states and 235 transitions. cyclomatic complexity: 45. Second operand 9 states. Result 1161 states and 1347 transitions. Complement of second has 27 states. [2020-10-26 04:16:38,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2020-10-26 04:16:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-26 04:16:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 67 transitions. [2020-10-26 04:16:38,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 67 transitions. Stem has 59 letters. Loop has 56 letters. [2020-10-26 04:16:38,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:38,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 67 transitions. Stem has 115 letters. Loop has 56 letters. [2020-10-26 04:16:38,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:38,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 67 transitions. Stem has 59 letters. Loop has 112 letters. [2020-10-26 04:16:38,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:38,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1161 states and 1347 transitions. [2020-10-26 04:16:38,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2020-10-26 04:16:38,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1161 states to 812 states and 943 transitions. [2020-10-26 04:16:38,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2020-10-26 04:16:38,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2020-10-26 04:16:38,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 812 states and 943 transitions. [2020-10-26 04:16:38,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:38,711 INFO L691 BuchiCegarLoop]: Abstraction has 812 states and 943 transitions. [2020-10-26 04:16:38,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states and 943 transitions. [2020-10-26 04:16:38,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 525. [2020-10-26 04:16:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2020-10-26 04:16:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 626 transitions. [2020-10-26 04:16:38,724 INFO L714 BuchiCegarLoop]: Abstraction has 525 states and 626 transitions. [2020-10-26 04:16:38,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:38,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 04:16:38,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-26 04:16:38,725 INFO L87 Difference]: Start difference. First operand 525 states and 626 transitions. Second operand 8 states. [2020-10-26 04:16:38,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:38,824 INFO L93 Difference]: Finished difference Result 357 states and 408 transitions. [2020-10-26 04:16:38,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 04:16:38,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 357 states and 408 transitions. [2020-10-26 04:16:38,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 87 [2020-10-26 04:16:38,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 357 states to 313 states and 364 transitions. [2020-10-26 04:16:38,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2020-10-26 04:16:38,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2020-10-26 04:16:38,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 313 states and 364 transitions. [2020-10-26 04:16:38,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:38,831 INFO L691 BuchiCegarLoop]: Abstraction has 313 states and 364 transitions. [2020-10-26 04:16:38,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states and 364 transitions. [2020-10-26 04:16:38,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 211. [2020-10-26 04:16:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-10-26 04:16:38,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 247 transitions. [2020-10-26 04:16:38,837 INFO L714 BuchiCegarLoop]: Abstraction has 211 states and 247 transitions. [2020-10-26 04:16:38,837 INFO L594 BuchiCegarLoop]: Abstraction has 211 states and 247 transitions. [2020-10-26 04:16:38,837 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-10-26 04:16:38,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 247 transitions. [2020-10-26 04:16:38,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2020-10-26 04:16:38,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:38,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:38,840 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [16, 14, 14, 9, 6, 2, 1, 1] [2020-10-26 04:16:38,840 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 9, 6, 1, 1] [2020-10-26 04:16:38,841 INFO L794 eck$LassoCheckResult]: Stem: 13276#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 13277#L18-1 assume !!(main_~i~0 > 0); 13325#L12 assume 1 == main_~i~0;main_~up~0 := 1; 13323#L12-2 assume !(10 == main_~i~0); 13321#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13319#L18-1 assume !!(main_~i~0 > 0); 13318#L12 assume !(1 == main_~i~0); 13317#L12-2 assume !(10 == main_~i~0); 13316#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13315#L18-1 assume !!(main_~i~0 > 0); 13314#L12 assume !(1 == main_~i~0); 13313#L12-2 assume !(10 == main_~i~0); 13312#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13311#L18-1 assume !!(main_~i~0 > 0); 13310#L12 assume !(1 == main_~i~0); 13309#L12-2 assume !(10 == main_~i~0); 13308#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13307#L18-1 assume !!(main_~i~0 > 0); 13306#L12 assume !(1 == main_~i~0); 13305#L12-2 assume !(10 == main_~i~0); 13304#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13303#L18-1 assume !!(main_~i~0 > 0); 13300#L12 assume !(1 == main_~i~0); 13302#L12-2 assume !(10 == main_~i~0); 13301#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13299#L18-1 assume !!(main_~i~0 > 0); 13298#L12 assume !(1 == main_~i~0); 13295#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 13286#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13287#L18-1 assume !!(main_~i~0 > 0); 13409#L12 assume !(1 == main_~i~0); 13399#L12-2 assume !(10 == main_~i~0); 13397#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13395#L18-1 assume !!(main_~i~0 > 0); 13393#L12 assume !(1 == main_~i~0); 13391#L12-2 assume !(10 == main_~i~0); 13389#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13387#L18-1 assume !!(main_~i~0 > 0); 13385#L12 assume !(1 == main_~i~0); 13383#L12-2 assume !(10 == main_~i~0); 13381#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13379#L18-1 assume !!(main_~i~0 > 0); 13377#L12 assume !(1 == main_~i~0); 13375#L12-2 assume !(10 == main_~i~0); 13373#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13371#L18-1 assume !!(main_~i~0 > 0); 13369#L12 assume !(1 == main_~i~0); 13367#L12-2 assume !(10 == main_~i~0); 13365#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13363#L18-1 assume !!(main_~i~0 > 0); 13361#L12 assume !(1 == main_~i~0); 13359#L12-2 assume !(10 == main_~i~0); 13357#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13355#L18-1 assume !!(main_~i~0 > 0); 13353#L12 assume !(1 == main_~i~0); 13351#L12-2 assume !(10 == main_~i~0); 13349#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13347#L18-1 assume !!(main_~i~0 > 0); 13345#L12 assume !(1 == main_~i~0); 13338#L12-2 assume !(10 == main_~i~0); 13342#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13340#L18-1 assume !!(main_~i~0 > 0); 13337#L12 assume 1 == main_~i~0;main_~up~0 := 1; 13334#L12-2 [2020-10-26 04:16:38,841 INFO L796 eck$LassoCheckResult]: Loop: 13334#L12-2 assume !(10 == main_~i~0); 13294#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13430#L18-1 assume !!(main_~i~0 > 0); 13427#L12 assume !(1 == main_~i~0); 13426#L12-2 assume !(10 == main_~i~0); 13425#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13424#L18-1 assume !!(main_~i~0 > 0); 13423#L12 assume !(1 == main_~i~0); 13422#L12-2 assume !(10 == main_~i~0); 13421#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13420#L18-1 assume !!(main_~i~0 > 0); 13419#L12 assume !(1 == main_~i~0); 13418#L12-2 assume !(10 == main_~i~0); 13417#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13416#L18-1 assume !!(main_~i~0 > 0); 13415#L12 assume !(1 == main_~i~0); 13414#L12-2 assume !(10 == main_~i~0); 13413#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13412#L18-1 assume !!(main_~i~0 > 0); 13411#L12 assume !(1 == main_~i~0); 13410#L12-2 assume !(10 == main_~i~0); 13402#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13407#L18-1 assume !!(main_~i~0 > 0); 13405#L12 assume !(1 == main_~i~0); 13401#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 13273#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13290#L18-1 assume !!(main_~i~0 > 0); 13408#L12 assume !(1 == main_~i~0); 13398#L12-2 assume !(10 == main_~i~0); 13396#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13394#L18-1 assume !!(main_~i~0 > 0); 13392#L12 assume !(1 == main_~i~0); 13390#L12-2 assume !(10 == main_~i~0); 13388#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13386#L18-1 assume !!(main_~i~0 > 0); 13384#L12 assume !(1 == main_~i~0); 13382#L12-2 assume !(10 == main_~i~0); 13380#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13378#L18-1 assume !!(main_~i~0 > 0); 13376#L12 assume !(1 == main_~i~0); 13374#L12-2 assume !(10 == main_~i~0); 13372#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13370#L18-1 assume !!(main_~i~0 > 0); 13368#L12 assume !(1 == main_~i~0); 13366#L12-2 assume !(10 == main_~i~0); 13364#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13362#L18-1 assume !!(main_~i~0 > 0); 13360#L12 assume !(1 == main_~i~0); 13358#L12-2 assume !(10 == main_~i~0); 13356#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13354#L18-1 assume !!(main_~i~0 > 0); 13352#L12 assume !(1 == main_~i~0); 13350#L12-2 assume !(10 == main_~i~0); 13348#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13346#L18-1 assume !!(main_~i~0 > 0); 13344#L12 assume !(1 == main_~i~0); 13336#L12-2 assume !(10 == main_~i~0); 13341#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13339#L18-1 assume !!(main_~i~0 > 0); 13335#L12 assume 1 == main_~i~0;main_~up~0 := 1; 13334#L12-2 [2020-10-26 04:16:38,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:38,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1417622308, now seen corresponding path program 13 times [2020-10-26 04:16:38,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:38,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662201697] [2020-10-26 04:16:38,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 248 proven. 66 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-26 04:16:38,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662201697] [2020-10-26 04:16:38,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345742559] [2020-10-26 04:16:38,916 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:38,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 04:16:38,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:38,968 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 248 proven. 66 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-26 04:16:38,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:38,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-10-26 04:16:38,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643031138] [2020-10-26 04:16:38,969 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:16:38,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:38,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1315151238, now seen corresponding path program 11 times [2020-10-26 04:16:38,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:38,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489752288] [2020-10-26 04:16:38,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:38,978 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:38,984 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:38,987 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:39,384 WARN L193 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 57 [2020-10-26 04:16:39,409 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:39,409 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:39,409 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:39,409 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:39,410 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 04:16:39,410 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:39,410 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:39,410 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:39,410 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration20_Loop [2020-10-26 04:16:39,410 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:39,410 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:39,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:39,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:39,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:39,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:39,512 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:39,512 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 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 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:39,516 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:39,516 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:39,519 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:39,519 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_20=0} Honda state: {v_rep~unnamed0~0~false_20=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 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 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:39,542 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:39,542 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 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 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:39,568 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 04:16:39,569 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:39,572 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 04:16:39,593 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:39,593 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:39,593 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:39,594 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:39,594 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:16:39,594 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:39,594 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:39,594 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:39,594 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration20_Loop [2020-10-26 04:16:39,594 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:39,594 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:39,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:39,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:39,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:39,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:39,687 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:39,688 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 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 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:39,692 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 [2020-10-26 04:16:39,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:39,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:39,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:39,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:39,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:16:39,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:16:39,699 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 107 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 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:39,725 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 [2020-10-26 04:16:39,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:39,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:39,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:39,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:39,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:39,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:16:39,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:16:39,731 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:16:39,733 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-10-26 04:16:39,733 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 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 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:39,735 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:16:39,736 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 04:16:39,736 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:16:39,736 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-26 04:16:39,757 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 04:16:39,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:39,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:16:39,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:39,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 04:16:39,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-26 04:16:39,917 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2020-10-26 04:16:39,917 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 211 states and 247 transitions. cyclomatic complexity: 45 Second operand 10 states. [2020-10-26 04:16:40,463 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 211 states and 247 transitions. cyclomatic complexity: 45. Second operand 10 states. Result 1457 states and 1676 transitions. Complement of second has 31 states. [2020-10-26 04:16:40,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2020-10-26 04:16:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-26 04:16:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 77 transitions. [2020-10-26 04:16:40,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 77 transitions. Stem has 63 letters. Loop has 60 letters. [2020-10-26 04:16:40,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:40,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 77 transitions. Stem has 123 letters. Loop has 60 letters. [2020-10-26 04:16:40,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:40,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 77 transitions. Stem has 63 letters. Loop has 120 letters. [2020-10-26 04:16:40,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:40,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1457 states and 1676 transitions. [2020-10-26 04:16:40,480 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2020-10-26 04:16:40,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1457 states to 980 states and 1131 transitions. [2020-10-26 04:16:40,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 196 [2020-10-26 04:16:40,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 205 [2020-10-26 04:16:40,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 980 states and 1131 transitions. [2020-10-26 04:16:40,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:40,487 INFO L691 BuchiCegarLoop]: Abstraction has 980 states and 1131 transitions. [2020-10-26 04:16:40,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states and 1131 transitions. [2020-10-26 04:16:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 597. [2020-10-26 04:16:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2020-10-26 04:16:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 712 transitions. [2020-10-26 04:16:40,503 INFO L714 BuchiCegarLoop]: Abstraction has 597 states and 712 transitions. [2020-10-26 04:16:40,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:40,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-26 04:16:40,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-26 04:16:40,504 INFO L87 Difference]: Start difference. First operand 597 states and 712 transitions. Second operand 9 states. [2020-10-26 04:16:40,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:40,587 INFO L93 Difference]: Finished difference Result 397 states and 451 transitions. [2020-10-26 04:16:40,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 04:16:40,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 397 states and 451 transitions. [2020-10-26 04:16:40,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2020-10-26 04:16:40,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 397 states to 345 states and 399 transitions. [2020-10-26 04:16:40,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2020-10-26 04:16:40,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2020-10-26 04:16:40,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 345 states and 399 transitions. [2020-10-26 04:16:40,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:40,597 INFO L691 BuchiCegarLoop]: Abstraction has 345 states and 399 transitions. [2020-10-26 04:16:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states and 399 transitions. [2020-10-26 04:16:40,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 223. [2020-10-26 04:16:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-10-26 04:16:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 259 transitions. [2020-10-26 04:16:40,602 INFO L714 BuchiCegarLoop]: Abstraction has 223 states and 259 transitions. [2020-10-26 04:16:40,602 INFO L594 BuchiCegarLoop]: Abstraction has 223 states and 259 transitions. [2020-10-26 04:16:40,603 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-10-26 04:16:40,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 223 states and 259 transitions. [2020-10-26 04:16:40,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2020-10-26 04:16:40,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:40,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:40,606 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [17, 15, 15, 9, 7, 2, 1, 1] [2020-10-26 04:16:40,606 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 9, 7, 1, 1] [2020-10-26 04:16:40,607 INFO L794 eck$LassoCheckResult]: Stem: 16571#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 16572#L18-1 assume !!(main_~i~0 > 0); 16620#L12 assume 1 == main_~i~0;main_~up~0 := 1; 16615#L12-2 assume !(10 == main_~i~0); 16613#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16611#L18-1 assume !!(main_~i~0 > 0); 16610#L12 assume !(1 == main_~i~0); 16609#L12-2 assume !(10 == main_~i~0); 16608#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16607#L18-1 assume !!(main_~i~0 > 0); 16606#L12 assume !(1 == main_~i~0); 16605#L12-2 assume !(10 == main_~i~0); 16604#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16603#L18-1 assume !!(main_~i~0 > 0); 16602#L12 assume !(1 == main_~i~0); 16601#L12-2 assume !(10 == main_~i~0); 16600#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16599#L18-1 assume !!(main_~i~0 > 0); 16598#L12 assume !(1 == main_~i~0); 16597#L12-2 assume !(10 == main_~i~0); 16596#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16595#L18-1 assume !!(main_~i~0 > 0); 16594#L12 assume !(1 == main_~i~0); 16593#L12-2 assume !(10 == main_~i~0); 16592#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16591#L18-1 assume !!(main_~i~0 > 0); 16588#L12 assume !(1 == main_~i~0); 16590#L12-2 assume !(10 == main_~i~0); 16589#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16587#L18-1 assume !!(main_~i~0 > 0); 16586#L12 assume !(1 == main_~i~0); 16585#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 16580#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16581#L18-1 assume !!(main_~i~0 > 0); 16700#L12 assume !(1 == main_~i~0); 16698#L12-2 assume !(10 == main_~i~0); 16696#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16694#L18-1 assume !!(main_~i~0 > 0); 16692#L12 assume !(1 == main_~i~0); 16690#L12-2 assume !(10 == main_~i~0); 16688#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16686#L18-1 assume !!(main_~i~0 > 0); 16684#L12 assume !(1 == main_~i~0); 16682#L12-2 assume !(10 == main_~i~0); 16680#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16678#L18-1 assume !!(main_~i~0 > 0); 16676#L12 assume !(1 == main_~i~0); 16674#L12-2 assume !(10 == main_~i~0); 16672#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16670#L18-1 assume !!(main_~i~0 > 0); 16668#L12 assume !(1 == main_~i~0); 16666#L12-2 assume !(10 == main_~i~0); 16664#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16662#L18-1 assume !!(main_~i~0 > 0); 16660#L12 assume !(1 == main_~i~0); 16658#L12-2 assume !(10 == main_~i~0); 16656#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16654#L18-1 assume !!(main_~i~0 > 0); 16652#L12 assume !(1 == main_~i~0); 16650#L12-2 assume !(10 == main_~i~0); 16648#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16646#L18-1 assume !!(main_~i~0 > 0); 16644#L12 assume !(1 == main_~i~0); 16636#L12-2 assume !(10 == main_~i~0); 16641#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16639#L18-1 assume !!(main_~i~0 > 0); 16635#L12 assume 1 == main_~i~0;main_~up~0 := 1; 16634#L12-2 [2020-10-26 04:16:40,607 INFO L796 eck$LassoCheckResult]: Loop: 16634#L12-2 assume !(10 == main_~i~0); 16582#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16583#L18-1 assume !!(main_~i~0 > 0); 16734#L12 assume !(1 == main_~i~0); 16731#L12-2 assume !(10 == main_~i~0); 16730#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16729#L18-1 assume !!(main_~i~0 > 0); 16728#L12 assume !(1 == main_~i~0); 16727#L12-2 assume !(10 == main_~i~0); 16726#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16725#L18-1 assume !!(main_~i~0 > 0); 16724#L12 assume !(1 == main_~i~0); 16723#L12-2 assume !(10 == main_~i~0); 16722#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16721#L18-1 assume !!(main_~i~0 > 0); 16720#L12 assume !(1 == main_~i~0); 16719#L12-2 assume !(10 == main_~i~0); 16718#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16717#L18-1 assume !!(main_~i~0 > 0); 16716#L12 assume !(1 == main_~i~0); 16715#L12-2 assume !(10 == main_~i~0); 16714#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16713#L18-1 assume !!(main_~i~0 > 0); 16712#L12 assume !(1 == main_~i~0); 16711#L12-2 assume !(10 == main_~i~0); 16707#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 16709#L18-1 assume !!(main_~i~0 > 0); 16708#L12 assume !(1 == main_~i~0); 16706#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 16568#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16584#L18-1 assume !!(main_~i~0 > 0); 16702#L12 assume !(1 == main_~i~0); 16699#L12-2 assume !(10 == main_~i~0); 16697#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16695#L18-1 assume !!(main_~i~0 > 0); 16693#L12 assume !(1 == main_~i~0); 16691#L12-2 assume !(10 == main_~i~0); 16689#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16687#L18-1 assume !!(main_~i~0 > 0); 16685#L12 assume !(1 == main_~i~0); 16683#L12-2 assume !(10 == main_~i~0); 16681#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16679#L18-1 assume !!(main_~i~0 > 0); 16677#L12 assume !(1 == main_~i~0); 16675#L12-2 assume !(10 == main_~i~0); 16673#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16671#L18-1 assume !!(main_~i~0 > 0); 16669#L12 assume !(1 == main_~i~0); 16667#L12-2 assume !(10 == main_~i~0); 16665#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16663#L18-1 assume !!(main_~i~0 > 0); 16661#L12 assume !(1 == main_~i~0); 16659#L12-2 assume !(10 == main_~i~0); 16657#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16655#L18-1 assume !!(main_~i~0 > 0); 16653#L12 assume !(1 == main_~i~0); 16651#L12-2 assume !(10 == main_~i~0); 16649#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16647#L18-1 assume !!(main_~i~0 > 0); 16645#L12 assume !(1 == main_~i~0); 16638#L12-2 assume !(10 == main_~i~0); 16642#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 16640#L18-1 assume !!(main_~i~0 > 0); 16637#L12 assume 1 == main_~i~0;main_~up~0 := 1; 16634#L12-2 [2020-10-26 04:16:40,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:40,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1714987717, now seen corresponding path program 14 times [2020-10-26 04:16:40,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:40,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541771681] [2020-10-26 04:16:40,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:40,691 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 285 proven. 91 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-26 04:16:40,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541771681] [2020-10-26 04:16:40,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864921462] [2020-10-26 04:16:40,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:40,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 04:16:40,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:16:40,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-26 04:16:40,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 285 proven. 91 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-26 04:16:40,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:40,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-10-26 04:16:40,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184953758] [2020-10-26 04:16:40,761 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:16:40,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:40,761 INFO L82 PathProgramCache]: Analyzing trace with hash 590625123, now seen corresponding path program 12 times [2020-10-26 04:16:40,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:40,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978533460] [2020-10-26 04:16:40,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:40,770 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:40,776 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:40,780 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:41,203 WARN L193 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 61 [2020-10-26 04:16:41,223 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:41,223 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:41,223 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:41,223 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:41,223 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 04:16:41,223 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:41,224 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:41,224 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:41,224 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration21_Loop [2020-10-26 04:16:41,224 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:41,224 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:41,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:41,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:41,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:41,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:41,313 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:41,313 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 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 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:41,318 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:41,318 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:41,325 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:41,325 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_22=1} Honda state: {v_rep~unnamed0~0~true_22=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 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 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:41,346 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:41,346 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:41,349 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:16:41,349 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_22=0} Honda state: {v_rep~unnamed0~0~false_22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 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 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:41,374 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:41,374 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 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 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:41,398 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 04:16:41,398 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:41,401 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 04:16:41,423 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:41,423 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:41,423 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:41,424 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:41,424 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:16:41,424 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:41,424 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:41,424 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:41,424 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration21_Loop [2020-10-26 04:16:41,424 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:41,424 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:41,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:41,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:41,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:41,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:41,511 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:41,512 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 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 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:41,515 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 [2020-10-26 04:16:41,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:41,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:41,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:41,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:41,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:16:41,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:16:41,522 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 115 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 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:41,546 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 [2020-10-26 04:16:41,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:41,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:41,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:41,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:41,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:41,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:16:41,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:16:41,551 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:16:41,555 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-10-26 04:16:41,556 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 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 116 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:41,558 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:16:41,558 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 04:16:41,558 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:16:41,558 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-26 04:16:41,579 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 04:16:41,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:41,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:16:41,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:41,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-26 04:16:41,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 344 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-26 04:16:41,763 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2020-10-26 04:16:41,763 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 223 states and 259 transitions. cyclomatic complexity: 45 Second operand 11 states. [2020-10-26 04:16:42,372 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 223 states and 259 transitions. cyclomatic complexity: 45. Second operand 11 states. Result 1793 states and 2049 transitions. Complement of second has 35 states. [2020-10-26 04:16:42,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 1 stem states 16 non-accepting loop states 1 accepting loop states [2020-10-26 04:16:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-26 04:16:42,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 87 transitions. [2020-10-26 04:16:42,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 87 transitions. Stem has 67 letters. Loop has 64 letters. [2020-10-26 04:16:42,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:42,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 87 transitions. Stem has 131 letters. Loop has 64 letters. [2020-10-26 04:16:42,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:42,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 87 transitions. Stem has 67 letters. Loop has 128 letters. [2020-10-26 04:16:42,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:42,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1793 states and 2049 transitions. [2020-10-26 04:16:42,389 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 73 [2020-10-26 04:16:42,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1793 states to 1168 states and 1341 transitions. [2020-10-26 04:16:42,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 229 [2020-10-26 04:16:42,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 239 [2020-10-26 04:16:42,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1168 states and 1341 transitions. [2020-10-26 04:16:42,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:42,405 INFO L691 BuchiCegarLoop]: Abstraction has 1168 states and 1341 transitions. [2020-10-26 04:16:42,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states and 1341 transitions. [2020-10-26 04:16:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 677. [2020-10-26 04:16:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2020-10-26 04:16:42,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 808 transitions. [2020-10-26 04:16:42,422 INFO L714 BuchiCegarLoop]: Abstraction has 677 states and 808 transitions. [2020-10-26 04:16:42,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:42,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-26 04:16:42,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-26 04:16:42,424 INFO L87 Difference]: Start difference. First operand 677 states and 808 transitions. Second operand 10 states. [2020-10-26 04:16:42,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:42,485 INFO L93 Difference]: Finished difference Result 437 states and 494 transitions. [2020-10-26 04:16:42,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 04:16:42,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 437 states and 494 transitions. [2020-10-26 04:16:42,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 103 [2020-10-26 04:16:42,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 437 states to 377 states and 434 transitions. [2020-10-26 04:16:42,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-10-26 04:16:42,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-10-26 04:16:42,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 377 states and 434 transitions. [2020-10-26 04:16:42,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:42,495 INFO L691 BuchiCegarLoop]: Abstraction has 377 states and 434 transitions. [2020-10-26 04:16:42,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states and 434 transitions. [2020-10-26 04:16:42,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 235. [2020-10-26 04:16:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2020-10-26 04:16:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 271 transitions. [2020-10-26 04:16:42,500 INFO L714 BuchiCegarLoop]: Abstraction has 235 states and 271 transitions. [2020-10-26 04:16:42,500 INFO L594 BuchiCegarLoop]: Abstraction has 235 states and 271 transitions. [2020-10-26 04:16:42,500 INFO L427 BuchiCegarLoop]: ======== Iteration 22============ [2020-10-26 04:16:42,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 235 states and 271 transitions. [2020-10-26 04:16:42,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2020-10-26 04:16:42,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:42,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:42,503 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [18, 16, 16, 9, 8, 2, 1, 1] [2020-10-26 04:16:42,503 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 9, 8, 1, 1] [2020-10-26 04:16:42,504 INFO L794 eck$LassoCheckResult]: Stem: 20379#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 20380#L18-1 assume !!(main_~i~0 > 0); 20429#L12 assume 1 == main_~i~0;main_~up~0 := 1; 20426#L12-2 assume !(10 == main_~i~0); 20424#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 20422#L18-1 assume !!(main_~i~0 > 0); 20421#L12 assume !(1 == main_~i~0); 20420#L12-2 assume !(10 == main_~i~0); 20419#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 20418#L18-1 assume !!(main_~i~0 > 0); 20417#L12 assume !(1 == main_~i~0); 20416#L12-2 assume !(10 == main_~i~0); 20415#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 20414#L18-1 assume !!(main_~i~0 > 0); 20413#L12 assume !(1 == main_~i~0); 20412#L12-2 assume !(10 == main_~i~0); 20411#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 20410#L18-1 assume !!(main_~i~0 > 0); 20409#L12 assume !(1 == main_~i~0); 20408#L12-2 assume !(10 == main_~i~0); 20407#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 20406#L18-1 assume !!(main_~i~0 > 0); 20405#L12 assume !(1 == main_~i~0); 20404#L12-2 assume !(10 == main_~i~0); 20403#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 20402#L18-1 assume !!(main_~i~0 > 0); 20401#L12 assume !(1 == main_~i~0); 20400#L12-2 assume !(10 == main_~i~0); 20399#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 20398#L18-1 assume !!(main_~i~0 > 0); 20395#L12 assume !(1 == main_~i~0); 20397#L12-2 assume !(10 == main_~i~0); 20396#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 20394#L18-1 assume !!(main_~i~0 > 0); 20393#L12 assume !(1 == main_~i~0); 20392#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 20388#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 20389#L18-1 assume !!(main_~i~0 > 0); 20561#L12 assume !(1 == main_~i~0); 20559#L12-2 assume !(10 == main_~i~0); 20557#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 20550#L18-1 assume !!(main_~i~0 > 0); 20549#L12 assume !(1 == main_~i~0); 20548#L12-2 assume !(10 == main_~i~0); 20547#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 20545#L18-1 assume !!(main_~i~0 > 0); 20543#L12 assume !(1 == main_~i~0); 20541#L12-2 assume !(10 == main_~i~0); 20539#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 20537#L18-1 assume !!(main_~i~0 > 0); 20535#L12 assume !(1 == main_~i~0); 20533#L12-2 assume !(10 == main_~i~0); 20531#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 20529#L18-1 assume !!(main_~i~0 > 0); 20527#L12 assume !(1 == main_~i~0); 20525#L12-2 assume !(10 == main_~i~0); 20523#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 20521#L18-1 assume !!(main_~i~0 > 0); 20519#L12 assume !(1 == main_~i~0); 20517#L12-2 assume !(10 == main_~i~0); 20515#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 20513#L18-1 assume !!(main_~i~0 > 0); 20511#L12 assume !(1 == main_~i~0); 20509#L12-2 assume !(10 == main_~i~0); 20507#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 20505#L18-1 assume !!(main_~i~0 > 0); 20503#L12 assume !(1 == main_~i~0); 20495#L12-2 assume !(10 == main_~i~0); 20499#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 20497#L18-1 assume !!(main_~i~0 > 0); 20494#L12 assume 1 == main_~i~0;main_~up~0 := 1; 20485#L12-2 [2020-10-26 04:16:42,504 INFO L796 eck$LassoCheckResult]: Loop: 20485#L12-2 assume !(10 == main_~i~0); 20443#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 20488#L18-1 assume !!(main_~i~0 > 0); 20481#L12 assume !(1 == main_~i~0); 20480#L12-2 assume !(10 == main_~i~0); 20479#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 20478#L18-1 assume !!(main_~i~0 > 0); 20477#L12 assume !(1 == main_~i~0); 20476#L12-2 assume !(10 == main_~i~0); 20475#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 20474#L18-1 assume !!(main_~i~0 > 0); 20473#L12 assume !(1 == main_~i~0); 20472#L12-2 assume !(10 == main_~i~0); 20471#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 20470#L18-1 assume !!(main_~i~0 > 0); 20469#L12 assume !(1 == main_~i~0); 20468#L12-2 assume !(10 == main_~i~0); 20467#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 20466#L18-1 assume !!(main_~i~0 > 0); 20465#L12 assume !(1 == main_~i~0); 20464#L12-2 assume !(10 == main_~i~0); 20463#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 20462#L18-1 assume !!(main_~i~0 > 0); 20461#L12 assume !(1 == main_~i~0); 20460#L12-2 assume !(10 == main_~i~0); 20459#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 20458#L18-1 assume !!(main_~i~0 > 0); 20457#L12 assume !(1 == main_~i~0); 20456#L12-2 assume !(10 == main_~i~0); 20446#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 20453#L18-1 assume !!(main_~i~0 > 0); 20450#L12 assume !(1 == main_~i~0); 20445#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 20390#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 20391#L18-1 assume !!(main_~i~0 > 0); 20441#L12 assume !(1 == main_~i~0); 20439#L12-2 assume !(10 == main_~i~0); 20440#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 20546#L18-1 assume !!(main_~i~0 > 0); 20544#L12 assume !(1 == main_~i~0); 20542#L12-2 assume !(10 == main_~i~0); 20540#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 20538#L18-1 assume !!(main_~i~0 > 0); 20536#L12 assume !(1 == main_~i~0); 20534#L12-2 assume !(10 == main_~i~0); 20532#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 20530#L18-1 assume !!(main_~i~0 > 0); 20528#L12 assume !(1 == main_~i~0); 20526#L12-2 assume !(10 == main_~i~0); 20524#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 20522#L18-1 assume !!(main_~i~0 > 0); 20520#L12 assume !(1 == main_~i~0); 20518#L12-2 assume !(10 == main_~i~0); 20516#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 20514#L18-1 assume !!(main_~i~0 > 0); 20512#L12 assume !(1 == main_~i~0); 20510#L12-2 assume !(10 == main_~i~0); 20508#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 20506#L18-1 assume !!(main_~i~0 > 0); 20504#L12 assume !(1 == main_~i~0); 20502#L12-2 assume !(10 == main_~i~0); 20500#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 20498#L18-1 assume !!(main_~i~0 > 0); 20496#L12 assume !(1 == main_~i~0); 20486#L12-2 assume !(10 == main_~i~0); 20491#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 20489#L18-1 assume !!(main_~i~0 > 0); 20484#L12 assume 1 == main_~i~0;main_~up~0 := 1; 20485#L12-2 [2020-10-26 04:16:42,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:42,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1278125010, now seen corresponding path program 15 times [2020-10-26 04:16:42,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:42,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878886215] [2020-10-26 04:16:42,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 322 proven. 120 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-26 04:16:42,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878886215] [2020-10-26 04:16:42,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385820715] [2020-10-26 04:16:42,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:16:42,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2020-10-26 04:16:42,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:16:42,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-26 04:16:42,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:42,696 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 322 proven. 226 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-26 04:16:42,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:16:42,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 12 [2020-10-26 04:16:42,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086363229] [2020-10-26 04:16:42,697 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:16:42,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:42,698 INFO L82 PathProgramCache]: Analyzing trace with hash -976981044, now seen corresponding path program 13 times [2020-10-26 04:16:42,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:42,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421273838] [2020-10-26 04:16:42,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:42,706 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:42,713 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:42,715 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:43,146 WARN L193 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 63 [2020-10-26 04:16:43,157 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:43,157 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:43,157 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:43,157 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:43,157 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 04:16:43,157 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:43,157 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:43,157 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:43,158 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration22_Loop [2020-10-26 04:16:43,158 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:43,158 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:43,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:43,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:43,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:43,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:43,235 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:43,236 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:43,244 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:16:43,244 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 118 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 119 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 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:43,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 04:16:43,286 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:16:43,290 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 04:16:43,311 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:16:43,311 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:16:43,311 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:16:43,311 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:16:43,312 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:16:43,312 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:43,312 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:16:43,312 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:16:43,312 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration22_Loop [2020-10-26 04:16:43,312 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:16:43,312 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:16:43,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:43,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:43,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:43,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:16:43,397 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:16:43,398 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:43,408 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 [2020-10-26 04:16:43,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:16:43,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:16:43,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:16:43,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:16:43,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:16:43,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:16:43,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 120 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:43,415 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:16:43,417 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-10-26 04:16:43,417 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:16:43,421 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:16:43,422 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 04:16:43,422 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:16:43,422 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:16:43,451 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 04:16:43,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:43,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:16:43,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:16:43,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-26 04:16:43,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:16:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-26 04:16:43,643 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2020-10-26 04:16:43,643 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 235 states and 271 transitions. cyclomatic complexity: 45 Second operand 12 states. [2020-10-26 04:16:44,328 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 235 states and 271 transitions. cyclomatic complexity: 45. Second operand 12 states. Result 2169 states and 2468 transitions. Complement of second has 39 states. [2020-10-26 04:16:44,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 18 non-accepting loop states 1 accepting loop states [2020-10-26 04:16:44,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-26 04:16:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 97 transitions. [2020-10-26 04:16:44,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 97 transitions. Stem has 71 letters. Loop has 68 letters. [2020-10-26 04:16:44,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:44,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 97 transitions. Stem has 139 letters. Loop has 68 letters. [2020-10-26 04:16:44,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:44,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 97 transitions. Stem has 71 letters. Loop has 136 letters. [2020-10-26 04:16:44,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:16:44,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2169 states and 2468 transitions. [2020-10-26 04:16:44,348 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 77 [2020-10-26 04:16:44,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2169 states to 1376 states and 1575 transitions. [2020-10-26 04:16:44,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 266 [2020-10-26 04:16:44,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 277 [2020-10-26 04:16:44,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1376 states and 1575 transitions. [2020-10-26 04:16:44,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:44,358 INFO L691 BuchiCegarLoop]: Abstraction has 1376 states and 1575 transitions. [2020-10-26 04:16:44,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states and 1575 transitions. [2020-10-26 04:16:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 765. [2020-10-26 04:16:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2020-10-26 04:16:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 914 transitions. [2020-10-26 04:16:44,377 INFO L714 BuchiCegarLoop]: Abstraction has 765 states and 914 transitions. [2020-10-26 04:16:44,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:16:44,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 04:16:44,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-26 04:16:44,378 INFO L87 Difference]: Start difference. First operand 765 states and 914 transitions. Second operand 12 states. [2020-10-26 04:16:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:16:44,478 INFO L93 Difference]: Finished difference Result 477 states and 537 transitions. [2020-10-26 04:16:44,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 04:16:44,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 477 states and 537 transitions. [2020-10-26 04:16:44,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 111 [2020-10-26 04:16:44,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 477 states to 409 states and 469 transitions. [2020-10-26 04:16:44,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2020-10-26 04:16:44,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2020-10-26 04:16:44,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 409 states and 469 transitions. [2020-10-26 04:16:44,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:16:44,488 INFO L691 BuchiCegarLoop]: Abstraction has 409 states and 469 transitions. [2020-10-26 04:16:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states and 469 transitions. [2020-10-26 04:16:44,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 247. [2020-10-26 04:16:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-10-26 04:16:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 283 transitions. [2020-10-26 04:16:44,493 INFO L714 BuchiCegarLoop]: Abstraction has 247 states and 283 transitions. [2020-10-26 04:16:44,493 INFO L594 BuchiCegarLoop]: Abstraction has 247 states and 283 transitions. [2020-10-26 04:16:44,494 INFO L427 BuchiCegarLoop]: ======== Iteration 23============ [2020-10-26 04:16:44,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 247 states and 283 transitions. [2020-10-26 04:16:44,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2020-10-26 04:16:44,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:16:44,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:16:44,496 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [19, 17, 17, 9, 9, 2, 1, 1] [2020-10-26 04:16:44,496 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2020-10-26 04:16:44,497 INFO L794 eck$LassoCheckResult]: Stem: 24749#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 24750#L18-1 assume !!(main_~i~0 > 0); 24809#L12 assume 1 == main_~i~0;main_~up~0 := 1; 24804#L12-2 assume !(10 == main_~i~0); 24801#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 24799#L18-1 assume !!(main_~i~0 > 0); 24797#L12 assume !(1 == main_~i~0); 24796#L12-2 assume !(10 == main_~i~0); 24795#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 24794#L18-1 assume !!(main_~i~0 > 0); 24793#L12 assume !(1 == main_~i~0); 24792#L12-2 assume !(10 == main_~i~0); 24791#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 24790#L18-1 assume !!(main_~i~0 > 0); 24789#L12 assume !(1 == main_~i~0); 24788#L12-2 assume !(10 == main_~i~0); 24787#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 24786#L18-1 assume !!(main_~i~0 > 0); 24785#L12 assume !(1 == main_~i~0); 24784#L12-2 assume !(10 == main_~i~0); 24783#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 24782#L18-1 assume !!(main_~i~0 > 0); 24781#L12 assume !(1 == main_~i~0); 24780#L12-2 assume !(10 == main_~i~0); 24779#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 24778#L18-1 assume !!(main_~i~0 > 0); 24777#L12 assume !(1 == main_~i~0); 24776#L12-2 assume !(10 == main_~i~0); 24775#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 24774#L18-1 assume !!(main_~i~0 > 0); 24773#L12 assume !(1 == main_~i~0); 24772#L12-2 assume !(10 == main_~i~0); 24771#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 24770#L18-1 assume !!(main_~i~0 > 0); 24767#L12 assume !(1 == main_~i~0); 24769#L12-2 assume !(10 == main_~i~0); 24768#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 24766#L18-1 assume !!(main_~i~0 > 0); 24765#L12 assume !(1 == main_~i~0); 24764#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 24759#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 24760#L18-1 assume !!(main_~i~0 > 0); 24953#L12 assume !(1 == main_~i~0); 24952#L12-2 assume !(10 == main_~i~0); 24951#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 24950#L18-1 assume !!(main_~i~0 > 0); 24948#L12 assume !(1 == main_~i~0); 24946#L12-2 assume !(10 == main_~i~0); 24943#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 24940#L18-1 assume !!(main_~i~0 > 0); 24937#L12 assume !(1 == main_~i~0); 24934#L12-2 assume !(10 == main_~i~0); 24931#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 24928#L18-1 assume !!(main_~i~0 > 0); 24925#L12 assume !(1 == main_~i~0); 24922#L12-2 assume !(10 == main_~i~0); 24919#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 24916#L18-1 assume !!(main_~i~0 > 0); 24913#L12 assume !(1 == main_~i~0); 24910#L12-2 assume !(10 == main_~i~0); 24907#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 24904#L18-1 assume !!(main_~i~0 > 0); 24901#L12 assume !(1 == main_~i~0); 24898#L12-2 assume !(10 == main_~i~0); 24895#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 24892#L18-1 assume !!(main_~i~0 > 0); 24889#L12 assume !(1 == main_~i~0); 24886#L12-2 assume !(10 == main_~i~0); 24883#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 24880#L18-1 assume !!(main_~i~0 > 0); 24877#L12 assume !(1 == main_~i~0); 24867#L12-2 assume !(10 == main_~i~0); 24873#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 24870#L18-1 assume !!(main_~i~0 > 0); 24866#L12 assume 1 == main_~i~0;main_~up~0 := 1; 24858#L12-2 [2020-10-26 04:16:44,497 INFO L796 eck$LassoCheckResult]: Loop: 24858#L12-2 assume !(10 == main_~i~0); 24857#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 24856#L18-1 assume !!(main_~i~0 > 0); 24855#L12 assume !(1 == main_~i~0); 24854#L12-2 assume !(10 == main_~i~0); 24853#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 24852#L18-1 assume !!(main_~i~0 > 0); 24851#L12 assume !(1 == main_~i~0); 24850#L12-2 assume !(10 == main_~i~0); 24849#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 24848#L18-1 assume !!(main_~i~0 > 0); 24847#L12 assume !(1 == main_~i~0); 24846#L12-2 assume !(10 == main_~i~0); 24845#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 24844#L18-1 assume !!(main_~i~0 > 0); 24843#L12 assume !(1 == main_~i~0); 24842#L12-2 assume !(10 == main_~i~0); 24841#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 24840#L18-1 assume !!(main_~i~0 > 0); 24839#L12 assume !(1 == main_~i~0); 24838#L12-2 assume !(10 == main_~i~0); 24837#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 24836#L18-1 assume !!(main_~i~0 > 0); 24835#L12 assume !(1 == main_~i~0); 24834#L12-2 assume !(10 == main_~i~0); 24833#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 24832#L18-1 assume !!(main_~i~0 > 0); 24831#L12 assume !(1 == main_~i~0); 24830#L12-2 assume !(10 == main_~i~0); 24829#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 24828#L18-1 assume !!(main_~i~0 > 0); 24827#L12 assume !(1 == main_~i~0); 24826#L12-2 assume !(10 == main_~i~0); 24824#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 24822#L18-1 assume !!(main_~i~0 > 0); 24817#L12 assume !(1 == main_~i~0); 24818#L12-2 assume 10 == main_~i~0;main_~up~0 := 0; 24814#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 24949#L18-1 assume !!(main_~i~0 > 0); 24947#L12 assume !(1 == main_~i~0); 24815#L12-2 assume !(10 == main_~i~0); 24762#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 24763#L18-1 assume !!(main_~i~0 > 0); 24955#L12 assume !(1 == main_~i~0); 24945#L12-2 assume !(10 == main_~i~0); 24942#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 24939#L18-1 assume !!(main_~i~0 > 0); 24936#L12 assume !(1 == main_~i~0); 24933#L12-2 assume !(10 == main_~i~0); 24930#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 24927#L18-1 assume !!(main_~i~0 > 0); 24924#L12 assume !(1 == main_~i~0); 24921#L12-2 assume !(10 == main_~i~0); 24918#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 24915#L18-1 assume !!(main_~i~0 > 0); 24912#L12 assume !(1 == main_~i~0); 24909#L12-2 assume !(10 == main_~i~0); 24906#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 24903#L18-1 assume !!(main_~i~0 > 0); 24900#L12 assume !(1 == main_~i~0); 24897#L12-2 assume !(10 == main_~i~0); 24894#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 24891#L18-1 assume !!(main_~i~0 > 0); 24888#L12 assume !(1 == main_~i~0); 24885#L12-2 assume !(10 == main_~i~0); 24882#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 24879#L18-1 assume !!(main_~i~0 > 0); 24876#L12 assume !(1 == main_~i~0); 24865#L12-2 assume !(10 == main_~i~0); 24872#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 24869#L18-1 assume !!(main_~i~0 > 0); 24864#L12 assume 1 == main_~i~0;main_~up~0 := 1; 24858#L12-2 [2020-10-26 04:16:44,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:44,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1439876841, now seen corresponding path program 16 times [2020-10-26 04:16:44,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:44,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384015917] [2020-10-26 04:16:44,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:44,506 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:44,513 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:44,515 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:44,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:44,516 INFO L82 PathProgramCache]: Analyzing trace with hash -680570443, now seen corresponding path program 14 times [2020-10-26 04:16:44,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:44,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085853781] [2020-10-26 04:16:44,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:44,524 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:44,530 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:44,532 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:44,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:16:44,533 INFO L82 PathProgramCache]: Analyzing trace with hash -569285429, now seen corresponding path program 17 times [2020-10-26 04:16:44,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:16:44,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523488280] [2020-10-26 04:16:44,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:16:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:44,547 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:16:44,559 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:16:44,564 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:16:45,068 WARN L193 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 66 [2020-10-26 04:16:45,648 WARN L193 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 69 [2020-10-26 04:16:45,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 04:16:45 BoogieIcfgContainer [2020-10-26 04:16:45,696 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 04:16:45,697 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 04:16:45,697 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 04:16:45,697 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 04:16:45,698 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:16:24" (3/4) ... [2020-10-26 04:16:45,701 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-26 04:16:45,769 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 04:16:45,769 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 04:16:45,771 INFO L168 Benchmark]: Toolchain (without parser) took 22119.83 ms. Allocated memory was 50.3 MB in the beginning and 272.6 MB in the end (delta: 222.3 MB). Free memory was 34.8 MB in the beginning and 207.3 MB in the end (delta: -172.5 MB). Peak memory consumption was 50.0 MB. Max. memory is 16.1 GB. [2020-10-26 04:16:45,771 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 37.7 MB. Free memory was 17.3 MB in the beginning and 17.3 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:16:45,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.87 ms. Allocated memory is still 50.3 MB. Free memory was 34.1 MB in the beginning and 25.7 MB in the end (delta: 8.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-10-26 04:16:45,772 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.89 ms. Allocated memory is still 50.3 MB. Free memory was 25.7 MB in the beginning and 24.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:16:45,772 INFO L168 Benchmark]: Boogie Preprocessor took 20.63 ms. Allocated memory is still 50.3 MB. Free memory was 24.5 MB in the beginning and 23.6 MB in the end (delta: 858.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:16:45,773 INFO L168 Benchmark]: RCFGBuilder took 254.39 ms. Allocated memory is still 50.3 MB. Free memory was 23.4 MB in the beginning and 29.2 MB in the end (delta: -5.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. [2020-10-26 04:16:45,774 INFO L168 Benchmark]: BuchiAutomizer took 21503.70 ms. Allocated memory was 50.3 MB in the beginning and 272.6 MB in the end (delta: 222.3 MB). Free memory was 29.0 MB in the beginning and 211.5 MB in the end (delta: -182.5 MB). Peak memory consumption was 132.8 MB. Max. memory is 16.1 GB. [2020-10-26 04:16:45,774 INFO L168 Benchmark]: Witness Printer took 72.61 ms. Allocated memory is still 272.6 MB. Free memory was 211.5 MB in the beginning and 207.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-26 04:16:45,776 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 37.7 MB. Free memory was 17.3 MB in the beginning and 17.3 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 220.87 ms. Allocated memory is still 50.3 MB. Free memory was 34.1 MB in the beginning and 25.7 MB in the end (delta: 8.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 35.89 ms. Allocated memory is still 50.3 MB. Free memory was 25.7 MB in the beginning and 24.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 20.63 ms. Allocated memory is still 50.3 MB. Free memory was 24.5 MB in the beginning and 23.6 MB in the end (delta: 858.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 254.39 ms. Allocated memory is still 50.3 MB. Free memory was 23.4 MB in the beginning and 29.2 MB in the end (delta: -5.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 21503.70 ms. Allocated memory was 50.3 MB in the beginning and 272.6 MB in the end (delta: 222.3 MB). Free memory was 29.0 MB in the beginning and 211.5 MB in the end (delta: -182.5 MB). Peak memory consumption was 132.8 MB. Max. memory is 16.1 GB. * Witness Printer took 72.61 ms. Allocated memory is still 272.6 MB. Free memory was 211.5 MB in the beginning and 207.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 31 terminating modules (19 trivial, 11 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 21 and consists of 5 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function i and consists of 10 locations. One deterministic module has affine ranking function i and consists of 12 locations. One deterministic module has affine ranking function i and consists of 14 locations. One deterministic module has affine ranking function i and consists of 16 locations. One deterministic module has affine ranking function i and consists of 18 locations. One deterministic module has affine ranking function i and consists of 20 locations. One nondeterministic module has affine ranking function -2 * i + 1 and consists of 5 locations. 19 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 247 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.4s and 23 iterations. TraceHistogramMax:19. Analysis of lassos took 13.9s. Construction of modules took 2.2s. Büchi inclusion checks took 4.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 29. Automata minimization 0.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 3072 StatesRemovedByMinimization, 28 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 247 states and ocurred in iteration 22. Nontrivial modules had stage [11, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 816/2384 HoareTripleCheckerStatistics: 229 SDtfs, 670 SDslu, 6 SDs, 0 SdLazy, 1964 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT0 SILN0 SILU0 SILI8 SILT9 lasso1 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax170 hnf96 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq196 hnf90 smp97 dnf114 smp98 tf110 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 71ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 26 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 12 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 15]: 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 {up=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c36d285=0, \result=0, i=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 Loop: [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...