./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_13.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec 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/NO_13.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 c0d0ad10124da460587cca853afd7fd9944c9aa2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.1-dev-20ed64e [2021-08-27 14:11:07,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 14:11:07,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 14:11:07,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 14:11:07,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 14:11:07,767 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 14:11:07,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 14:11:07,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 14:11:07,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 14:11:07,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 14:11:07,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 14:11:07,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 14:11:07,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 14:11:07,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 14:11:07,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 14:11:07,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 14:11:07,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 14:11:07,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 14:11:07,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 14:11:07,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 14:11:07,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 14:11:07,782 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 14:11:07,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 14:11:07,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 14:11:07,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 14:11:07,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 14:11:07,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 14:11:07,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 14:11:07,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 14:11:07,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 14:11:07,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 14:11:07,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 14:11:07,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 14:11:07,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 14:11:07,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 14:11:07,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 14:11:07,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 14:11:07,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 14:11:07,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 14:11:07,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 14:11:07,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 14:11:07,905 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-08-27 14:11:07,948 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 14:11:07,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 14:11:07,950 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 14:11:07,950 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 14:11:07,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 14:11:07,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 14:11:07,952 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 14:11:07,952 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 14:11:07,952 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 14:11:07,952 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 14:11:07,953 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 14:11:07,953 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 14:11:07,953 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 14:11:07,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 14:11:07,954 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 14:11:07,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 14:11:07,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 14:11:07,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 14:11:07,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 14:11:07,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 14:11:07,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 14:11:07,955 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 14:11:07,955 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 14:11:07,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 14:11:07,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 14:11:07,955 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 14:11:07,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 14:11:07,955 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 14:11:07,956 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 14:11:07,956 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 14:11:07,956 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 -> c0d0ad10124da460587cca853afd7fd9944c9aa2 [2021-08-27 14:11:08,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 14:11:08,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 14:11:08,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 14:11:08,212 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 14:11:08,212 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 14:11:08,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_13.c [2021-08-27 14:11:08,257 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ba2ab18a/cdb0c384ad2c41d3ab18aadb29ba3855/FLAG8cc40aa1e [2021-08-27 14:11:08,602 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 14:11:08,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_13.c [2021-08-27 14:11:08,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ba2ab18a/cdb0c384ad2c41d3ab18aadb29ba3855/FLAG8cc40aa1e [2021-08-27 14:11:09,042 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ba2ab18a/cdb0c384ad2c41d3ab18aadb29ba3855 [2021-08-27 14:11:09,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 14:11:09,045 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 14:11:09,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 14:11:09,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 14:11:09,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 14:11:09,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:11:09" (1/1) ... [2021-08-27 14:11:09,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca27c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:11:09, skipping insertion in model container [2021-08-27 14:11:09,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:11:09" (1/1) ... [2021-08-27 14:11:09,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 14:11:09,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 14:11:09,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:11:09,137 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 14:11:09,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:11:09,150 INFO L208 MainTranslator]: Completed translation [2021-08-27 14:11:09,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:11:09 WrapperNode [2021-08-27 14:11:09,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 14:11:09,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 14:11:09,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 14:11:09,152 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 14:11:09,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:11:09" (1/1) ... [2021-08-27 14:11:09,159 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:11:09" (1/1) ... [2021-08-27 14:11:09,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 14:11:09,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 14:11:09,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 14:11:09,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 14:11:09,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:11:09" (1/1) ... [2021-08-27 14:11:09,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:11:09" (1/1) ... [2021-08-27 14:11:09,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:11:09" (1/1) ... [2021-08-27 14:11:09,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:11:09" (1/1) ... [2021-08-27 14:11:09,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:11:09" (1/1) ... [2021-08-27 14:11:09,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:11:09" (1/1) ... [2021-08-27 14:11:09,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:11:09" (1/1) ... [2021-08-27 14:11:09,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 14:11:09,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 14:11:09,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 14:11:09,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 14:11:09,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:11:09" (1/1) ... [2021-08-27 14:11:09,214 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:09,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:09,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:09,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 14:11:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 14:11:09,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 14:11:09,389 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 14:11:09,390 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-27 14:11:09,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:11:09 BoogieIcfgContainer [2021-08-27 14:11:09,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 14:11:09,394 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 14:11:09,395 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 14:11:09,397 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 14:11:09,397 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:11:09,397 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 02:11:09" (1/3) ... [2021-08-27 14:11:09,398 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@773063d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:11:09, skipping insertion in model container [2021-08-27 14:11:09,398 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:11:09,399 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:11:09" (2/3) ... [2021-08-27 14:11:09,399 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@773063d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:11:09, skipping insertion in model container [2021-08-27 14:11:09,399 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:11:09,399 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:11:09" (3/3) ... [2021-08-27 14:11:09,400 INFO L389 chiAutomizerObserver]: Analyzing ICFG NO_13.c [2021-08-27 14:11:09,439 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 14:11:09,440 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 14:11:09,440 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 14:11:09,440 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 14:11:09,440 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 14:11:09,440 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 14:11:09,440 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 14:11:09,440 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 14:11:09,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:09,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:11:09,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:09,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:09,460 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1] [2021-08-27 14:11:09,461 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:11:09,461 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 14:11:09,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:09,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:11:09,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:09,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:09,461 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1] [2021-08-27 14:11:09,461 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:11:09,465 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 3#L12-2true [2021-08-27 14:11:09,465 INFO L793 eck$LassoCheckResult]: Loop: 3#L12-2true assume !!(main_~i~0 < main_~j~0); 8#L12true assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3#L12-2true [2021-08-27 14:11:09,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:09,468 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2021-08-27 14:11:09,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:09,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517123919] [2021-08-27 14:11:09,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:09,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:09,515 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:09,525 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:09,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:09,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2021-08-27 14:11:09,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:09,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31084595] [2021-08-27 14:11:09,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:09,528 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:09,534 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:09,537 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:09,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:09,538 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2021-08-27 14:11:09,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:09,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126145394] [2021-08-27 14:11:09,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:09,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:09,544 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:09,548 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:09,615 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:11:09,616 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:11:09,616 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:11:09,616 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:11:09,616 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 14:11:09,616 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:09,616 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:11:09,617 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:11:09,617 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2021-08-27 14:11:09,617 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:11:09,617 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:11:09,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:09,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:09,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:09,717 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:11:09,717 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 14:11:09,718 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:09,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:09,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:09,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-27 14:11:09,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:11:09,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:11:09,748 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 14:11:09,748 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: [] [2021-08-27 14:11:09,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-08-27 14:11:09,767 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:09,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:09,768 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:09,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-27 14:11:09,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:11:09,770 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:11:09,784 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 14:11:09,785 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: [] [2021-08-27 14:11:09,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-27 14:11:09,801 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:09,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:09,802 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:09,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-27 14:11:09,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:11:09,815 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:11:09,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-27 14:11:09,845 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:09,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:09,846 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:09,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-27 14:11:09,849 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 14:11:09,849 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:11:09,880 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 14:11:09,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-27 14:11:09,888 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:11:09,888 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:11:09,888 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:11:09,888 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:11:09,888 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:11:09,888 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:09,888 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:11:09,888 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:11:09,889 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2021-08-27 14:11:09,889 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:11:09,889 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:11:09,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:09,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:09,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:09,969 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:11:09,972 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:11:09,973 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:09,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:09,974 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:09,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:11:09,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:11:09,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:11:09,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:11:09,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-27 14:11:09,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:11:10,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:11:10,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:11:10,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:11:10,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-08-27 14:11:10,036 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:10,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:10,037 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:10,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-27 14:11:10,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:11:10,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:11:10,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:11:10,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:11:10,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:11:10,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:11:10,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:11:10,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:11:10,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-08-27 14:11:10,085 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:10,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:10,085 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:10,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-27 14:11:10,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:11:10,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:11:10,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:11:10,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:11:10,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:11:10,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:11:10,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:11:10,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:11:10,105 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:11:10,117 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 14:11:10,117 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-08-27 14:11:10,118 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:10,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:10,119 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:10,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-27 14:11:10,120 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:11:10,120 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 14:11:10,120 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:11:10,121 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2021-08-27 14:11:10,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-27 14:11:10,138 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 14:11:10,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:10,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 14:11:10,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:10,175 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:11:10,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:10,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:11:10,199 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2021-08-27 14:11:10,200 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:10,228 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 30 transitions. Complement of second has 6 states. [2021-08-27 14:11:10,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 14:11:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2021-08-27 14:11:10,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2021-08-27 14:11:10,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:11:10,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2021-08-27 14:11:10,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:11:10,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2021-08-27 14:11:10,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:11:10,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2021-08-27 14:11:10,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:11:10,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2021-08-27 14:11:10,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2021-08-27 14:11:10,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2021-08-27 14:11:10,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2021-08-27 14:11:10,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:10,240 INFO L681 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2021-08-27 14:11:10,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2021-08-27 14:11:10,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2021-08-27 14:11:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:10,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2021-08-27 14:11:10,255 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2021-08-27 14:11:10,255 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2021-08-27 14:11:10,256 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 14:11:10,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2021-08-27 14:11:10,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:11:10,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:10,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:10,257 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-08-27 14:11:10,257 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:11:10,257 INFO L791 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 69#L12-2 assume !!(main_~i~0 < main_~j~0); 67#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 63#L12-2 [2021-08-27 14:11:10,257 INFO L793 eck$LassoCheckResult]: Loop: 63#L12-2 assume !!(main_~i~0 < main_~j~0); 64#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 63#L12-2 [2021-08-27 14:11:10,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:10,257 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2021-08-27 14:11:10,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:10,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139576035] [2021-08-27 14:11:10,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:10,258 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:11:10,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:10,280 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139576035] [2021-08-27 14:11:10,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139576035] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:11:10,281 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:11:10,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-27 14:11:10,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261730120] [2021-08-27 14:11:10,283 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:11:10,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:10,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2021-08-27 14:11:10,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:10,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167870803] [2021-08-27 14:11:10,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:10,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:10,287 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:10,290 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:10,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-27 14:11:10,341 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:11:10,343 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:11:10,343 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:11:10,343 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:11:10,343 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 14:11:10,343 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:10,344 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:11:10,344 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:11:10,344 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2021-08-27 14:11:10,344 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:11:10,344 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:11:10,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:10,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:10,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:10,394 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:11:10,395 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 14:11:10,395 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:10,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:10,399 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:10,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-27 14:11:10,401 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:11:10,401 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:11:10,414 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 14:11:10,415 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: [] [2021-08-27 14:11:10,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2021-08-27 14:11:10,430 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:10,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:10,432 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:10,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 14:11:10,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:11:10,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:11:10,452 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 14:11:10,452 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: [] [2021-08-27 14:11:10,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-27 14:11:10,468 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:10,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:10,469 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:10,477 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:11:10,477 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:11:10,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-27 14:11:10,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-27 14:11:10,524 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:10,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:10,525 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:10,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 14:11:10,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 14:11:10,575 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:11:10,611 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 14:11:10,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-27 14:11:10,617 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:11:10,617 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:11:10,617 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:11:10,617 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:11:10,617 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:11:10,617 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:10,617 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:11:10,617 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:11:10,617 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2021-08-27 14:11:10,617 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:11:10,617 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:11:10,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:10,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:10,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:10,661 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:11:10,661 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:11:10,662 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:10,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:10,663 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:10,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:11:10,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:11:10,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:11:10,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:11:10,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:11:10,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:11:10,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:11:10,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 14:11:10,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:11:10,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-27 14:11:10,710 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:10,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:10,711 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:10,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 14:11:10,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:11:10,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:11:10,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:11:10,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:11:10,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:11:10,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:11:10,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:11:10,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:11:10,728 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:11:10,730 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2021-08-27 14:11:10,730 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 14:11:10,730 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:10,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:10,731 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:10,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-27 14:11:10,732 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:11:10,733 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 14:11:10,733 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:11:10,733 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2021-08-27 14:11:10,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 14:11:10,750 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 14:11:10,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:10,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 14:11:10,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:10,780 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:11:10,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:10,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:11:10,787 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2021-08-27 14:11:10,788 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:10,797 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 11 states and 16 transitions. Complement of second has 5 states. [2021-08-27 14:11:10,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 14:11:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2021-08-27 14:11:10,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2021-08-27 14:11:10,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:11:10,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2021-08-27 14:11:10,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:11:10,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2021-08-27 14:11:10,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:11:10,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2021-08-27 14:11:10,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:11:10,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2021-08-27 14:11:10,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-27 14:11:10,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-27 14:11:10,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2021-08-27 14:11:10,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:10,805 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2021-08-27 14:11:10,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2021-08-27 14:11:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-08-27 14:11:10,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:10,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2021-08-27 14:11:10,813 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2021-08-27 14:11:10,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:10,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:11:10,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:11:10,817 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:10,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:10,825 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2021-08-27 14:11:10,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:11:10,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2021-08-27 14:11:10,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:11:10,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2021-08-27 14:11:10,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-08-27 14:11:10,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-27 14:11:10,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2021-08-27 14:11:10,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:10,828 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-08-27 14:11:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2021-08-27 14:11:10,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2021-08-27 14:11:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2021-08-27 14:11:10,829 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2021-08-27 14:11:10,829 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2021-08-27 14:11:10,829 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 14:11:10,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2021-08-27 14:11:10,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 14:11:10,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:10,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:10,832 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1] [2021-08-27 14:11:10,832 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:11:10,832 INFO L791 eck$LassoCheckResult]: Stem: 144#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 139#L12-2 assume !!(main_~i~0 < main_~j~0); 140#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 149#L12-2 assume !!(main_~i~0 < main_~j~0); 148#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 146#L12-2 assume !!(main_~i~0 < main_~j~0); 142#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 145#L12-2 [2021-08-27 14:11:10,832 INFO L793 eck$LassoCheckResult]: Loop: 145#L12-2 assume !!(main_~i~0 < main_~j~0); 147#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 145#L12-2 [2021-08-27 14:11:10,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:10,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1366043347, now seen corresponding path program 1 times [2021-08-27 14:11:10,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:10,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933295065] [2021-08-27 14:11:10,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:10,836 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:10,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-27 14:11:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:11:10,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:10,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933295065] [2021-08-27 14:11:10,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933295065] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:10,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571569422] [2021-08-27 14:11:10,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:10,889 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:10,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:10,895 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:10,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-27 14:11:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:10,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 14:11:10,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:11:10,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571569422] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:10,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:10,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2021-08-27 14:11:10,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129248761] [2021-08-27 14:11:10,978 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:11:10,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:10,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2021-08-27 14:11:10,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:10,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043092391] [2021-08-27 14:11:10,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:10,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:10,991 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:10,999 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:11,022 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:11:11,022 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:11:11,022 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:11:11,022 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:11:11,023 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 14:11:11,023 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:11,023 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:11:11,023 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:11:11,023 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2021-08-27 14:11:11,024 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:11:11,024 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:11:11,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:11,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:11,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:11,081 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:11:11,081 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 14:11:11,081 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:11,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:11,082 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:11,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-27 14:11:11,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:11:11,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:11:11,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2021-08-27 14:11:11,106 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:11,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:11,107 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:11,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-27 14:11:11,108 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 14:11:11,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:11:11,149 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 14:11:11,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-27 14:11:11,154 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:11:11,154 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:11:11,154 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:11:11,154 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:11:11,154 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:11:11,154 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:11,154 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:11:11,154 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:11:11,154 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2021-08-27 14:11:11,154 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:11:11,154 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:11:11,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:11,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:11,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:11,198 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:11:11,198 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:11:11,198 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:11,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:11,201 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:11,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:11:11,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:11:11,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:11:11,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:11:11,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:11:11,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:11:11,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:11:11,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:11:11,233 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:11:11,236 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 14:11:11,236 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-08-27 14:11:11,236 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:11,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:11,237 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:11,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-27 14:11:11,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-27 14:11:11,239 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:11:11,239 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 14:11:11,240 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:11:11,240 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2021-08-27 14:11:11,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-27 14:11:11,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2021-08-27 14:11:11,277 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 14:11:11,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:11,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 14:11:11,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:11,329 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:11:11,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:11:11,335 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2021-08-27 14:11:11,336 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:11,345 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 19 transitions. Complement of second has 5 states. [2021-08-27 14:11:11,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 14:11:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:11,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2021-08-27 14:11:11,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 2 letters. [2021-08-27 14:11:11,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:11:11,346 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-27 14:11:11,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:11,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 14:11:11,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:11,379 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:11:11,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:11:11,385 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2021-08-27 14:11:11,385 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:11,390 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 19 transitions. Complement of second has 5 states. [2021-08-27 14:11:11,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 14:11:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2021-08-27 14:11:11,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 2 letters. [2021-08-27 14:11:11,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:11:11,391 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-27 14:11:11,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:11,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 14:11:11,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:11,428 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:11:11,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:11,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:11:11,435 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 1 loop predicates [2021-08-27 14:11:11,436 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:11,443 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 22 transitions. Complement of second has 4 states. [2021-08-27 14:11:11,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 14:11:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:11,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2021-08-27 14:11:11,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2021-08-27 14:11:11,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:11:11,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 9 letters. Loop has 2 letters. [2021-08-27 14:11:11,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:11:11,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2021-08-27 14:11:11,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:11:11,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2021-08-27 14:11:11,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:11:11,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 18 transitions. [2021-08-27 14:11:11,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2021-08-27 14:11:11,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-27 14:11:11,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2021-08-27 14:11:11,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:11,446 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-08-27 14:11:11,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2021-08-27 14:11:11,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 6. [2021-08-27 14:11:11,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2021-08-27 14:11:11,447 INFO L704 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2021-08-27 14:11:11,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:11,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 14:11:11,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 14:11:11,448 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:11,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:11,457 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2021-08-27 14:11:11,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 14:11:11,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2021-08-27 14:11:11,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:11:11,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 9 states and 11 transitions. [2021-08-27 14:11:11,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2021-08-27 14:11:11,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2021-08-27 14:11:11,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2021-08-27 14:11:11,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:11,459 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2021-08-27 14:11:11,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2021-08-27 14:11:11,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2021-08-27 14:11:11,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2021-08-27 14:11:11,461 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2021-08-27 14:11:11,461 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2021-08-27 14:11:11,461 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 14:11:11,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2021-08-27 14:11:11,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:11:11,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:11,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:11,462 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1] [2021-08-27 14:11:11,462 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:11:11,462 INFO L791 eck$LassoCheckResult]: Stem: 339#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 335#L12-2 assume !!(main_~i~0 < main_~j~0); 336#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 337#L12-2 assume !!(main_~i~0 < main_~j~0); 338#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 342#L12-2 assume !!(main_~i~0 < main_~j~0); 340#L12 [2021-08-27 14:11:11,462 INFO L793 eck$LassoCheckResult]: Loop: 340#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 341#L12-2 assume !!(main_~i~0 < main_~j~0); 340#L12 [2021-08-27 14:11:11,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:11,463 INFO L82 PathProgramCache]: Analyzing trace with hash 925765348, now seen corresponding path program 2 times [2021-08-27 14:11:11,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:11,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276612715] [2021-08-27 14:11:11,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:11,463 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:11,470 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:11,474 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:11,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:11,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 1 times [2021-08-27 14:11:11,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:11,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596851719] [2021-08-27 14:11:11,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:11,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:11,477 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:11,479 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:11,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:11,479 INFO L82 PathProgramCache]: Analyzing trace with hash 602269631, now seen corresponding path program 2 times [2021-08-27 14:11:11,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:11,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536306965] [2021-08-27 14:11:11,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:11,479 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:11:11,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:11,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536306965] [2021-08-27 14:11:11,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536306965] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:11,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525606962] [2021-08-27 14:11:11,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:11:11,508 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:11,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:11,508 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:11,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-08-27 14:11:11,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 14:11:11,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:11,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:11:11,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:11:11,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525606962] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:11,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:11,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-27 14:11:11,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820350119] [2021-08-27 14:11:11,605 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:11:11,606 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:11:11,606 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:11:11,606 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:11:11,606 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 14:11:11,606 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:11,606 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:11:11,606 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:11:11,606 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2021-08-27 14:11:11,606 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:11:11,606 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:11:11,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:11,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:11,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:11,650 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:11:11,650 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 14:11:11,650 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:11,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:11,651 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:11,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-27 14:11:11,653 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:11:11,653 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:11:11,665 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 14:11:11,665 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 14:11:11,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-27 14:11:11,680 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:11,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:11,681 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:11,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-27 14:11:11,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:11:11,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:11:11,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-08-27 14:11:11,713 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:11,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:11,714 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:11,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-08-27 14:11:11,715 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 14:11:11,715 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:11:11,743 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 14:11:11,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-08-27 14:11:11,746 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:11:11,746 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:11:11,746 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:11:11,746 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:11:11,746 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:11:11,746 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:11,746 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:11:11,746 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:11:11,746 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2021-08-27 14:11:11,746 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:11:11,746 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:11:11,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:11,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:11,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:11:11,798 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:11:11,798 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:11:11,799 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:11,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:11,801 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:11,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:11:11,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:11:11,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:11:11,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:11:11,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:11:11,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:11:11,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:11:11,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:11:11,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-08-27 14:11:11,830 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:11:11,832 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 14:11:11,832 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 14:11:11,832 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:11:11,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:11,833 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:11:11,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-08-27 14:11:11,834 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:11:11,834 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 14:11:11,834 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:11:11,835 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 103 Supporting invariants [] [2021-08-27 14:11:11,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-08-27 14:11:11,850 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 14:11:11,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:11,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 14:11:11,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:11,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-08-27 14:11:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:11,897 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:11:11,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:11:11,919 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 [2021-08-27 14:11:11,919 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:11,928 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8 states and 10 transitions. Complement of second has 3 states. [2021-08-27 14:11:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2021-08-27 14:11:11,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2021-08-27 14:11:11,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 6 letters. Loop has 2 letters. [2021-08-27 14:11:11,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:11:11,929 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-27 14:11:11,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:11,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 14:11:11,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:11,966 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:11:11,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:11:11,988 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 14:11:11,988 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:11,993 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8 states and 10 transitions. Complement of second has 3 states. [2021-08-27 14:11:11,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2021-08-27 14:11:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:11,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2021-08-27 14:11:11,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 6 letters. Loop has 2 letters. [2021-08-27 14:11:11,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:11:11,994 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-27 14:11:12,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:12,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 14:11:12,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:12,024 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:11:12,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:12,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:11:12,046 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 14:11:12,046 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:12,053 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 14 transitions. Complement of second has 4 states. [2021-08-27 14:11:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 14:11:12,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2021-08-27 14:11:12,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2021-08-27 14:11:12,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:11:12,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2021-08-27 14:11:12,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:11:12,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2021-08-27 14:11:12,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:11:12,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2021-08-27 14:11:12,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 14:11:12,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 12 transitions. [2021-08-27 14:11:12,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:12,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:12,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2021-08-27 14:11:12,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:12,057 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2021-08-27 14:11:12,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2021-08-27 14:11:12,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2021-08-27 14:11:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2021-08-27 14:11:12,058 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2021-08-27 14:11:12,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:12,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 14:11:12,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 14:11:12,059 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:12,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:12,067 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2021-08-27 14:11:12,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 14:11:12,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2021-08-27 14:11:12,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:12,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 14 transitions. [2021-08-27 14:11:12,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:12,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:12,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2021-08-27 14:11:12,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:12,069 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2021-08-27 14:11:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2021-08-27 14:11:12,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2021-08-27 14:11:12,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2021-08-27 14:11:12,070 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2021-08-27 14:11:12,070 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2021-08-27 14:11:12,070 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 14:11:12,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2021-08-27 14:11:12,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:12,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:12,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:12,071 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 1] [2021-08-27 14:11:12,071 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:12,071 INFO L791 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 515#L12-2 assume !!(main_~i~0 < main_~j~0); 516#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 517#L12-2 assume !!(main_~i~0 < main_~j~0); 518#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 525#L12-2 assume !!(main_~i~0 < main_~j~0); 524#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 523#L12-2 assume !!(main_~i~0 < main_~j~0); 520#L12 [2021-08-27 14:11:12,071 INFO L793 eck$LassoCheckResult]: Loop: 520#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 521#L12-2 assume !!(main_~i~0 < main_~j~0); 524#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 523#L12-2 assume !!(main_~i~0 < main_~j~0); 520#L12 [2021-08-27 14:11:12,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:12,071 INFO L82 PathProgramCache]: Analyzing trace with hash 602269569, now seen corresponding path program 3 times [2021-08-27 14:11:12,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:12,072 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834050682] [2021-08-27 14:11:12,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:12,072 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,077 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,081 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:12,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:12,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2021-08-27 14:11:12,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:12,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315217916] [2021-08-27 14:11:12,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:12,081 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,084 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,088 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:12,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:12,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1740322745, now seen corresponding path program 3 times [2021-08-27 14:11:12,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:12,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436840969] [2021-08-27 14:11:12,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:12,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:12,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:12,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436840969] [2021-08-27 14:11:12,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436840969] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:12,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530728720] [2021-08-27 14:11:12,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 14:11:12,117 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:12,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:12,118 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:12,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-08-27 14:11:12,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-08-27 14:11:12,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:12,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 14:11:12,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:12,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530728720] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:12,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:12,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2021-08-27 14:11:12,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360525108] [2021-08-27 14:11:12,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:12,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 14:11:12,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 14:11:12,239 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 3 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:12,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:12,252 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2021-08-27 14:11:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 14:11:12,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2021-08-27 14:11:12,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:12,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2021-08-27 14:11:12,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:12,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:12,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2021-08-27 14:11:12,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:12,254 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-08-27 14:11:12,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2021-08-27 14:11:12,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2021-08-27 14:11:12,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:12,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-08-27 14:11:12,255 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-08-27 14:11:12,255 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-08-27 14:11:12,255 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 14:11:12,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2021-08-27 14:11:12,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:12,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:12,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:12,256 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 1] [2021-08-27 14:11:12,256 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:12,256 INFO L791 eck$LassoCheckResult]: Stem: 589#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 585#L12-2 assume !!(main_~i~0 < main_~j~0); 586#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 587#L12-2 assume !!(main_~i~0 < main_~j~0); 588#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 597#L12-2 assume !!(main_~i~0 < main_~j~0); 596#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 595#L12-2 assume !!(main_~i~0 < main_~j~0); 594#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 593#L12-2 assume !!(main_~i~0 < main_~j~0); 590#L12 [2021-08-27 14:11:12,256 INFO L793 eck$LassoCheckResult]: Loop: 590#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 591#L12-2 assume !!(main_~i~0 < main_~j~0); 594#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 593#L12-2 assume !!(main_~i~0 < main_~j~0); 590#L12 [2021-08-27 14:11:12,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:12,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1039528738, now seen corresponding path program 4 times [2021-08-27 14:11:12,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:12,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290008347] [2021-08-27 14:11:12,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:12,257 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,262 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,266 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:12,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:12,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 2 times [2021-08-27 14:11:12,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:12,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654070168] [2021-08-27 14:11:12,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:12,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,269 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,271 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:12,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:12,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1650681494, now seen corresponding path program 4 times [2021-08-27 14:11:12,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:12,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486535232] [2021-08-27 14:11:12,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:12,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:12,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:12,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486535232] [2021-08-27 14:11:12,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486535232] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:12,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554310798] [2021-08-27 14:11:12,312 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 14:11:12,312 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:12,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:12,313 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:12,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-08-27 14:11:12,357 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 14:11:12,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:12,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 14:11:12,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:12,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554310798] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:12,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:12,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-08-27 14:11:12,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838926486] [2021-08-27 14:11:12,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:12,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 14:11:12,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 14:11:12,442 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:12,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:12,457 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2021-08-27 14:11:12,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 14:11:12,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2021-08-27 14:11:12,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:12,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 18 transitions. [2021-08-27 14:11:12,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:12,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:12,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2021-08-27 14:11:12,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:12,459 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2021-08-27 14:11:12,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2021-08-27 14:11:12,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2021-08-27 14:11:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-08-27 14:11:12,460 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-08-27 14:11:12,460 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-08-27 14:11:12,460 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 14:11:12,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2021-08-27 14:11:12,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:12,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:12,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:12,461 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 1] [2021-08-27 14:11:12,461 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:12,461 INFO L791 eck$LassoCheckResult]: Stem: 670#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 666#L12-2 assume !!(main_~i~0 < main_~j~0); 667#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 668#L12-2 assume !!(main_~i~0 < main_~j~0); 669#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 680#L12-2 assume !!(main_~i~0 < main_~j~0); 679#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 678#L12-2 assume !!(main_~i~0 < main_~j~0); 676#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 675#L12-2 assume !!(main_~i~0 < main_~j~0); 674#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 673#L12-2 assume !!(main_~i~0 < main_~j~0); 671#L12 [2021-08-27 14:11:12,461 INFO L793 eck$LassoCheckResult]: Loop: 671#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 672#L12-2 assume !!(main_~i~0 < main_~j~0); 674#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 673#L12-2 assume !!(main_~i~0 < main_~j~0); 671#L12 [2021-08-27 14:11:12,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:12,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1740263163, now seen corresponding path program 5 times [2021-08-27 14:11:12,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:12,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168275605] [2021-08-27 14:11:12,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:12,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,468 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,483 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:12,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:12,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 3 times [2021-08-27 14:11:12,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:12,484 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885223826] [2021-08-27 14:11:12,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:12,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,486 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,488 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:12,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:12,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1404785203, now seen corresponding path program 5 times [2021-08-27 14:11:12,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:12,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402690826] [2021-08-27 14:11:12,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:12,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:12,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:12,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402690826] [2021-08-27 14:11:12,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402690826] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:12,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862984767] [2021-08-27 14:11:12,526 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 14:11:12,527 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:12,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:12,528 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:12,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-08-27 14:11:12,578 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-08-27 14:11:12,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:12,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 14:11:12,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:12,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862984767] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:12,636 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:12,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2021-08-27 14:11:12,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882968166] [2021-08-27 14:11:12,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:12,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 14:11:12,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 14:11:12,673 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 3 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:12,687 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2021-08-27 14:11:12,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 14:11:12,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2021-08-27 14:11:12,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:12,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 20 transitions. [2021-08-27 14:11:12,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:12,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:12,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2021-08-27 14:11:12,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:12,689 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-08-27 14:11:12,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2021-08-27 14:11:12,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-08-27 14:11:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-08-27 14:11:12,690 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-08-27 14:11:12,690 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-08-27 14:11:12,690 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 14:11:12,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2021-08-27 14:11:12,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:12,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:12,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:12,691 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 1] [2021-08-27 14:11:12,691 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:12,691 INFO L791 eck$LassoCheckResult]: Stem: 762#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 758#L12-2 assume !!(main_~i~0 < main_~j~0); 759#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 760#L12-2 assume !!(main_~i~0 < main_~j~0); 761#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 765#L12-2 assume !!(main_~i~0 < main_~j~0); 774#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 773#L12-2 assume !!(main_~i~0 < main_~j~0); 772#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 771#L12-2 assume !!(main_~i~0 < main_~j~0); 769#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 768#L12-2 assume !!(main_~i~0 < main_~j~0); 767#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 766#L12-2 assume !!(main_~i~0 < main_~j~0); 763#L12 [2021-08-27 14:11:12,691 INFO L793 eck$LassoCheckResult]: Loop: 763#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 764#L12-2 assume !!(main_~i~0 < main_~j~0); 767#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 766#L12-2 assume !!(main_~i~0 < main_~j~0); 763#L12 [2021-08-27 14:11:12,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:12,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1650621912, now seen corresponding path program 6 times [2021-08-27 14:11:12,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:12,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466471891] [2021-08-27 14:11:12,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:12,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,697 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,701 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:12,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:12,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 4 times [2021-08-27 14:11:12,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:12,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700881389] [2021-08-27 14:11:12,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:12,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,704 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,706 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:12,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:12,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1321650832, now seen corresponding path program 6 times [2021-08-27 14:11:12,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:12,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446183034] [2021-08-27 14:11:12,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:12,707 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:12,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:12,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446183034] [2021-08-27 14:11:12,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446183034] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:12,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789638205] [2021-08-27 14:11:12,751 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 14:11:12,752 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:12,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:12,756 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:12,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-08-27 14:11:12,846 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2021-08-27 14:11:12,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:12,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 14:11:12,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:12,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789638205] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:12,897 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:12,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2021-08-27 14:11:12,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601953504] [2021-08-27 14:11:12,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:12,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 14:11:12,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-08-27 14:11:12,935 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 3 Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:12,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:12,955 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2021-08-27 14:11:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 14:11:12,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2021-08-27 14:11:12,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:12,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 22 transitions. [2021-08-27 14:11:12,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:12,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:12,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2021-08-27 14:11:12,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:12,957 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-08-27 14:11:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2021-08-27 14:11:12,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-08-27 14:11:12,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2021-08-27 14:11:12,959 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-08-27 14:11:12,959 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-08-27 14:11:12,959 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 14:11:12,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2021-08-27 14:11:12,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:12,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:12,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:12,960 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 1] [2021-08-27 14:11:12,960 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:12,960 INFO L791 eck$LassoCheckResult]: Stem: 865#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 861#L12-2 assume !!(main_~i~0 < main_~j~0); 862#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 863#L12-2 assume !!(main_~i~0 < main_~j~0); 864#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 868#L12-2 assume !!(main_~i~0 < main_~j~0); 879#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 878#L12-2 assume !!(main_~i~0 < main_~j~0); 877#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 876#L12-2 assume !!(main_~i~0 < main_~j~0); 875#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 874#L12-2 assume !!(main_~i~0 < main_~j~0); 872#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 871#L12-2 assume !!(main_~i~0 < main_~j~0); 870#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 869#L12-2 assume !!(main_~i~0 < main_~j~0); 866#L12 [2021-08-27 14:11:12,961 INFO L793 eck$LassoCheckResult]: Loop: 866#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 867#L12-2 assume !!(main_~i~0 < main_~j~0); 870#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 869#L12-2 assume !!(main_~i~0 < main_~j~0); 866#L12 [2021-08-27 14:11:12,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:12,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1404725621, now seen corresponding path program 7 times [2021-08-27 14:11:12,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:12,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688035670] [2021-08-27 14:11:12,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:12,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,968 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,973 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:12,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:12,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 5 times [2021-08-27 14:11:12,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:12,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323904645] [2021-08-27 14:11:12,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:12,975 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,977 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:12,979 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:12,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1261068371, now seen corresponding path program 7 times [2021-08-27 14:11:12,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:12,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738768598] [2021-08-27 14:11:12,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:12,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:13,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:13,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738768598] [2021-08-27 14:11:13,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738768598] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:13,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993242662] [2021-08-27 14:11:13,043 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 14:11:13,043 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:13,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:13,048 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:13,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-08-27 14:11:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:13,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 14:11:13,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:13,198 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:13,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993242662] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:13,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:13,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2021-08-27 14:11:13,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608824940] [2021-08-27 14:11:13,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:13,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 14:11:13,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-27 14:11:13,233 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 3 Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:13,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:13,252 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2021-08-27 14:11:13,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 14:11:13,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2021-08-27 14:11:13,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:13,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 24 transitions. [2021-08-27 14:11:13,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:13,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:13,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2021-08-27 14:11:13,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:13,254 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-08-27 14:11:13,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2021-08-27 14:11:13,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-08-27 14:11:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2021-08-27 14:11:13,255 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2021-08-27 14:11:13,255 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2021-08-27 14:11:13,255 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 14:11:13,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2021-08-27 14:11:13,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:13,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:13,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:13,256 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 1] [2021-08-27 14:11:13,256 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:13,256 INFO L791 eck$LassoCheckResult]: Stem: 979#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 975#L12-2 assume !!(main_~i~0 < main_~j~0); 976#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 977#L12-2 assume !!(main_~i~0 < main_~j~0); 978#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 982#L12-2 assume !!(main_~i~0 < main_~j~0); 995#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 994#L12-2 assume !!(main_~i~0 < main_~j~0); 993#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 992#L12-2 assume !!(main_~i~0 < main_~j~0); 991#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 990#L12-2 assume !!(main_~i~0 < main_~j~0); 989#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 988#L12-2 assume !!(main_~i~0 < main_~j~0); 986#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 985#L12-2 assume !!(main_~i~0 < main_~j~0); 984#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 983#L12-2 assume !!(main_~i~0 < main_~j~0); 980#L12 [2021-08-27 14:11:13,256 INFO L793 eck$LassoCheckResult]: Loop: 980#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 981#L12-2 assume !!(main_~i~0 < main_~j~0); 984#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 983#L12-2 assume !!(main_~i~0 < main_~j~0); 980#L12 [2021-08-27 14:11:13,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:13,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1321591250, now seen corresponding path program 8 times [2021-08-27 14:11:13,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:13,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934435997] [2021-08-27 14:11:13,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:13,257 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:13,262 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:13,267 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:13,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:13,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 6 times [2021-08-27 14:11:13,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:13,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316451867] [2021-08-27 14:11:13,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:13,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:13,269 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:13,271 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:13,271 INFO L82 PathProgramCache]: Analyzing trace with hash -763125366, now seen corresponding path program 8 times [2021-08-27 14:11:13,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:13,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263757701] [2021-08-27 14:11:13,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:13,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:13,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:13,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263757701] [2021-08-27 14:11:13,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263757701] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:13,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753367891] [2021-08-27 14:11:13,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:11:13,353 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:13,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:13,364 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:13,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-08-27 14:11:13,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 14:11:13,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:13,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 14:11:13,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:13,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753367891] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:13,506 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:13,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2021-08-27 14:11:13,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208399648] [2021-08-27 14:11:13,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:13,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 14:11:13,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-08-27 14:11:13,544 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. cyclomatic complexity: 3 Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:13,567 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2021-08-27 14:11:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 14:11:13,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2021-08-27 14:11:13,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:13,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 26 transitions. [2021-08-27 14:11:13,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:13,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:13,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2021-08-27 14:11:13,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:13,569 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-08-27 14:11:13,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2021-08-27 14:11:13,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2021-08-27 14:11:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2021-08-27 14:11:13,570 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2021-08-27 14:11:13,571 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2021-08-27 14:11:13,571 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 14:11:13,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2021-08-27 14:11:13,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:13,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:13,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:13,572 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 1] [2021-08-27 14:11:13,572 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:13,572 INFO L791 eck$LassoCheckResult]: Stem: 1104#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 1100#L12-2 assume !!(main_~i~0 < main_~j~0); 1101#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1102#L12-2 assume !!(main_~i~0 < main_~j~0); 1103#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1107#L12-2 assume !!(main_~i~0 < main_~j~0); 1122#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1121#L12-2 assume !!(main_~i~0 < main_~j~0); 1120#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1119#L12-2 assume !!(main_~i~0 < main_~j~0); 1118#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1117#L12-2 assume !!(main_~i~0 < main_~j~0); 1116#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1115#L12-2 assume !!(main_~i~0 < main_~j~0); 1114#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1113#L12-2 assume !!(main_~i~0 < main_~j~0); 1111#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1110#L12-2 assume !!(main_~i~0 < main_~j~0); 1109#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1108#L12-2 assume !!(main_~i~0 < main_~j~0); 1105#L12 [2021-08-27 14:11:13,572 INFO L793 eck$LassoCheckResult]: Loop: 1105#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 1106#L12-2 assume !!(main_~i~0 < main_~j~0); 1109#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1108#L12-2 assume !!(main_~i~0 < main_~j~0); 1105#L12 [2021-08-27 14:11:13,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:13,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1261127953, now seen corresponding path program 9 times [2021-08-27 14:11:13,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:13,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854699230] [2021-08-27 14:11:13,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:13,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:13,579 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:13,589 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:13,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:13,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 7 times [2021-08-27 14:11:13,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:13,590 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219096075] [2021-08-27 14:11:13,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:13,590 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:13,592 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:13,593 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:13,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:13,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1018732583, now seen corresponding path program 9 times [2021-08-27 14:11:13,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:13,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89650478] [2021-08-27 14:11:13,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:13,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:13,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:13,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89650478] [2021-08-27 14:11:13,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89650478] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:13,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697806447] [2021-08-27 14:11:13,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 14:11:13,680 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:13,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:13,692 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:13,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-08-27 14:11:13,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2021-08-27 14:11:13,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:13,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 14:11:13,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:13,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697806447] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:13,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:13,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2021-08-27 14:11:13,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896681036] [2021-08-27 14:11:13,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:13,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 14:11:13,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-08-27 14:11:13,899 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. cyclomatic complexity: 3 Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:13,923 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2021-08-27 14:11:13,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 14:11:13,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. [2021-08-27 14:11:13,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:13,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 26 states and 28 transitions. [2021-08-27 14:11:13,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:13,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:13,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2021-08-27 14:11:13,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:13,925 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-08-27 14:11:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2021-08-27 14:11:13,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-08-27 14:11:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-08-27 14:11:13,926 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-08-27 14:11:13,926 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-08-27 14:11:13,926 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 14:11:13,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2021-08-27 14:11:13,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:13,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:13,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:13,927 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 1] [2021-08-27 14:11:13,927 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:13,928 INFO L791 eck$LassoCheckResult]: Stem: 1240#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 1236#L12-2 assume !!(main_~i~0 < main_~j~0); 1237#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1238#L12-2 assume !!(main_~i~0 < main_~j~0); 1239#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1243#L12-2 assume !!(main_~i~0 < main_~j~0); 1260#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1259#L12-2 assume !!(main_~i~0 < main_~j~0); 1258#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1257#L12-2 assume !!(main_~i~0 < main_~j~0); 1256#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1255#L12-2 assume !!(main_~i~0 < main_~j~0); 1254#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1253#L12-2 assume !!(main_~i~0 < main_~j~0); 1252#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1251#L12-2 assume !!(main_~i~0 < main_~j~0); 1250#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1249#L12-2 assume !!(main_~i~0 < main_~j~0); 1247#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1246#L12-2 assume !!(main_~i~0 < main_~j~0); 1245#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1244#L12-2 assume !!(main_~i~0 < main_~j~0); 1241#L12 [2021-08-27 14:11:13,928 INFO L793 eck$LassoCheckResult]: Loop: 1241#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 1242#L12-2 assume !!(main_~i~0 < main_~j~0); 1245#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1244#L12-2 assume !!(main_~i~0 < main_~j~0); 1241#L12 [2021-08-27 14:11:13,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:13,928 INFO L82 PathProgramCache]: Analyzing trace with hash -763184948, now seen corresponding path program 10 times [2021-08-27 14:11:13,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:13,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061450771] [2021-08-27 14:11:13,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:13,929 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:13,933 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:13,936 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:13,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:13,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 8 times [2021-08-27 14:11:13,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:13,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787974266] [2021-08-27 14:11:13,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:13,937 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:13,939 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:13,940 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:13,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:13,940 INFO L82 PathProgramCache]: Analyzing trace with hash -307729532, now seen corresponding path program 10 times [2021-08-27 14:11:13,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:13,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962942923] [2021-08-27 14:11:13,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:13,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:14,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:14,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962942923] [2021-08-27 14:11:14,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962942923] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:14,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824873104] [2021-08-27 14:11:14,023 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 14:11:14,023 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:14,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:14,024 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:14,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-08-27 14:11:14,114 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 14:11:14,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:14,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 14:11:14,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:14,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824873104] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:14,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:14,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2021-08-27 14:11:14,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820430234] [2021-08-27 14:11:14,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:14,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 14:11:14,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-08-27 14:11:14,225 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:14,248 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2021-08-27 14:11:14,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 14:11:14,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2021-08-27 14:11:14,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:14,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 30 transitions. [2021-08-27 14:11:14,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:14,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:14,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 30 transitions. [2021-08-27 14:11:14,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:14,250 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2021-08-27 14:11:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 30 transitions. [2021-08-27 14:11:14,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-08-27 14:11:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2021-08-27 14:11:14,255 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-08-27 14:11:14,255 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-08-27 14:11:14,255 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 14:11:14,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2021-08-27 14:11:14,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:14,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:14,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:14,256 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 1] [2021-08-27 14:11:14,256 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:14,256 INFO L791 eck$LassoCheckResult]: Stem: 1387#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 1383#L12-2 assume !!(main_~i~0 < main_~j~0); 1384#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1385#L12-2 assume !!(main_~i~0 < main_~j~0); 1386#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1390#L12-2 assume !!(main_~i~0 < main_~j~0); 1409#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1408#L12-2 assume !!(main_~i~0 < main_~j~0); 1407#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1406#L12-2 assume !!(main_~i~0 < main_~j~0); 1405#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1404#L12-2 assume !!(main_~i~0 < main_~j~0); 1403#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1402#L12-2 assume !!(main_~i~0 < main_~j~0); 1401#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1400#L12-2 assume !!(main_~i~0 < main_~j~0); 1399#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1398#L12-2 assume !!(main_~i~0 < main_~j~0); 1397#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1396#L12-2 assume !!(main_~i~0 < main_~j~0); 1394#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1393#L12-2 assume !!(main_~i~0 < main_~j~0); 1392#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1391#L12-2 assume !!(main_~i~0 < main_~j~0); 1388#L12 [2021-08-27 14:11:14,257 INFO L793 eck$LassoCheckResult]: Loop: 1388#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 1389#L12-2 assume !!(main_~i~0 < main_~j~0); 1392#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1391#L12-2 assume !!(main_~i~0 < main_~j~0); 1388#L12 [2021-08-27 14:11:14,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:14,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1018673001, now seen corresponding path program 11 times [2021-08-27 14:11:14,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:14,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500887802] [2021-08-27 14:11:14,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:14,257 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:14,262 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:14,265 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:14,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 9 times [2021-08-27 14:11:14,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:14,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540999815] [2021-08-27 14:11:14,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:14,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:14,267 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:14,268 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:14,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:14,269 INFO L82 PathProgramCache]: Analyzing trace with hash 567464865, now seen corresponding path program 11 times [2021-08-27 14:11:14,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:14,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568853030] [2021-08-27 14:11:14,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:14,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 36 proven. 132 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:14,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:14,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568853030] [2021-08-27 14:11:14,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568853030] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:14,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227755416] [2021-08-27 14:11:14,366 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 14:11:14,366 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:14,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:14,367 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:14,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-08-27 14:11:14,500 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2021-08-27 14:11:14,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:14,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 14:11:14,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 36 proven. 132 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:14,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227755416] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:14,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:14,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2021-08-27 14:11:14,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652841346] [2021-08-27 14:11:14,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:14,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 14:11:14,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2021-08-27 14:11:14,618 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. cyclomatic complexity: 3 Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:14,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:14,649 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2021-08-27 14:11:14,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 14:11:14,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2021-08-27 14:11:14,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:14,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 32 transitions. [2021-08-27 14:11:14,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:14,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:14,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2021-08-27 14:11:14,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:14,651 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-08-27 14:11:14,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2021-08-27 14:11:14,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2021-08-27 14:11:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2021-08-27 14:11:14,652 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2021-08-27 14:11:14,652 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2021-08-27 14:11:14,652 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-27 14:11:14,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 31 transitions. [2021-08-27 14:11:14,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:14,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:14,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:14,653 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 1] [2021-08-27 14:11:14,653 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:14,653 INFO L791 eck$LassoCheckResult]: Stem: 1545#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 1541#L12-2 assume !!(main_~i~0 < main_~j~0); 1542#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1543#L12-2 assume !!(main_~i~0 < main_~j~0); 1544#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1548#L12-2 assume !!(main_~i~0 < main_~j~0); 1569#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1568#L12-2 assume !!(main_~i~0 < main_~j~0); 1567#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1566#L12-2 assume !!(main_~i~0 < main_~j~0); 1565#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1564#L12-2 assume !!(main_~i~0 < main_~j~0); 1563#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1562#L12-2 assume !!(main_~i~0 < main_~j~0); 1561#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1560#L12-2 assume !!(main_~i~0 < main_~j~0); 1559#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1558#L12-2 assume !!(main_~i~0 < main_~j~0); 1557#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1556#L12-2 assume !!(main_~i~0 < main_~j~0); 1555#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1554#L12-2 assume !!(main_~i~0 < main_~j~0); 1552#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1551#L12-2 assume !!(main_~i~0 < main_~j~0); 1550#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1549#L12-2 assume !!(main_~i~0 < main_~j~0); 1546#L12 [2021-08-27 14:11:14,653 INFO L793 eck$LassoCheckResult]: Loop: 1546#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 1547#L12-2 assume !!(main_~i~0 < main_~j~0); 1550#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1549#L12-2 assume !!(main_~i~0 < main_~j~0); 1546#L12 [2021-08-27 14:11:14,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:14,654 INFO L82 PathProgramCache]: Analyzing trace with hash -307789114, now seen corresponding path program 12 times [2021-08-27 14:11:14,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:14,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597764624] [2021-08-27 14:11:14,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:14,654 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:14,659 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:14,664 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:14,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:14,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 10 times [2021-08-27 14:11:14,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:14,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696998149] [2021-08-27 14:11:14,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:14,665 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:14,667 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:14,668 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:14,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:14,668 INFO L82 PathProgramCache]: Analyzing trace with hash -184309634, now seen corresponding path program 12 times [2021-08-27 14:11:14,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:14,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458791063] [2021-08-27 14:11:14,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:14,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 39 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:14,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:14,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458791063] [2021-08-27 14:11:14,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458791063] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:14,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466459470] [2021-08-27 14:11:14,765 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 14:11:14,765 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:14,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:14,768 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:14,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-08-27 14:11:14,891 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2021-08-27 14:11:14,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:14,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-27 14:11:14,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:14,990 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 39 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:14,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466459470] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:14,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:14,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2021-08-27 14:11:14,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430338624] [2021-08-27 14:11:15,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:15,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 14:11:15,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2021-08-27 14:11:15,026 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. cyclomatic complexity: 3 Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:15,068 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2021-08-27 14:11:15,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 14:11:15,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2021-08-27 14:11:15,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:15,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 34 transitions. [2021-08-27 14:11:15,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:15,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:15,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 34 transitions. [2021-08-27 14:11:15,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:15,069 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2021-08-27 14:11:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 34 transitions. [2021-08-27 14:11:15,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2021-08-27 14:11:15,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.064516129032258) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2021-08-27 14:11:15,070 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2021-08-27 14:11:15,070 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2021-08-27 14:11:15,070 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-08-27 14:11:15,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2021-08-27 14:11:15,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:15,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:15,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:15,075 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [14, 13, 1] [2021-08-27 14:11:15,075 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:15,075 INFO L791 eck$LassoCheckResult]: Stem: 1714#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 1710#L12-2 assume !!(main_~i~0 < main_~j~0); 1711#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1712#L12-2 assume !!(main_~i~0 < main_~j~0); 1713#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1717#L12-2 assume !!(main_~i~0 < main_~j~0); 1740#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1739#L12-2 assume !!(main_~i~0 < main_~j~0); 1738#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1737#L12-2 assume !!(main_~i~0 < main_~j~0); 1736#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1735#L12-2 assume !!(main_~i~0 < main_~j~0); 1734#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1733#L12-2 assume !!(main_~i~0 < main_~j~0); 1732#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1731#L12-2 assume !!(main_~i~0 < main_~j~0); 1730#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1729#L12-2 assume !!(main_~i~0 < main_~j~0); 1728#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1727#L12-2 assume !!(main_~i~0 < main_~j~0); 1726#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1725#L12-2 assume !!(main_~i~0 < main_~j~0); 1724#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1723#L12-2 assume !!(main_~i~0 < main_~j~0); 1721#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1720#L12-2 assume !!(main_~i~0 < main_~j~0); 1719#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1718#L12-2 assume !!(main_~i~0 < main_~j~0); 1715#L12 [2021-08-27 14:11:15,075 INFO L793 eck$LassoCheckResult]: Loop: 1715#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 1716#L12-2 assume !!(main_~i~0 < main_~j~0); 1719#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1718#L12-2 assume !!(main_~i~0 < main_~j~0); 1715#L12 [2021-08-27 14:11:15,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:15,076 INFO L82 PathProgramCache]: Analyzing trace with hash 567405283, now seen corresponding path program 13 times [2021-08-27 14:11:15,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:15,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262781682] [2021-08-27 14:11:15,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:15,076 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:15,080 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:15,086 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:15,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:15,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 11 times [2021-08-27 14:11:15,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:15,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525889360] [2021-08-27 14:11:15,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:15,087 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:15,089 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:15,091 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:15,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:15,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1085097445, now seen corresponding path program 13 times [2021-08-27 14:11:15,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:15,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271589457] [2021-08-27 14:11:15,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:15,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 182 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:15,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:15,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271589457] [2021-08-27 14:11:15,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271589457] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:15,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494459962] [2021-08-27 14:11:15,223 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 14:11:15,223 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:15,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:15,225 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:15,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-08-27 14:11:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:15,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 14:11:15,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 182 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:15,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494459962] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:15,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:15,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2021-08-27 14:11:15,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18210721] [2021-08-27 14:11:15,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:15,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 14:11:15,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2021-08-27 14:11:15,510 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. cyclomatic complexity: 3 Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:15,549 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2021-08-27 14:11:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 14:11:15,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2021-08-27 14:11:15,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:15,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 36 transitions. [2021-08-27 14:11:15,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:15,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:15,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 36 transitions. [2021-08-27 14:11:15,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:15,550 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 36 transitions. [2021-08-27 14:11:15,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 36 transitions. [2021-08-27 14:11:15,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-08-27 14:11:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 32 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2021-08-27 14:11:15,552 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2021-08-27 14:11:15,552 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2021-08-27 14:11:15,552 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-08-27 14:11:15,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 35 transitions. [2021-08-27 14:11:15,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:15,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:15,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:15,553 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [15, 14, 1] [2021-08-27 14:11:15,553 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:15,553 INFO L791 eck$LassoCheckResult]: Stem: 1894#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 1890#L12-2 assume !!(main_~i~0 < main_~j~0); 1891#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1892#L12-2 assume !!(main_~i~0 < main_~j~0); 1893#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1897#L12-2 assume !!(main_~i~0 < main_~j~0); 1922#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1921#L12-2 assume !!(main_~i~0 < main_~j~0); 1920#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1919#L12-2 assume !!(main_~i~0 < main_~j~0); 1918#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1917#L12-2 assume !!(main_~i~0 < main_~j~0); 1916#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1915#L12-2 assume !!(main_~i~0 < main_~j~0); 1914#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1913#L12-2 assume !!(main_~i~0 < main_~j~0); 1912#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1911#L12-2 assume !!(main_~i~0 < main_~j~0); 1910#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1909#L12-2 assume !!(main_~i~0 < main_~j~0); 1908#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1907#L12-2 assume !!(main_~i~0 < main_~j~0); 1906#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1905#L12-2 assume !!(main_~i~0 < main_~j~0); 1904#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1903#L12-2 assume !!(main_~i~0 < main_~j~0); 1901#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1900#L12-2 assume !!(main_~i~0 < main_~j~0); 1899#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1898#L12-2 assume !!(main_~i~0 < main_~j~0); 1895#L12 [2021-08-27 14:11:15,553 INFO L793 eck$LassoCheckResult]: Loop: 1895#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 1896#L12-2 assume !!(main_~i~0 < main_~j~0); 1899#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1898#L12-2 assume !!(main_~i~0 < main_~j~0); 1895#L12 [2021-08-27 14:11:15,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:15,553 INFO L82 PathProgramCache]: Analyzing trace with hash -184369216, now seen corresponding path program 14 times [2021-08-27 14:11:15,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:15,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369061038] [2021-08-27 14:11:15,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:15,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:15,558 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:15,562 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:15,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:15,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 12 times [2021-08-27 14:11:15,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:15,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742811308] [2021-08-27 14:11:15,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:15,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:15,565 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:15,566 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:15,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:15,566 INFO L82 PathProgramCache]: Analyzing trace with hash 841209976, now seen corresponding path program 14 times [2021-08-27 14:11:15,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:15,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728703622] [2021-08-27 14:11:15,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:15,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:15,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:15,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728703622] [2021-08-27 14:11:15,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728703622] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:15,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291647737] [2021-08-27 14:11:15,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:11:15,704 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:15,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:15,705 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:15,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-08-27 14:11:15,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 14:11:15,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:15,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-27 14:11:15,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:15,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291647737] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:15,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:15,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2021-08-27 14:11:15,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943745511] [2021-08-27 14:11:15,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:15,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-27 14:11:15,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2021-08-27 14:11:15,971 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. cyclomatic complexity: 3 Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:16,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:16,010 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2021-08-27 14:11:16,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 14:11:16,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 39 transitions. [2021-08-27 14:11:16,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:16,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 38 transitions. [2021-08-27 14:11:16,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:16,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:16,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2021-08-27 14:11:16,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:16,011 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2021-08-27 14:11:16,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2021-08-27 14:11:16,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2021-08-27 14:11:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:16,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2021-08-27 14:11:16,012 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2021-08-27 14:11:16,012 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2021-08-27 14:11:16,012 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-08-27 14:11:16,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 37 transitions. [2021-08-27 14:11:16,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:16,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:16,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:16,012 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [16, 15, 1] [2021-08-27 14:11:16,012 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:16,013 INFO L791 eck$LassoCheckResult]: Stem: 2085#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 2081#L12-2 assume !!(main_~i~0 < main_~j~0); 2082#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2083#L12-2 assume !!(main_~i~0 < main_~j~0); 2084#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2088#L12-2 assume !!(main_~i~0 < main_~j~0); 2115#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2114#L12-2 assume !!(main_~i~0 < main_~j~0); 2113#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2112#L12-2 assume !!(main_~i~0 < main_~j~0); 2111#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2110#L12-2 assume !!(main_~i~0 < main_~j~0); 2109#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2108#L12-2 assume !!(main_~i~0 < main_~j~0); 2107#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2106#L12-2 assume !!(main_~i~0 < main_~j~0); 2105#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2104#L12-2 assume !!(main_~i~0 < main_~j~0); 2103#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2102#L12-2 assume !!(main_~i~0 < main_~j~0); 2101#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2100#L12-2 assume !!(main_~i~0 < main_~j~0); 2099#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2098#L12-2 assume !!(main_~i~0 < main_~j~0); 2097#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2096#L12-2 assume !!(main_~i~0 < main_~j~0); 2095#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2094#L12-2 assume !!(main_~i~0 < main_~j~0); 2092#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2091#L12-2 assume !!(main_~i~0 < main_~j~0); 2090#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2089#L12-2 assume !!(main_~i~0 < main_~j~0); 2086#L12 [2021-08-27 14:11:16,013 INFO L793 eck$LassoCheckResult]: Loop: 2086#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 2087#L12-2 assume !!(main_~i~0 < main_~j~0); 2090#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2089#L12-2 assume !!(main_~i~0 < main_~j~0); 2086#L12 [2021-08-27 14:11:16,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:16,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1085157027, now seen corresponding path program 15 times [2021-08-27 14:11:16,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:16,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380692444] [2021-08-27 14:11:16,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:16,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:16,018 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:16,021 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:16,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:16,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 13 times [2021-08-27 14:11:16,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:16,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053113086] [2021-08-27 14:11:16,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:16,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:16,023 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:16,024 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:16,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:16,024 INFO L82 PathProgramCache]: Analyzing trace with hash 891736981, now seen corresponding path program 15 times [2021-08-27 14:11:16,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:16,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339390898] [2021-08-27 14:11:16,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:16,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:16,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:16,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339390898] [2021-08-27 14:11:16,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339390898] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:16,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548142241] [2021-08-27 14:11:16,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 14:11:16,149 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:16,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:16,152 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:16,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-08-27 14:11:16,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2021-08-27 14:11:16,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:16,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-27 14:11:16,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:16,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548142241] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:16,405 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:16,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2021-08-27 14:11:16,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268496484] [2021-08-27 14:11:16,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:16,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 14:11:16,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2021-08-27 14:11:16,437 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. cyclomatic complexity: 3 Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:16,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:16,467 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2021-08-27 14:11:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 14:11:16,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 41 transitions. [2021-08-27 14:11:16,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:16,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 38 states and 40 transitions. [2021-08-27 14:11:16,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:16,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:16,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 40 transitions. [2021-08-27 14:11:16,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:16,468 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2021-08-27 14:11:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 40 transitions. [2021-08-27 14:11:16,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2021-08-27 14:11:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.054054054054054) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2021-08-27 14:11:16,469 INFO L704 BuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2021-08-27 14:11:16,470 INFO L587 BuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2021-08-27 14:11:16,470 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-08-27 14:11:16,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 39 transitions. [2021-08-27 14:11:16,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:16,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:16,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:16,470 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [17, 16, 1] [2021-08-27 14:11:16,470 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:16,470 INFO L791 eck$LassoCheckResult]: Stem: 2287#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 2283#L12-2 assume !!(main_~i~0 < main_~j~0); 2284#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2285#L12-2 assume !!(main_~i~0 < main_~j~0); 2286#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2290#L12-2 assume !!(main_~i~0 < main_~j~0); 2319#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2318#L12-2 assume !!(main_~i~0 < main_~j~0); 2317#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2316#L12-2 assume !!(main_~i~0 < main_~j~0); 2315#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2314#L12-2 assume !!(main_~i~0 < main_~j~0); 2313#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2312#L12-2 assume !!(main_~i~0 < main_~j~0); 2311#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2310#L12-2 assume !!(main_~i~0 < main_~j~0); 2309#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2308#L12-2 assume !!(main_~i~0 < main_~j~0); 2307#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2306#L12-2 assume !!(main_~i~0 < main_~j~0); 2305#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2304#L12-2 assume !!(main_~i~0 < main_~j~0); 2303#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2302#L12-2 assume !!(main_~i~0 < main_~j~0); 2301#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2300#L12-2 assume !!(main_~i~0 < main_~j~0); 2299#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2298#L12-2 assume !!(main_~i~0 < main_~j~0); 2297#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2296#L12-2 assume !!(main_~i~0 < main_~j~0); 2294#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2293#L12-2 assume !!(main_~i~0 < main_~j~0); 2292#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2291#L12-2 assume !!(main_~i~0 < main_~j~0); 2288#L12 [2021-08-27 14:11:16,470 INFO L793 eck$LassoCheckResult]: Loop: 2288#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 2289#L12-2 assume !!(main_~i~0 < main_~j~0); 2292#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2291#L12-2 assume !!(main_~i~0 < main_~j~0); 2288#L12 [2021-08-27 14:11:16,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:16,471 INFO L82 PathProgramCache]: Analyzing trace with hash 841150394, now seen corresponding path program 16 times [2021-08-27 14:11:16,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:16,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918946745] [2021-08-27 14:11:16,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:16,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:16,475 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:16,479 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:16,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 14 times [2021-08-27 14:11:16,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:16,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902084887] [2021-08-27 14:11:16,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:16,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:16,481 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:16,482 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:16,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:16,482 INFO L82 PathProgramCache]: Analyzing trace with hash -2091418766, now seen corresponding path program 16 times [2021-08-27 14:11:16,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:16,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953096385] [2021-08-27 14:11:16,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:16,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 51 proven. 272 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:16,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:16,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953096385] [2021-08-27 14:11:16,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953096385] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:16,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549310921] [2021-08-27 14:11:16,645 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 14:11:16,645 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:16,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:16,656 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:16,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-08-27 14:11:16,824 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 14:11:16,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:16,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-27 14:11:16,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 51 proven. 272 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:16,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549310921] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:16,941 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:16,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2021-08-27 14:11:16,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340850470] [2021-08-27 14:11:16,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:16,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 14:11:16,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2021-08-27 14:11:16,978 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. cyclomatic complexity: 3 Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:17,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:17,013 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2021-08-27 14:11:17,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 14:11:17,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2021-08-27 14:11:17,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:17,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 42 transitions. [2021-08-27 14:11:17,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:17,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:17,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 42 transitions. [2021-08-27 14:11:17,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:17,014 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 42 transitions. [2021-08-27 14:11:17,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 42 transitions. [2021-08-27 14:11:17,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2021-08-27 14:11:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2021-08-27 14:11:17,015 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-08-27 14:11:17,015 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-08-27 14:11:17,016 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-08-27 14:11:17,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 41 transitions. [2021-08-27 14:11:17,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:17,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:17,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:17,016 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [18, 17, 1] [2021-08-27 14:11:17,016 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:17,016 INFO L791 eck$LassoCheckResult]: Stem: 2500#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 2496#L12-2 assume !!(main_~i~0 < main_~j~0); 2497#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2498#L12-2 assume !!(main_~i~0 < main_~j~0); 2499#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2503#L12-2 assume !!(main_~i~0 < main_~j~0); 2534#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2533#L12-2 assume !!(main_~i~0 < main_~j~0); 2532#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2531#L12-2 assume !!(main_~i~0 < main_~j~0); 2530#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2529#L12-2 assume !!(main_~i~0 < main_~j~0); 2528#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2527#L12-2 assume !!(main_~i~0 < main_~j~0); 2526#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2525#L12-2 assume !!(main_~i~0 < main_~j~0); 2524#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2523#L12-2 assume !!(main_~i~0 < main_~j~0); 2522#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2521#L12-2 assume !!(main_~i~0 < main_~j~0); 2520#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2519#L12-2 assume !!(main_~i~0 < main_~j~0); 2518#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2517#L12-2 assume !!(main_~i~0 < main_~j~0); 2516#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2515#L12-2 assume !!(main_~i~0 < main_~j~0); 2514#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2513#L12-2 assume !!(main_~i~0 < main_~j~0); 2512#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2511#L12-2 assume !!(main_~i~0 < main_~j~0); 2510#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2509#L12-2 assume !!(main_~i~0 < main_~j~0); 2507#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2506#L12-2 assume !!(main_~i~0 < main_~j~0); 2505#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2504#L12-2 assume !!(main_~i~0 < main_~j~0); 2501#L12 [2021-08-27 14:11:17,017 INFO L793 eck$LassoCheckResult]: Loop: 2501#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 2502#L12-2 assume !!(main_~i~0 < main_~j~0); 2505#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2504#L12-2 assume !!(main_~i~0 < main_~j~0); 2501#L12 [2021-08-27 14:11:17,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:17,018 INFO L82 PathProgramCache]: Analyzing trace with hash 891677399, now seen corresponding path program 17 times [2021-08-27 14:11:17,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:17,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226400960] [2021-08-27 14:11:17,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:17,018 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:17,023 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:17,027 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:17,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:17,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 15 times [2021-08-27 14:11:17,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:17,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457839199] [2021-08-27 14:11:17,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:17,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:17,030 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:17,031 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:17,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:17,031 INFO L82 PathProgramCache]: Analyzing trace with hash 134062095, now seen corresponding path program 17 times [2021-08-27 14:11:17,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:17,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958637237] [2021-08-27 14:11:17,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:17,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:17,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:17,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958637237] [2021-08-27 14:11:17,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958637237] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:17,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375979302] [2021-08-27 14:11:17,184 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 14:11:17,184 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:17,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:17,192 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:17,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-08-27 14:11:17,382 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2021-08-27 14:11:17,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:17,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 14:11:17,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:17,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375979302] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:17,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:17,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2021-08-27 14:11:17,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590879724] [2021-08-27 14:11:17,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:17,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 14:11:17,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2021-08-27 14:11:17,535 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. cyclomatic complexity: 3 Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:17,577 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2021-08-27 14:11:17,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 14:11:17,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 45 transitions. [2021-08-27 14:11:17,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:17,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 44 transitions. [2021-08-27 14:11:17,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:17,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:17,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2021-08-27 14:11:17,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:17,579 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2021-08-27 14:11:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2021-08-27 14:11:17,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2021-08-27 14:11:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.048780487804878) internal successors, (43), 40 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2021-08-27 14:11:17,580 INFO L704 BuchiCegarLoop]: Abstraction has 41 states and 43 transitions. [2021-08-27 14:11:17,580 INFO L587 BuchiCegarLoop]: Abstraction has 41 states and 43 transitions. [2021-08-27 14:11:17,580 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-08-27 14:11:17,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 43 transitions. [2021-08-27 14:11:17,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:17,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:17,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:17,581 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [19, 18, 1] [2021-08-27 14:11:17,581 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:17,581 INFO L791 eck$LassoCheckResult]: Stem: 2724#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 2720#L12-2 assume !!(main_~i~0 < main_~j~0); 2721#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2722#L12-2 assume !!(main_~i~0 < main_~j~0); 2723#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2727#L12-2 assume !!(main_~i~0 < main_~j~0); 2760#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2759#L12-2 assume !!(main_~i~0 < main_~j~0); 2758#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2757#L12-2 assume !!(main_~i~0 < main_~j~0); 2756#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2755#L12-2 assume !!(main_~i~0 < main_~j~0); 2754#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2753#L12-2 assume !!(main_~i~0 < main_~j~0); 2752#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2751#L12-2 assume !!(main_~i~0 < main_~j~0); 2750#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2749#L12-2 assume !!(main_~i~0 < main_~j~0); 2748#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2747#L12-2 assume !!(main_~i~0 < main_~j~0); 2746#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2745#L12-2 assume !!(main_~i~0 < main_~j~0); 2744#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2743#L12-2 assume !!(main_~i~0 < main_~j~0); 2742#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2741#L12-2 assume !!(main_~i~0 < main_~j~0); 2740#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2739#L12-2 assume !!(main_~i~0 < main_~j~0); 2738#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2737#L12-2 assume !!(main_~i~0 < main_~j~0); 2736#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2735#L12-2 assume !!(main_~i~0 < main_~j~0); 2734#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2733#L12-2 assume !!(main_~i~0 < main_~j~0); 2731#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2730#L12-2 assume !!(main_~i~0 < main_~j~0); 2729#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2728#L12-2 assume !!(main_~i~0 < main_~j~0); 2725#L12 [2021-08-27 14:11:17,582 INFO L793 eck$LassoCheckResult]: Loop: 2725#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 2726#L12-2 assume !!(main_~i~0 < main_~j~0); 2729#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2728#L12-2 assume !!(main_~i~0 < main_~j~0); 2725#L12 [2021-08-27 14:11:17,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:17,582 INFO L82 PathProgramCache]: Analyzing trace with hash -2091478348, now seen corresponding path program 18 times [2021-08-27 14:11:17,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:17,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457397432] [2021-08-27 14:11:17,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:17,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:17,588 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:17,593 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:17,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:17,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 16 times [2021-08-27 14:11:17,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:17,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275031714] [2021-08-27 14:11:17,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:17,593 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:17,595 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:17,596 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:17,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:17,597 INFO L82 PathProgramCache]: Analyzing trace with hash -72543892, now seen corresponding path program 18 times [2021-08-27 14:11:17,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:17,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333241292] [2021-08-27 14:11:17,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:17,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 57 proven. 342 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:17,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:17,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333241292] [2021-08-27 14:11:17,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333241292] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:17,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133157426] [2021-08-27 14:11:17,778 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 14:11:17,778 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:17,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:17,779 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:17,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2021-08-27 14:11:17,963 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2021-08-27 14:11:17,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:17,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-27 14:11:17,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:18,096 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 57 proven. 342 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:18,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133157426] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:18,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:18,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2021-08-27 14:11:18,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692120859] [2021-08-27 14:11:18,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:18,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 14:11:18,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2021-08-27 14:11:18,132 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. cyclomatic complexity: 3 Second operand has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:18,171 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2021-08-27 14:11:18,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-27 14:11:18,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 47 transitions. [2021-08-27 14:11:18,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:18,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 44 states and 46 transitions. [2021-08-27 14:11:18,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:18,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:18,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 46 transitions. [2021-08-27 14:11:18,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:18,174 INFO L681 BuchiCegarLoop]: Abstraction has 44 states and 46 transitions. [2021-08-27 14:11:18,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 46 transitions. [2021-08-27 14:11:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2021-08-27 14:11:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 42 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2021-08-27 14:11:18,175 INFO L704 BuchiCegarLoop]: Abstraction has 43 states and 45 transitions. [2021-08-27 14:11:18,175 INFO L587 BuchiCegarLoop]: Abstraction has 43 states and 45 transitions. [2021-08-27 14:11:18,175 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-08-27 14:11:18,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 45 transitions. [2021-08-27 14:11:18,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:18,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:18,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:18,177 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [20, 19, 1] [2021-08-27 14:11:18,177 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:18,177 INFO L791 eck$LassoCheckResult]: Stem: 2959#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 2955#L12-2 assume !!(main_~i~0 < main_~j~0); 2956#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2957#L12-2 assume !!(main_~i~0 < main_~j~0); 2958#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2962#L12-2 assume !!(main_~i~0 < main_~j~0); 2997#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2996#L12-2 assume !!(main_~i~0 < main_~j~0); 2995#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2994#L12-2 assume !!(main_~i~0 < main_~j~0); 2993#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2992#L12-2 assume !!(main_~i~0 < main_~j~0); 2991#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2990#L12-2 assume !!(main_~i~0 < main_~j~0); 2989#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2988#L12-2 assume !!(main_~i~0 < main_~j~0); 2987#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2986#L12-2 assume !!(main_~i~0 < main_~j~0); 2985#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2984#L12-2 assume !!(main_~i~0 < main_~j~0); 2983#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2982#L12-2 assume !!(main_~i~0 < main_~j~0); 2981#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2980#L12-2 assume !!(main_~i~0 < main_~j~0); 2979#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2978#L12-2 assume !!(main_~i~0 < main_~j~0); 2977#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2976#L12-2 assume !!(main_~i~0 < main_~j~0); 2975#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2974#L12-2 assume !!(main_~i~0 < main_~j~0); 2973#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2972#L12-2 assume !!(main_~i~0 < main_~j~0); 2971#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2970#L12-2 assume !!(main_~i~0 < main_~j~0); 2969#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2968#L12-2 assume !!(main_~i~0 < main_~j~0); 2966#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2965#L12-2 assume !!(main_~i~0 < main_~j~0); 2964#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2963#L12-2 assume !!(main_~i~0 < main_~j~0); 2960#L12 [2021-08-27 14:11:18,177 INFO L793 eck$LassoCheckResult]: Loop: 2960#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 2961#L12-2 assume !!(main_~i~0 < main_~j~0); 2964#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2963#L12-2 assume !!(main_~i~0 < main_~j~0); 2960#L12 [2021-08-27 14:11:18,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:18,177 INFO L82 PathProgramCache]: Analyzing trace with hash 134002513, now seen corresponding path program 19 times [2021-08-27 14:11:18,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:18,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459671982] [2021-08-27 14:11:18,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:18,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:18,186 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:18,191 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:18,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:18,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 17 times [2021-08-27 14:11:18,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:18,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313657659] [2021-08-27 14:11:18,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:18,192 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:18,195 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:18,196 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:18,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:18,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1052401783, now seen corresponding path program 19 times [2021-08-27 14:11:18,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:18,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080175974] [2021-08-27 14:11:18,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:18,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 60 proven. 380 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:18,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:18,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080175974] [2021-08-27 14:11:18,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080175974] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:18,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198700242] [2021-08-27 14:11:18,378 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 14:11:18,379 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:18,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:18,380 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:18,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2021-08-27 14:11:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:18,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-27 14:11:18,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 60 proven. 380 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:18,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198700242] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:18,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:18,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2021-08-27 14:11:18,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825923132] [2021-08-27 14:11:18,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:18,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 14:11:18,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2021-08-27 14:11:18,725 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. cyclomatic complexity: 3 Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:18,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:18,776 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2021-08-27 14:11:18,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 14:11:18,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 49 transitions. [2021-08-27 14:11:18,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:18,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 46 states and 48 transitions. [2021-08-27 14:11:18,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:18,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:18,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 48 transitions. [2021-08-27 14:11:18,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:18,777 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 48 transitions. [2021-08-27 14:11:18,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 48 transitions. [2021-08-27 14:11:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2021-08-27 14:11:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:18,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2021-08-27 14:11:18,778 INFO L704 BuchiCegarLoop]: Abstraction has 45 states and 47 transitions. [2021-08-27 14:11:18,779 INFO L587 BuchiCegarLoop]: Abstraction has 45 states and 47 transitions. [2021-08-27 14:11:18,779 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-08-27 14:11:18,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 47 transitions. [2021-08-27 14:11:18,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:18,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:18,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:18,779 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [21, 20, 1] [2021-08-27 14:11:18,779 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:18,779 INFO L791 eck$LassoCheckResult]: Stem: 3205#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 3201#L12-2 assume !!(main_~i~0 < main_~j~0); 3202#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3203#L12-2 assume !!(main_~i~0 < main_~j~0); 3204#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3208#L12-2 assume !!(main_~i~0 < main_~j~0); 3245#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3244#L12-2 assume !!(main_~i~0 < main_~j~0); 3243#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3242#L12-2 assume !!(main_~i~0 < main_~j~0); 3241#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3240#L12-2 assume !!(main_~i~0 < main_~j~0); 3239#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3238#L12-2 assume !!(main_~i~0 < main_~j~0); 3237#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3236#L12-2 assume !!(main_~i~0 < main_~j~0); 3235#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3234#L12-2 assume !!(main_~i~0 < main_~j~0); 3233#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3232#L12-2 assume !!(main_~i~0 < main_~j~0); 3231#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3230#L12-2 assume !!(main_~i~0 < main_~j~0); 3229#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3228#L12-2 assume !!(main_~i~0 < main_~j~0); 3227#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3226#L12-2 assume !!(main_~i~0 < main_~j~0); 3225#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3224#L12-2 assume !!(main_~i~0 < main_~j~0); 3223#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3222#L12-2 assume !!(main_~i~0 < main_~j~0); 3221#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3220#L12-2 assume !!(main_~i~0 < main_~j~0); 3219#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3218#L12-2 assume !!(main_~i~0 < main_~j~0); 3217#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3216#L12-2 assume !!(main_~i~0 < main_~j~0); 3215#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3214#L12-2 assume !!(main_~i~0 < main_~j~0); 3212#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3211#L12-2 assume !!(main_~i~0 < main_~j~0); 3210#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3209#L12-2 assume !!(main_~i~0 < main_~j~0); 3206#L12 [2021-08-27 14:11:18,779 INFO L793 eck$LassoCheckResult]: Loop: 3206#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 3207#L12-2 assume !!(main_~i~0 < main_~j~0); 3210#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3209#L12-2 assume !!(main_~i~0 < main_~j~0); 3206#L12 [2021-08-27 14:11:18,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:18,780 INFO L82 PathProgramCache]: Analyzing trace with hash -72603474, now seen corresponding path program 20 times [2021-08-27 14:11:18,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:18,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207238590] [2021-08-27 14:11:18,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:18,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:18,786 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:18,790 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:18,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:18,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 18 times [2021-08-27 14:11:18,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:18,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494783960] [2021-08-27 14:11:18,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:18,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:18,793 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:18,794 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:18,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:18,794 INFO L82 PathProgramCache]: Analyzing trace with hash -2097997210, now seen corresponding path program 20 times [2021-08-27 14:11:18,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:18,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828738488] [2021-08-27 14:11:18,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:18,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 63 proven. 420 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:19,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:19,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828738488] [2021-08-27 14:11:19,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828738488] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:19,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744352071] [2021-08-27 14:11:19,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:11:19,001 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:19,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:19,016 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:19,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2021-08-27 14:11:19,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 14:11:19,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:19,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 14:11:19,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 63 proven. 420 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:19,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744352071] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:19,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:19,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2021-08-27 14:11:19,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336940049] [2021-08-27 14:11:19,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:19,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-27 14:11:19,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2021-08-27 14:11:19,418 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. cyclomatic complexity: 3 Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:19,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:19,465 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2021-08-27 14:11:19,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 14:11:19,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 51 transitions. [2021-08-27 14:11:19,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:19,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 48 states and 50 transitions. [2021-08-27 14:11:19,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:19,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:19,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 50 transitions. [2021-08-27 14:11:19,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:19,467 INFO L681 BuchiCegarLoop]: Abstraction has 48 states and 50 transitions. [2021-08-27 14:11:19,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 50 transitions. [2021-08-27 14:11:19,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2021-08-27 14:11:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2021-08-27 14:11:19,468 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 49 transitions. [2021-08-27 14:11:19,468 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 49 transitions. [2021-08-27 14:11:19,468 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-08-27 14:11:19,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 49 transitions. [2021-08-27 14:11:19,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:19,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:19,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:19,469 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 21, 1] [2021-08-27 14:11:19,469 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:19,469 INFO L791 eck$LassoCheckResult]: Stem: 3462#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 3458#L12-2 assume !!(main_~i~0 < main_~j~0); 3459#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3460#L12-2 assume !!(main_~i~0 < main_~j~0); 3461#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3465#L12-2 assume !!(main_~i~0 < main_~j~0); 3504#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3503#L12-2 assume !!(main_~i~0 < main_~j~0); 3502#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3501#L12-2 assume !!(main_~i~0 < main_~j~0); 3500#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3499#L12-2 assume !!(main_~i~0 < main_~j~0); 3498#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3497#L12-2 assume !!(main_~i~0 < main_~j~0); 3496#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3495#L12-2 assume !!(main_~i~0 < main_~j~0); 3494#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3493#L12-2 assume !!(main_~i~0 < main_~j~0); 3492#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3491#L12-2 assume !!(main_~i~0 < main_~j~0); 3490#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3489#L12-2 assume !!(main_~i~0 < main_~j~0); 3488#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3487#L12-2 assume !!(main_~i~0 < main_~j~0); 3486#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3485#L12-2 assume !!(main_~i~0 < main_~j~0); 3484#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3483#L12-2 assume !!(main_~i~0 < main_~j~0); 3482#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3481#L12-2 assume !!(main_~i~0 < main_~j~0); 3480#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3479#L12-2 assume !!(main_~i~0 < main_~j~0); 3478#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3477#L12-2 assume !!(main_~i~0 < main_~j~0); 3476#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3475#L12-2 assume !!(main_~i~0 < main_~j~0); 3474#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3473#L12-2 assume !!(main_~i~0 < main_~j~0); 3472#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3471#L12-2 assume !!(main_~i~0 < main_~j~0); 3469#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3468#L12-2 assume !!(main_~i~0 < main_~j~0); 3467#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3466#L12-2 assume !!(main_~i~0 < main_~j~0); 3463#L12 [2021-08-27 14:11:19,469 INFO L793 eck$LassoCheckResult]: Loop: 3463#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 3464#L12-2 assume !!(main_~i~0 < main_~j~0); 3467#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3466#L12-2 assume !!(main_~i~0 < main_~j~0); 3463#L12 [2021-08-27 14:11:19,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:19,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1052461365, now seen corresponding path program 21 times [2021-08-27 14:11:19,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:19,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708849839] [2021-08-27 14:11:19,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:19,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:19,476 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:19,481 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:19,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:19,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 19 times [2021-08-27 14:11:19,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:19,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42766006] [2021-08-27 14:11:19,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:19,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:19,484 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:19,485 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:19,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:19,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1892855293, now seen corresponding path program 21 times [2021-08-27 14:11:19,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:19,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683708750] [2021-08-27 14:11:19,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:19,485 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 66 proven. 462 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:19,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:19,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683708750] [2021-08-27 14:11:19,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683708750] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:19,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579912409] [2021-08-27 14:11:19,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 14:11:19,710 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:19,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:19,711 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:19,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2021-08-27 14:11:19,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2021-08-27 14:11:19,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:19,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-27 14:11:19,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:20,086 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 66 proven. 462 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:20,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579912409] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:20,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:20,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2021-08-27 14:11:20,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900731396] [2021-08-27 14:11:20,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:20,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-27 14:11:20,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2021-08-27 14:11:20,118 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. cyclomatic complexity: 3 Second operand has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:20,163 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2021-08-27 14:11:20,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-27 14:11:20,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 53 transitions. [2021-08-27 14:11:20,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:20,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 50 states and 52 transitions. [2021-08-27 14:11:20,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:20,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:20,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 52 transitions. [2021-08-27 14:11:20,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:20,165 INFO L681 BuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2021-08-27 14:11:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 52 transitions. [2021-08-27 14:11:20,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2021-08-27 14:11:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2021-08-27 14:11:20,166 INFO L704 BuchiCegarLoop]: Abstraction has 49 states and 51 transitions. [2021-08-27 14:11:20,166 INFO L587 BuchiCegarLoop]: Abstraction has 49 states and 51 transitions. [2021-08-27 14:11:20,166 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-08-27 14:11:20,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 51 transitions. [2021-08-27 14:11:20,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:20,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:20,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:20,167 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [23, 22, 1] [2021-08-27 14:11:20,167 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:20,167 INFO L791 eck$LassoCheckResult]: Stem: 3730#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 3726#L12-2 assume !!(main_~i~0 < main_~j~0); 3727#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3728#L12-2 assume !!(main_~i~0 < main_~j~0); 3729#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3733#L12-2 assume !!(main_~i~0 < main_~j~0); 3774#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3773#L12-2 assume !!(main_~i~0 < main_~j~0); 3772#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3771#L12-2 assume !!(main_~i~0 < main_~j~0); 3770#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3769#L12-2 assume !!(main_~i~0 < main_~j~0); 3768#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3767#L12-2 assume !!(main_~i~0 < main_~j~0); 3766#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3765#L12-2 assume !!(main_~i~0 < main_~j~0); 3764#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3763#L12-2 assume !!(main_~i~0 < main_~j~0); 3762#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3761#L12-2 assume !!(main_~i~0 < main_~j~0); 3760#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3759#L12-2 assume !!(main_~i~0 < main_~j~0); 3758#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3757#L12-2 assume !!(main_~i~0 < main_~j~0); 3756#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3755#L12-2 assume !!(main_~i~0 < main_~j~0); 3754#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3753#L12-2 assume !!(main_~i~0 < main_~j~0); 3752#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3751#L12-2 assume !!(main_~i~0 < main_~j~0); 3750#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3749#L12-2 assume !!(main_~i~0 < main_~j~0); 3748#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3747#L12-2 assume !!(main_~i~0 < main_~j~0); 3746#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3745#L12-2 assume !!(main_~i~0 < main_~j~0); 3744#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3743#L12-2 assume !!(main_~i~0 < main_~j~0); 3742#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3741#L12-2 assume !!(main_~i~0 < main_~j~0); 3740#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3739#L12-2 assume !!(main_~i~0 < main_~j~0); 3737#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3736#L12-2 assume !!(main_~i~0 < main_~j~0); 3735#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3734#L12-2 assume !!(main_~i~0 < main_~j~0); 3731#L12 [2021-08-27 14:11:20,168 INFO L793 eck$LassoCheckResult]: Loop: 3731#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 3732#L12-2 assume !!(main_~i~0 < main_~j~0); 3735#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3734#L12-2 assume !!(main_~i~0 < main_~j~0); 3731#L12 [2021-08-27 14:11:20,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:20,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2098056792, now seen corresponding path program 22 times [2021-08-27 14:11:20,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:20,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976202275] [2021-08-27 14:11:20,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:20,168 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:20,174 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:20,180 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:20,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:20,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 20 times [2021-08-27 14:11:20,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:20,181 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473806613] [2021-08-27 14:11:20,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:20,181 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:20,183 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:20,184 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:20,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:20,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1974998624, now seen corresponding path program 22 times [2021-08-27 14:11:20,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:20,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736748012] [2021-08-27 14:11:20,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:20,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:20,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:20,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736748012] [2021-08-27 14:11:20,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736748012] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:20,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291919838] [2021-08-27 14:11:20,422 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 14:11:20,422 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:20,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:20,428 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:20,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2021-08-27 14:11:20,677 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 14:11:20,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:20,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-27 14:11:20,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:20,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291919838] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:20,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:20,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2021-08-27 14:11:20,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299533443] [2021-08-27 14:11:20,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:20,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 14:11:20,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2021-08-27 14:11:20,865 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. cyclomatic complexity: 3 Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:20,917 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2021-08-27 14:11:20,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-27 14:11:20,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 55 transitions. [2021-08-27 14:11:20,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:20,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 52 states and 54 transitions. [2021-08-27 14:11:20,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:20,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:20,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 54 transitions. [2021-08-27 14:11:20,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:20,918 INFO L681 BuchiCegarLoop]: Abstraction has 52 states and 54 transitions. [2021-08-27 14:11:20,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 54 transitions. [2021-08-27 14:11:20,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2021-08-27 14:11:20,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2021-08-27 14:11:20,919 INFO L704 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2021-08-27 14:11:20,919 INFO L587 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2021-08-27 14:11:20,919 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-08-27 14:11:20,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 53 transitions. [2021-08-27 14:11:20,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:20,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:20,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:20,920 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [24, 23, 1] [2021-08-27 14:11:20,920 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:20,920 INFO L791 eck$LassoCheckResult]: Stem: 4009#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 4005#L12-2 assume !!(main_~i~0 < main_~j~0); 4006#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4007#L12-2 assume !!(main_~i~0 < main_~j~0); 4008#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4012#L12-2 assume !!(main_~i~0 < main_~j~0); 4055#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4054#L12-2 assume !!(main_~i~0 < main_~j~0); 4053#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4052#L12-2 assume !!(main_~i~0 < main_~j~0); 4051#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4050#L12-2 assume !!(main_~i~0 < main_~j~0); 4049#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4048#L12-2 assume !!(main_~i~0 < main_~j~0); 4047#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4046#L12-2 assume !!(main_~i~0 < main_~j~0); 4045#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4044#L12-2 assume !!(main_~i~0 < main_~j~0); 4043#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4042#L12-2 assume !!(main_~i~0 < main_~j~0); 4041#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4040#L12-2 assume !!(main_~i~0 < main_~j~0); 4039#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4038#L12-2 assume !!(main_~i~0 < main_~j~0); 4037#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4036#L12-2 assume !!(main_~i~0 < main_~j~0); 4035#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4034#L12-2 assume !!(main_~i~0 < main_~j~0); 4033#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4032#L12-2 assume !!(main_~i~0 < main_~j~0); 4031#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4030#L12-2 assume !!(main_~i~0 < main_~j~0); 4029#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4028#L12-2 assume !!(main_~i~0 < main_~j~0); 4027#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4026#L12-2 assume !!(main_~i~0 < main_~j~0); 4025#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4024#L12-2 assume !!(main_~i~0 < main_~j~0); 4023#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4022#L12-2 assume !!(main_~i~0 < main_~j~0); 4021#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4020#L12-2 assume !!(main_~i~0 < main_~j~0); 4019#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4018#L12-2 assume !!(main_~i~0 < main_~j~0); 4016#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4015#L12-2 assume !!(main_~i~0 < main_~j~0); 4014#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4013#L12-2 assume !!(main_~i~0 < main_~j~0); 4010#L12 [2021-08-27 14:11:20,920 INFO L793 eck$LassoCheckResult]: Loop: 4010#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 4011#L12-2 assume !!(main_~i~0 < main_~j~0); 4014#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4013#L12-2 assume !!(main_~i~0 < main_~j~0); 4010#L12 [2021-08-27 14:11:20,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:20,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1892914875, now seen corresponding path program 23 times [2021-08-27 14:11:20,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:20,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041319520] [2021-08-27 14:11:20,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:20,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:20,926 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:20,932 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:20,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:20,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 21 times [2021-08-27 14:11:20,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:20,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722330473] [2021-08-27 14:11:20,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:20,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:20,935 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:20,935 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:20,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:20,936 INFO L82 PathProgramCache]: Analyzing trace with hash -459065475, now seen corresponding path program 23 times [2021-08-27 14:11:20,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:20,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454901982] [2021-08-27 14:11:20,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:20,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 72 proven. 552 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:21,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:21,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454901982] [2021-08-27 14:11:21,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454901982] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:21,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267991872] [2021-08-27 14:11:21,179 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 14:11:21,179 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:21,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:21,180 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:21,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2021-08-27 14:11:21,480 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2021-08-27 14:11:21,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:21,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core [2021-08-27 14:11:21,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 72 proven. 552 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:21,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267991872] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:21,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:21,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2021-08-27 14:11:21,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62519142] [2021-08-27 14:11:21,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:21,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-27 14:11:21,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2021-08-27 14:11:21,660 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. cyclomatic complexity: 3 Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:21,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:21,708 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2021-08-27 14:11:21,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-27 14:11:21,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 57 transitions. [2021-08-27 14:11:21,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:21,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 54 states and 56 transitions. [2021-08-27 14:11:21,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:21,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:21,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 56 transitions. [2021-08-27 14:11:21,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:21,710 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 56 transitions. [2021-08-27 14:11:21,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 56 transitions. [2021-08-27 14:11:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2021-08-27 14:11:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2021-08-27 14:11:21,711 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 55 transitions. [2021-08-27 14:11:21,711 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 55 transitions. [2021-08-27 14:11:21,711 INFO L425 BuchiCegarLoop]: ======== Iteration 26============ [2021-08-27 14:11:21,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 55 transitions. [2021-08-27 14:11:21,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:21,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:21,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:21,712 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [25, 24, 1] [2021-08-27 14:11:21,712 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:21,712 INFO L791 eck$LassoCheckResult]: Stem: 4299#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 4295#L12-2 assume !!(main_~i~0 < main_~j~0); 4296#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4297#L12-2 assume !!(main_~i~0 < main_~j~0); 4298#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4302#L12-2 assume !!(main_~i~0 < main_~j~0); 4347#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4346#L12-2 assume !!(main_~i~0 < main_~j~0); 4345#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4344#L12-2 assume !!(main_~i~0 < main_~j~0); 4343#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4342#L12-2 assume !!(main_~i~0 < main_~j~0); 4341#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4340#L12-2 assume !!(main_~i~0 < main_~j~0); 4339#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4338#L12-2 assume !!(main_~i~0 < main_~j~0); 4337#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4336#L12-2 assume !!(main_~i~0 < main_~j~0); 4335#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4334#L12-2 assume !!(main_~i~0 < main_~j~0); 4333#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4332#L12-2 assume !!(main_~i~0 < main_~j~0); 4331#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4330#L12-2 assume !!(main_~i~0 < main_~j~0); 4329#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4328#L12-2 assume !!(main_~i~0 < main_~j~0); 4327#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4326#L12-2 assume !!(main_~i~0 < main_~j~0); 4325#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4324#L12-2 assume !!(main_~i~0 < main_~j~0); 4323#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4322#L12-2 assume !!(main_~i~0 < main_~j~0); 4321#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4320#L12-2 assume !!(main_~i~0 < main_~j~0); 4319#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4318#L12-2 assume !!(main_~i~0 < main_~j~0); 4317#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4316#L12-2 assume !!(main_~i~0 < main_~j~0); 4315#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4314#L12-2 assume !!(main_~i~0 < main_~j~0); 4313#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4312#L12-2 assume !!(main_~i~0 < main_~j~0); 4311#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4310#L12-2 assume !!(main_~i~0 < main_~j~0); 4309#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4308#L12-2 assume !!(main_~i~0 < main_~j~0); 4306#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4305#L12-2 assume !!(main_~i~0 < main_~j~0); 4304#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4303#L12-2 assume !!(main_~i~0 < main_~j~0); 4300#L12 [2021-08-27 14:11:21,712 INFO L793 eck$LassoCheckResult]: Loop: 4300#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 4301#L12-2 assume !!(main_~i~0 < main_~j~0); 4304#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4303#L12-2 assume !!(main_~i~0 < main_~j~0); 4300#L12 [2021-08-27 14:11:21,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:21,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1974939042, now seen corresponding path program 24 times [2021-08-27 14:11:21,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:21,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516281661] [2021-08-27 14:11:21,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:21,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:21,719 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:21,725 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:21,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:21,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 22 times [2021-08-27 14:11:21,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:21,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387619310] [2021-08-27 14:11:21,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:21,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:21,728 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:21,729 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:21,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:21,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1162511706, now seen corresponding path program 24 times [2021-08-27 14:11:21,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:21,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367426305] [2021-08-27 14:11:21,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:21,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:22,024 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 75 proven. 600 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:22,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:22,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367426305] [2021-08-27 14:11:22,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367426305] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:22,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995841526] [2021-08-27 14:11:22,025 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 14:11:22,025 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:22,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:22,029 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:22,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2021-08-27 14:11:22,333 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2021-08-27 14:11:22,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:22,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 26 conjunts are in the unsatisfiable core [2021-08-27 14:11:22,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 75 proven. 600 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:22,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995841526] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:22,465 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:22,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2021-08-27 14:11:22,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571396399] [2021-08-27 14:11:22,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:22,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-27 14:11:22,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2021-08-27 14:11:22,508 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. cyclomatic complexity: 3 Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:22,554 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2021-08-27 14:11:22,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-27 14:11:22,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 59 transitions. [2021-08-27 14:11:22,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:22,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 58 transitions. [2021-08-27 14:11:22,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:22,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:22,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 58 transitions. [2021-08-27 14:11:22,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:22,555 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 58 transitions. [2021-08-27 14:11:22,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 58 transitions. [2021-08-27 14:11:22,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2021-08-27 14:11:22,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2021-08-27 14:11:22,556 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-08-27 14:11:22,557 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-08-27 14:11:22,557 INFO L425 BuchiCegarLoop]: ======== Iteration 27============ [2021-08-27 14:11:22,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 57 transitions. [2021-08-27 14:11:22,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:22,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:22,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:22,558 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [26, 25, 1] [2021-08-27 14:11:22,558 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:22,558 INFO L791 eck$LassoCheckResult]: Stem: 4600#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 4596#L12-2 assume !!(main_~i~0 < main_~j~0); 4597#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4598#L12-2 assume !!(main_~i~0 < main_~j~0); 4599#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4603#L12-2 assume !!(main_~i~0 < main_~j~0); 4650#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4649#L12-2 assume !!(main_~i~0 < main_~j~0); 4648#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4647#L12-2 assume !!(main_~i~0 < main_~j~0); 4646#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4645#L12-2 assume !!(main_~i~0 < main_~j~0); 4644#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4643#L12-2 assume !!(main_~i~0 < main_~j~0); 4642#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4641#L12-2 assume !!(main_~i~0 < main_~j~0); 4640#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4639#L12-2 assume !!(main_~i~0 < main_~j~0); 4638#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4637#L12-2 assume !!(main_~i~0 < main_~j~0); 4636#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4635#L12-2 assume !!(main_~i~0 < main_~j~0); 4634#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4633#L12-2 assume !!(main_~i~0 < main_~j~0); 4632#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4631#L12-2 assume !!(main_~i~0 < main_~j~0); 4630#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4629#L12-2 assume !!(main_~i~0 < main_~j~0); 4628#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4627#L12-2 assume !!(main_~i~0 < main_~j~0); 4626#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4625#L12-2 assume !!(main_~i~0 < main_~j~0); 4624#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4623#L12-2 assume !!(main_~i~0 < main_~j~0); 4622#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4621#L12-2 assume !!(main_~i~0 < main_~j~0); 4620#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4619#L12-2 assume !!(main_~i~0 < main_~j~0); 4618#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4617#L12-2 assume !!(main_~i~0 < main_~j~0); 4616#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4615#L12-2 assume !!(main_~i~0 < main_~j~0); 4614#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4613#L12-2 assume !!(main_~i~0 < main_~j~0); 4612#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4611#L12-2 assume !!(main_~i~0 < main_~j~0); 4610#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4609#L12-2 assume !!(main_~i~0 < main_~j~0); 4607#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4606#L12-2 assume !!(main_~i~0 < main_~j~0); 4605#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4604#L12-2 assume !!(main_~i~0 < main_~j~0); 4601#L12 [2021-08-27 14:11:22,558 INFO L793 eck$LassoCheckResult]: Loop: 4601#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 4602#L12-2 assume !!(main_~i~0 < main_~j~0); 4605#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4604#L12-2 assume !!(main_~i~0 < main_~j~0); 4601#L12 [2021-08-27 14:11:22,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:22,558 INFO L82 PathProgramCache]: Analyzing trace with hash -459125057, now seen corresponding path program 25 times [2021-08-27 14:11:22,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:22,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906903530] [2021-08-27 14:11:22,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:22,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:22,565 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:22,571 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:22,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:22,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 23 times [2021-08-27 14:11:22,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:22,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006754741] [2021-08-27 14:11:22,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:22,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:22,574 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:22,575 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:22,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:22,575 INFO L82 PathProgramCache]: Analyzing trace with hash 425054199, now seen corresponding path program 25 times [2021-08-27 14:11:22,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:22,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614761219] [2021-08-27 14:11:22,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:22,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:22,872 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 78 proven. 650 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:22,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:22,872 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614761219] [2021-08-27 14:11:22,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614761219] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:22,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831460615] [2021-08-27 14:11:22,873 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 14:11:22,873 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:22,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:22,874 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:22,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2021-08-27 14:11:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:23,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-27 14:11:23,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 78 proven. 650 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:23,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831460615] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:23,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:23,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2021-08-27 14:11:23,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409090989] [2021-08-27 14:11:23,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:23,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-27 14:11:23,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2021-08-27 14:11:23,353 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. cyclomatic complexity: 3 Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:23,418 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2021-08-27 14:11:23,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-08-27 14:11:23,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 61 transitions. [2021-08-27 14:11:23,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:23,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 58 states and 60 transitions. [2021-08-27 14:11:23,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:23,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:23,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 60 transitions. [2021-08-27 14:11:23,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:23,419 INFO L681 BuchiCegarLoop]: Abstraction has 58 states and 60 transitions. [2021-08-27 14:11:23,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 60 transitions. [2021-08-27 14:11:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2021-08-27 14:11:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 56 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:23,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2021-08-27 14:11:23,420 INFO L704 BuchiCegarLoop]: Abstraction has 57 states and 59 transitions. [2021-08-27 14:11:23,420 INFO L587 BuchiCegarLoop]: Abstraction has 57 states and 59 transitions. [2021-08-27 14:11:23,421 INFO L425 BuchiCegarLoop]: ======== Iteration 28============ [2021-08-27 14:11:23,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 59 transitions. [2021-08-27 14:11:23,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:23,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:23,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:23,421 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [27, 26, 1] [2021-08-27 14:11:23,422 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:23,422 INFO L791 eck$LassoCheckResult]: Stem: 4912#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 4908#L12-2 assume !!(main_~i~0 < main_~j~0); 4909#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4910#L12-2 assume !!(main_~i~0 < main_~j~0); 4911#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4915#L12-2 assume !!(main_~i~0 < main_~j~0); 4964#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4963#L12-2 assume !!(main_~i~0 < main_~j~0); 4962#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4961#L12-2 assume !!(main_~i~0 < main_~j~0); 4960#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4959#L12-2 assume !!(main_~i~0 < main_~j~0); 4958#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4957#L12-2 assume !!(main_~i~0 < main_~j~0); 4956#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4955#L12-2 assume !!(main_~i~0 < main_~j~0); 4954#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4953#L12-2 assume !!(main_~i~0 < main_~j~0); 4952#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4951#L12-2 assume !!(main_~i~0 < main_~j~0); 4950#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4949#L12-2 assume !!(main_~i~0 < main_~j~0); 4948#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4947#L12-2 assume !!(main_~i~0 < main_~j~0); 4946#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4945#L12-2 assume !!(main_~i~0 < main_~j~0); 4944#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4943#L12-2 assume !!(main_~i~0 < main_~j~0); 4942#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4941#L12-2 assume !!(main_~i~0 < main_~j~0); 4940#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4939#L12-2 assume !!(main_~i~0 < main_~j~0); 4938#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4937#L12-2 assume !!(main_~i~0 < main_~j~0); 4936#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4935#L12-2 assume !!(main_~i~0 < main_~j~0); 4934#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4933#L12-2 assume !!(main_~i~0 < main_~j~0); 4932#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4931#L12-2 assume !!(main_~i~0 < main_~j~0); 4930#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4929#L12-2 assume !!(main_~i~0 < main_~j~0); 4928#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4927#L12-2 assume !!(main_~i~0 < main_~j~0); 4926#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4925#L12-2 assume !!(main_~i~0 < main_~j~0); 4924#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4923#L12-2 assume !!(main_~i~0 < main_~j~0); 4922#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4921#L12-2 assume !!(main_~i~0 < main_~j~0); 4919#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4918#L12-2 assume !!(main_~i~0 < main_~j~0); 4917#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4916#L12-2 assume !!(main_~i~0 < main_~j~0); 4913#L12 [2021-08-27 14:11:23,422 INFO L793 eck$LassoCheckResult]: Loop: 4913#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 4914#L12-2 assume !!(main_~i~0 < main_~j~0); 4917#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4916#L12-2 assume !!(main_~i~0 < main_~j~0); 4913#L12 [2021-08-27 14:11:23,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:23,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1162452124, now seen corresponding path program 26 times [2021-08-27 14:11:23,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:23,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449700612] [2021-08-27 14:11:23,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:23,423 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:23,429 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:23,435 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:23,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:23,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 24 times [2021-08-27 14:11:23,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:23,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455773497] [2021-08-27 14:11:23,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:23,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:23,439 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:23,439 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:23,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:23,440 INFO L82 PathProgramCache]: Analyzing trace with hash 397993812, now seen corresponding path program 26 times [2021-08-27 14:11:23,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:23,440 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987591356] [2021-08-27 14:11:23,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:23,440 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 81 proven. 702 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:23,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:23,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987591356] [2021-08-27 14:11:23,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987591356] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:23,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617798502] [2021-08-27 14:11:23,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:11:23,760 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:23,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:23,761 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:23,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2021-08-27 14:11:24,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 14:11:24,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:24,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 28 conjunts are in the unsatisfiable core [2021-08-27 14:11:24,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 81 proven. 702 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:24,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617798502] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:24,286 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:24,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2021-08-27 14:11:24,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705728271] [2021-08-27 14:11:24,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:24,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-08-27 14:11:24,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2021-08-27 14:11:24,334 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. cyclomatic complexity: 3 Second operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:24,403 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2021-08-27 14:11:24,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-27 14:11:24,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 63 transitions. [2021-08-27 14:11:24,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:24,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 60 states and 62 transitions. [2021-08-27 14:11:24,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:24,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:24,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 62 transitions. [2021-08-27 14:11:24,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:24,404 INFO L681 BuchiCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-08-27 14:11:24,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 62 transitions. [2021-08-27 14:11:24,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2021-08-27 14:11:24,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 58 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:24,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2021-08-27 14:11:24,405 INFO L704 BuchiCegarLoop]: Abstraction has 59 states and 61 transitions. [2021-08-27 14:11:24,405 INFO L587 BuchiCegarLoop]: Abstraction has 59 states and 61 transitions. [2021-08-27 14:11:24,405 INFO L425 BuchiCegarLoop]: ======== Iteration 29============ [2021-08-27 14:11:24,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 61 transitions. [2021-08-27 14:11:24,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:24,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:24,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:24,406 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [28, 27, 1] [2021-08-27 14:11:24,406 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:24,406 INFO L791 eck$LassoCheckResult]: Stem: 5235#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 5231#L12-2 assume !!(main_~i~0 < main_~j~0); 5232#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5233#L12-2 assume !!(main_~i~0 < main_~j~0); 5234#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5238#L12-2 assume !!(main_~i~0 < main_~j~0); 5289#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5288#L12-2 assume !!(main_~i~0 < main_~j~0); 5287#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5286#L12-2 assume !!(main_~i~0 < main_~j~0); 5285#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5284#L12-2 assume !!(main_~i~0 < main_~j~0); 5283#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5282#L12-2 assume !!(main_~i~0 < main_~j~0); 5281#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5280#L12-2 assume !!(main_~i~0 < main_~j~0); 5279#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5278#L12-2 assume !!(main_~i~0 < main_~j~0); 5277#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5276#L12-2 assume !!(main_~i~0 < main_~j~0); 5275#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5274#L12-2 assume !!(main_~i~0 < main_~j~0); 5273#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5272#L12-2 assume !!(main_~i~0 < main_~j~0); 5271#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5270#L12-2 assume !!(main_~i~0 < main_~j~0); 5269#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5268#L12-2 assume !!(main_~i~0 < main_~j~0); 5267#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5266#L12-2 assume !!(main_~i~0 < main_~j~0); 5265#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5264#L12-2 assume !!(main_~i~0 < main_~j~0); 5263#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5262#L12-2 assume !!(main_~i~0 < main_~j~0); 5261#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5260#L12-2 assume !!(main_~i~0 < main_~j~0); 5259#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5258#L12-2 assume !!(main_~i~0 < main_~j~0); 5257#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5256#L12-2 assume !!(main_~i~0 < main_~j~0); 5255#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5254#L12-2 assume !!(main_~i~0 < main_~j~0); 5253#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5252#L12-2 assume !!(main_~i~0 < main_~j~0); 5251#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5250#L12-2 assume !!(main_~i~0 < main_~j~0); 5249#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5248#L12-2 assume !!(main_~i~0 < main_~j~0); 5247#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5246#L12-2 assume !!(main_~i~0 < main_~j~0); 5245#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5244#L12-2 assume !!(main_~i~0 < main_~j~0); 5242#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5241#L12-2 assume !!(main_~i~0 < main_~j~0); 5240#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5239#L12-2 assume !!(main_~i~0 < main_~j~0); 5236#L12 [2021-08-27 14:11:24,406 INFO L793 eck$LassoCheckResult]: Loop: 5236#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 5237#L12-2 assume !!(main_~i~0 < main_~j~0); 5240#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5239#L12-2 assume !!(main_~i~0 < main_~j~0); 5236#L12 [2021-08-27 14:11:24,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:24,406 INFO L82 PathProgramCache]: Analyzing trace with hash 424994617, now seen corresponding path program 27 times [2021-08-27 14:11:24,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:24,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821261997] [2021-08-27 14:11:24,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:24,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:24,414 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:24,421 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:24,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:24,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 25 times [2021-08-27 14:11:24,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:24,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646936686] [2021-08-27 14:11:24,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:24,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:24,424 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:24,425 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:24,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:24,425 INFO L82 PathProgramCache]: Analyzing trace with hash 162765681, now seen corresponding path program 27 times [2021-08-27 14:11:24,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:24,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693004388] [2021-08-27 14:11:24,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:24,425 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 84 proven. 756 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:24,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:24,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693004388] [2021-08-27 14:11:24,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693004388] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:24,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756885187] [2021-08-27 14:11:24,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 14:11:24,765 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:24,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:24,767 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:24,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2021-08-27 14:11:25,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2021-08-27 14:11:25,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:25,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 29 conjunts are in the unsatisfiable core [2021-08-27 14:11:25,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:25,288 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 84 proven. 756 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:25,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756885187] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:25,289 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:25,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2021-08-27 14:11:25,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095172379] [2021-08-27 14:11:25,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:25,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-27 14:11:25,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2021-08-27 14:11:25,328 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. cyclomatic complexity: 3 Second operand has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:25,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:25,398 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2021-08-27 14:11:25,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-27 14:11:25,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2021-08-27 14:11:25,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:25,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 62 states and 64 transitions. [2021-08-27 14:11:25,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:25,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:25,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 64 transitions. [2021-08-27 14:11:25,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:25,400 INFO L681 BuchiCegarLoop]: Abstraction has 62 states and 64 transitions. [2021-08-27 14:11:25,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 64 transitions. [2021-08-27 14:11:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2021-08-27 14:11:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 60 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2021-08-27 14:11:25,401 INFO L704 BuchiCegarLoop]: Abstraction has 61 states and 63 transitions. [2021-08-27 14:11:25,401 INFO L587 BuchiCegarLoop]: Abstraction has 61 states and 63 transitions. [2021-08-27 14:11:25,401 INFO L425 BuchiCegarLoop]: ======== Iteration 30============ [2021-08-27 14:11:25,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 63 transitions. [2021-08-27 14:11:25,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:25,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:25,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:25,402 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [29, 28, 1] [2021-08-27 14:11:25,402 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:25,402 INFO L791 eck$LassoCheckResult]: Stem: 5569#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 5565#L12-2 assume !!(main_~i~0 < main_~j~0); 5566#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5567#L12-2 assume !!(main_~i~0 < main_~j~0); 5568#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5572#L12-2 assume !!(main_~i~0 < main_~j~0); 5625#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5624#L12-2 assume !!(main_~i~0 < main_~j~0); 5623#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5622#L12-2 assume !!(main_~i~0 < main_~j~0); 5621#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5620#L12-2 assume !!(main_~i~0 < main_~j~0); 5619#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5618#L12-2 assume !!(main_~i~0 < main_~j~0); 5617#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5616#L12-2 assume !!(main_~i~0 < main_~j~0); 5615#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5614#L12-2 assume !!(main_~i~0 < main_~j~0); 5613#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5612#L12-2 assume !!(main_~i~0 < main_~j~0); 5611#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5610#L12-2 assume !!(main_~i~0 < main_~j~0); 5609#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5608#L12-2 assume !!(main_~i~0 < main_~j~0); 5607#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5606#L12-2 assume !!(main_~i~0 < main_~j~0); 5605#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5604#L12-2 assume !!(main_~i~0 < main_~j~0); 5603#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5602#L12-2 assume !!(main_~i~0 < main_~j~0); 5601#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5600#L12-2 assume !!(main_~i~0 < main_~j~0); 5599#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5598#L12-2 assume !!(main_~i~0 < main_~j~0); 5597#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5596#L12-2 assume !!(main_~i~0 < main_~j~0); 5595#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5594#L12-2 assume !!(main_~i~0 < main_~j~0); 5593#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5592#L12-2 assume !!(main_~i~0 < main_~j~0); 5591#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5590#L12-2 assume !!(main_~i~0 < main_~j~0); 5589#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5588#L12-2 assume !!(main_~i~0 < main_~j~0); 5587#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5586#L12-2 assume !!(main_~i~0 < main_~j~0); 5585#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5584#L12-2 assume !!(main_~i~0 < main_~j~0); 5583#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5582#L12-2 assume !!(main_~i~0 < main_~j~0); 5581#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5580#L12-2 assume !!(main_~i~0 < main_~j~0); 5579#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5578#L12-2 assume !!(main_~i~0 < main_~j~0); 5576#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5575#L12-2 assume !!(main_~i~0 < main_~j~0); 5574#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5573#L12-2 assume !!(main_~i~0 < main_~j~0); 5570#L12 [2021-08-27 14:11:25,402 INFO L793 eck$LassoCheckResult]: Loop: 5570#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 5571#L12-2 assume !!(main_~i~0 < main_~j~0); 5574#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5573#L12-2 assume !!(main_~i~0 < main_~j~0); 5570#L12 [2021-08-27 14:11:25,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:25,403 INFO L82 PathProgramCache]: Analyzing trace with hash 397934230, now seen corresponding path program 28 times [2021-08-27 14:11:25,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:25,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164865344] [2021-08-27 14:11:25,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:25,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:25,411 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:25,417 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:25,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:25,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 26 times [2021-08-27 14:11:25,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:25,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080901535] [2021-08-27 14:11:25,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:25,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:25,420 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:25,421 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:25,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:25,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1741798478, now seen corresponding path program 28 times [2021-08-27 14:11:25,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:25,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042387907] [2021-08-27 14:11:25,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:25,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 87 proven. 812 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:25,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:25,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042387907] [2021-08-27 14:11:25,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042387907] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:25,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68186176] [2021-08-27 14:11:25,809 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 14:11:25,811 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:25,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:25,812 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:25,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2021-08-27 14:11:26,191 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 14:11:26,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:26,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 30 conjunts are in the unsatisfiable core [2021-08-27 14:11:26,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 87 proven. 812 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:26,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68186176] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:26,354 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:26,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2021-08-27 14:11:26,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636463798] [2021-08-27 14:11:26,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:26,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-27 14:11:26,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2021-08-27 14:11:26,390 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. cyclomatic complexity: 3 Second operand has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:26,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:26,459 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2021-08-27 14:11:26,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-08-27 14:11:26,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 67 transitions. [2021-08-27 14:11:26,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:26,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 66 transitions. [2021-08-27 14:11:26,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:26,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:26,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 66 transitions. [2021-08-27 14:11:26,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:26,461 INFO L681 BuchiCegarLoop]: Abstraction has 64 states and 66 transitions. [2021-08-27 14:11:26,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 66 transitions. [2021-08-27 14:11:26,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2021-08-27 14:11:26,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 62 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2021-08-27 14:11:26,463 INFO L704 BuchiCegarLoop]: Abstraction has 63 states and 65 transitions. [2021-08-27 14:11:26,463 INFO L587 BuchiCegarLoop]: Abstraction has 63 states and 65 transitions. [2021-08-27 14:11:26,463 INFO L425 BuchiCegarLoop]: ======== Iteration 31============ [2021-08-27 14:11:26,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 65 transitions. [2021-08-27 14:11:26,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:26,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:26,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:26,464 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [30, 29, 1] [2021-08-27 14:11:26,464 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:26,464 INFO L791 eck$LassoCheckResult]: Stem: 5914#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 5910#L12-2 assume !!(main_~i~0 < main_~j~0); 5911#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5912#L12-2 assume !!(main_~i~0 < main_~j~0); 5913#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5917#L12-2 assume !!(main_~i~0 < main_~j~0); 5972#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5971#L12-2 assume !!(main_~i~0 < main_~j~0); 5970#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5969#L12-2 assume !!(main_~i~0 < main_~j~0); 5968#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5967#L12-2 assume !!(main_~i~0 < main_~j~0); 5966#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5965#L12-2 assume !!(main_~i~0 < main_~j~0); 5964#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5963#L12-2 assume !!(main_~i~0 < main_~j~0); 5962#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5961#L12-2 assume !!(main_~i~0 < main_~j~0); 5960#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5959#L12-2 assume !!(main_~i~0 < main_~j~0); 5958#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5957#L12-2 assume !!(main_~i~0 < main_~j~0); 5956#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5955#L12-2 assume !!(main_~i~0 < main_~j~0); 5954#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5953#L12-2 assume !!(main_~i~0 < main_~j~0); 5952#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5951#L12-2 assume !!(main_~i~0 < main_~j~0); 5950#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5949#L12-2 assume !!(main_~i~0 < main_~j~0); 5948#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5947#L12-2 assume !!(main_~i~0 < main_~j~0); 5946#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5945#L12-2 assume !!(main_~i~0 < main_~j~0); 5944#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5943#L12-2 assume !!(main_~i~0 < main_~j~0); 5942#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5941#L12-2 assume !!(main_~i~0 < main_~j~0); 5940#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5939#L12-2 assume !!(main_~i~0 < main_~j~0); 5938#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5937#L12-2 assume !!(main_~i~0 < main_~j~0); 5936#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5935#L12-2 assume !!(main_~i~0 < main_~j~0); 5934#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5933#L12-2 assume !!(main_~i~0 < main_~j~0); 5932#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5931#L12-2 assume !!(main_~i~0 < main_~j~0); 5930#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5929#L12-2 assume !!(main_~i~0 < main_~j~0); 5928#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5927#L12-2 assume !!(main_~i~0 < main_~j~0); 5926#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5925#L12-2 assume !!(main_~i~0 < main_~j~0); 5924#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5923#L12-2 assume !!(main_~i~0 < main_~j~0); 5921#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5920#L12-2 assume !!(main_~i~0 < main_~j~0); 5919#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5918#L12-2 assume !!(main_~i~0 < main_~j~0); 5915#L12 [2021-08-27 14:11:26,464 INFO L793 eck$LassoCheckResult]: Loop: 5915#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 5916#L12-2 assume !!(main_~i~0 < main_~j~0); 5919#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5918#L12-2 assume !!(main_~i~0 < main_~j~0); 5915#L12 [2021-08-27 14:11:26,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:26,465 INFO L82 PathProgramCache]: Analyzing trace with hash 162706099, now seen corresponding path program 29 times [2021-08-27 14:11:26,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:26,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969381874] [2021-08-27 14:11:26,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:26,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:26,473 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:26,482 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:26,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:26,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 27 times [2021-08-27 14:11:26,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:26,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76362277] [2021-08-27 14:11:26,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:26,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:26,485 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:26,486 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:26,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:26,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1226106389, now seen corresponding path program 29 times [2021-08-27 14:11:26,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:26,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266530020] [2021-08-27 14:11:26,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:26,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 90 proven. 870 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:26,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:26,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266530020] [2021-08-27 14:11:26,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266530020] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:26,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41939273] [2021-08-27 14:11:26,928 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 14:11:26,929 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:26,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:26,930 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:26,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2021-08-27 14:11:27,326 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2021-08-27 14:11:27,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:27,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 31 conjunts are in the unsatisfiable core [2021-08-27 14:11:27,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:27,506 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 90 proven. 870 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:27,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41939273] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:27,507 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:27,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2021-08-27 14:11:27,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519863327] [2021-08-27 14:11:27,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:27,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-08-27 14:11:27,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2021-08-27 14:11:27,538 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. cyclomatic complexity: 3 Second operand has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:27,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:27,590 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2021-08-27 14:11:27,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-27 14:11:27,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 69 transitions. [2021-08-27 14:11:27,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:27,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 66 states and 68 transitions. [2021-08-27 14:11:27,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:27,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:27,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 68 transitions. [2021-08-27 14:11:27,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:27,591 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 68 transitions. [2021-08-27 14:11:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 68 transitions. [2021-08-27 14:11:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2021-08-27 14:11:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 64 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2021-08-27 14:11:27,592 INFO L704 BuchiCegarLoop]: Abstraction has 65 states and 67 transitions. [2021-08-27 14:11:27,592 INFO L587 BuchiCegarLoop]: Abstraction has 65 states and 67 transitions. [2021-08-27 14:11:27,593 INFO L425 BuchiCegarLoop]: ======== Iteration 32============ [2021-08-27 14:11:27,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 67 transitions. [2021-08-27 14:11:27,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:27,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:27,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:27,593 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [31, 30, 1] [2021-08-27 14:11:27,593 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:27,593 INFO L791 eck$LassoCheckResult]: Stem: 6270#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 6266#L12-2 assume !!(main_~i~0 < main_~j~0); 6267#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6268#L12-2 assume !!(main_~i~0 < main_~j~0); 6269#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6273#L12-2 assume !!(main_~i~0 < main_~j~0); 6330#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6329#L12-2 assume !!(main_~i~0 < main_~j~0); 6328#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6327#L12-2 assume !!(main_~i~0 < main_~j~0); 6326#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6325#L12-2 assume !!(main_~i~0 < main_~j~0); 6324#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6323#L12-2 assume !!(main_~i~0 < main_~j~0); 6322#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6321#L12-2 assume !!(main_~i~0 < main_~j~0); 6320#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6319#L12-2 assume !!(main_~i~0 < main_~j~0); 6318#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6317#L12-2 assume !!(main_~i~0 < main_~j~0); 6316#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6315#L12-2 assume !!(main_~i~0 < main_~j~0); 6314#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6313#L12-2 assume !!(main_~i~0 < main_~j~0); 6312#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6311#L12-2 assume !!(main_~i~0 < main_~j~0); 6310#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6309#L12-2 assume !!(main_~i~0 < main_~j~0); 6308#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6307#L12-2 assume !!(main_~i~0 < main_~j~0); 6306#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6305#L12-2 assume !!(main_~i~0 < main_~j~0); 6304#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6303#L12-2 assume !!(main_~i~0 < main_~j~0); 6302#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6301#L12-2 assume !!(main_~i~0 < main_~j~0); 6300#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6299#L12-2 assume !!(main_~i~0 < main_~j~0); 6298#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6297#L12-2 assume !!(main_~i~0 < main_~j~0); 6296#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6295#L12-2 assume !!(main_~i~0 < main_~j~0); 6294#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6293#L12-2 assume !!(main_~i~0 < main_~j~0); 6292#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6291#L12-2 assume !!(main_~i~0 < main_~j~0); 6290#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6289#L12-2 assume !!(main_~i~0 < main_~j~0); 6288#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6287#L12-2 assume !!(main_~i~0 < main_~j~0); 6286#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6285#L12-2 assume !!(main_~i~0 < main_~j~0); 6284#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6283#L12-2 assume !!(main_~i~0 < main_~j~0); 6282#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6281#L12-2 assume !!(main_~i~0 < main_~j~0); 6280#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6279#L12-2 assume !!(main_~i~0 < main_~j~0); 6277#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6276#L12-2 assume !!(main_~i~0 < main_~j~0); 6275#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6274#L12-2 assume !!(main_~i~0 < main_~j~0); 6271#L12 [2021-08-27 14:11:27,593 INFO L793 eck$LassoCheckResult]: Loop: 6271#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 6272#L12-2 assume !!(main_~i~0 < main_~j~0); 6275#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6274#L12-2 assume !!(main_~i~0 < main_~j~0); 6271#L12 [2021-08-27 14:11:27,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:27,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1741738896, now seen corresponding path program 30 times [2021-08-27 14:11:27,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:27,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069662955] [2021-08-27 14:11:27,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:27,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:27,603 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:27,610 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:27,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:27,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 28 times [2021-08-27 14:11:27,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:27,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564074131] [2021-08-27 14:11:27,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:27,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:27,613 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:27,614 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:27,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:27,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1524399032, now seen corresponding path program 30 times [2021-08-27 14:11:27,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:27,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081034999] [2021-08-27 14:11:27,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:27,615 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:28,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:28,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:28,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081034999] [2021-08-27 14:11:28,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081034999] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:28,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471149432] [2021-08-27 14:11:28,003 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 14:11:28,003 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:28,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:28,004 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:28,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2021-08-27 14:11:28,434 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2021-08-27 14:11:28,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:28,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 32 conjunts are in the unsatisfiable core [2021-08-27 14:11:28,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:28,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471149432] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:28,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:28,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2021-08-27 14:11:28,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494923901] [2021-08-27 14:11:28,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:28,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-27 14:11:28,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2021-08-27 14:11:28,645 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. cyclomatic complexity: 3 Second operand has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:28,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:28,709 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2021-08-27 14:11:28,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-08-27 14:11:28,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 71 transitions. [2021-08-27 14:11:28,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:28,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 68 states and 70 transitions. [2021-08-27 14:11:28,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:28,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:28,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 70 transitions. [2021-08-27 14:11:28,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:28,711 INFO L681 BuchiCegarLoop]: Abstraction has 68 states and 70 transitions. [2021-08-27 14:11:28,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 70 transitions. [2021-08-27 14:11:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2021-08-27 14:11:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 66 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2021-08-27 14:11:28,711 INFO L704 BuchiCegarLoop]: Abstraction has 67 states and 69 transitions. [2021-08-27 14:11:28,711 INFO L587 BuchiCegarLoop]: Abstraction has 67 states and 69 transitions. [2021-08-27 14:11:28,712 INFO L425 BuchiCegarLoop]: ======== Iteration 33============ [2021-08-27 14:11:28,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 69 transitions. [2021-08-27 14:11:28,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:28,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:28,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:28,712 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [32, 31, 1] [2021-08-27 14:11:28,712 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:28,712 INFO L791 eck$LassoCheckResult]: Stem: 6637#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 6633#L12-2 assume !!(main_~i~0 < main_~j~0); 6634#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6635#L12-2 assume !!(main_~i~0 < main_~j~0); 6636#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6640#L12-2 assume !!(main_~i~0 < main_~j~0); 6699#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6698#L12-2 assume !!(main_~i~0 < main_~j~0); 6697#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6696#L12-2 assume !!(main_~i~0 < main_~j~0); 6695#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6694#L12-2 assume !!(main_~i~0 < main_~j~0); 6693#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6692#L12-2 assume !!(main_~i~0 < main_~j~0); 6691#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6690#L12-2 assume !!(main_~i~0 < main_~j~0); 6689#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6688#L12-2 assume !!(main_~i~0 < main_~j~0); 6687#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6686#L12-2 assume !!(main_~i~0 < main_~j~0); 6685#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6684#L12-2 assume !!(main_~i~0 < main_~j~0); 6683#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6682#L12-2 assume !!(main_~i~0 < main_~j~0); 6681#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6680#L12-2 assume !!(main_~i~0 < main_~j~0); 6679#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6678#L12-2 assume !!(main_~i~0 < main_~j~0); 6677#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6676#L12-2 assume !!(main_~i~0 < main_~j~0); 6675#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6674#L12-2 assume !!(main_~i~0 < main_~j~0); 6673#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6672#L12-2 assume !!(main_~i~0 < main_~j~0); 6671#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6670#L12-2 assume !!(main_~i~0 < main_~j~0); 6669#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6668#L12-2 assume !!(main_~i~0 < main_~j~0); 6667#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6666#L12-2 assume !!(main_~i~0 < main_~j~0); 6665#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6664#L12-2 assume !!(main_~i~0 < main_~j~0); 6663#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6662#L12-2 assume !!(main_~i~0 < main_~j~0); 6661#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6660#L12-2 assume !!(main_~i~0 < main_~j~0); 6659#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6658#L12-2 assume !!(main_~i~0 < main_~j~0); 6657#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6656#L12-2 assume !!(main_~i~0 < main_~j~0); 6655#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6654#L12-2 assume !!(main_~i~0 < main_~j~0); 6653#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6652#L12-2 assume !!(main_~i~0 < main_~j~0); 6651#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6650#L12-2 assume !!(main_~i~0 < main_~j~0); 6649#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6648#L12-2 assume !!(main_~i~0 < main_~j~0); 6647#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6646#L12-2 assume !!(main_~i~0 < main_~j~0); 6644#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6643#L12-2 assume !!(main_~i~0 < main_~j~0); 6642#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6641#L12-2 assume !!(main_~i~0 < main_~j~0); 6638#L12 [2021-08-27 14:11:28,712 INFO L793 eck$LassoCheckResult]: Loop: 6638#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 6639#L12-2 assume !!(main_~i~0 < main_~j~0); 6642#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6641#L12-2 assume !!(main_~i~0 < main_~j~0); 6638#L12 [2021-08-27 14:11:28,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:28,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1226165971, now seen corresponding path program 31 times [2021-08-27 14:11:28,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:28,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220669750] [2021-08-27 14:11:28,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:28,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:28,721 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:28,728 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:28,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:28,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 29 times [2021-08-27 14:11:28,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:28,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522501864] [2021-08-27 14:11:28,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:28,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:28,731 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:28,732 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:28,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:28,733 INFO L82 PathProgramCache]: Analyzing trace with hash -420820123, now seen corresponding path program 31 times [2021-08-27 14:11:28,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:28,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828558603] [2021-08-27 14:11:28,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:28,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 96 proven. 992 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:29,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:29,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828558603] [2021-08-27 14:11:29,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828558603] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:29,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698029115] [2021-08-27 14:11:29,163 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 14:11:29,163 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:29,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:29,165 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:29,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2021-08-27 14:11:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:29,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 33 conjunts are in the unsatisfiable core [2021-08-27 14:11:29,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 96 proven. 992 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:29,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698029115] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:29,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:29,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2021-08-27 14:11:29,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394114062] [2021-08-27 14:11:29,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:29,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-27 14:11:29,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2021-08-27 14:11:29,835 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. cyclomatic complexity: 3 Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:29,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:29,913 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2021-08-27 14:11:29,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-08-27 14:11:29,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 73 transitions. [2021-08-27 14:11:29,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:29,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 70 states and 72 transitions. [2021-08-27 14:11:29,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:29,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:29,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 72 transitions. [2021-08-27 14:11:29,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:29,915 INFO L681 BuchiCegarLoop]: Abstraction has 70 states and 72 transitions. [2021-08-27 14:11:29,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 72 transitions. [2021-08-27 14:11:29,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2021-08-27 14:11:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 68 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2021-08-27 14:11:29,916 INFO L704 BuchiCegarLoop]: Abstraction has 69 states and 71 transitions. [2021-08-27 14:11:29,916 INFO L587 BuchiCegarLoop]: Abstraction has 69 states and 71 transitions. [2021-08-27 14:11:29,917 INFO L425 BuchiCegarLoop]: ======== Iteration 34============ [2021-08-27 14:11:29,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 71 transitions. [2021-08-27 14:11:29,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:29,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:29,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:29,917 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [33, 32, 1] [2021-08-27 14:11:29,918 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:29,918 INFO L791 eck$LassoCheckResult]: Stem: 7015#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 7011#L12-2 assume !!(main_~i~0 < main_~j~0); 7012#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7013#L12-2 assume !!(main_~i~0 < main_~j~0); 7014#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7018#L12-2 assume !!(main_~i~0 < main_~j~0); 7079#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7078#L12-2 assume !!(main_~i~0 < main_~j~0); 7077#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7076#L12-2 assume !!(main_~i~0 < main_~j~0); 7075#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7074#L12-2 assume !!(main_~i~0 < main_~j~0); 7073#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7072#L12-2 assume !!(main_~i~0 < main_~j~0); 7071#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7070#L12-2 assume !!(main_~i~0 < main_~j~0); 7069#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7068#L12-2 assume !!(main_~i~0 < main_~j~0); 7067#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7066#L12-2 assume !!(main_~i~0 < main_~j~0); 7065#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7064#L12-2 assume !!(main_~i~0 < main_~j~0); 7063#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7062#L12-2 assume !!(main_~i~0 < main_~j~0); 7061#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7060#L12-2 assume !!(main_~i~0 < main_~j~0); 7059#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7058#L12-2 assume !!(main_~i~0 < main_~j~0); 7057#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7056#L12-2 assume !!(main_~i~0 < main_~j~0); 7055#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7054#L12-2 assume !!(main_~i~0 < main_~j~0); 7053#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7052#L12-2 assume !!(main_~i~0 < main_~j~0); 7051#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7050#L12-2 assume !!(main_~i~0 < main_~j~0); 7049#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7048#L12-2 assume !!(main_~i~0 < main_~j~0); 7047#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7046#L12-2 assume !!(main_~i~0 < main_~j~0); 7045#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7044#L12-2 assume !!(main_~i~0 < main_~j~0); 7043#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7042#L12-2 assume !!(main_~i~0 < main_~j~0); 7041#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7040#L12-2 assume !!(main_~i~0 < main_~j~0); 7039#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7038#L12-2 assume !!(main_~i~0 < main_~j~0); 7037#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7036#L12-2 assume !!(main_~i~0 < main_~j~0); 7035#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7034#L12-2 assume !!(main_~i~0 < main_~j~0); 7033#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7032#L12-2 assume !!(main_~i~0 < main_~j~0); 7031#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7030#L12-2 assume !!(main_~i~0 < main_~j~0); 7029#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7028#L12-2 assume !!(main_~i~0 < main_~j~0); 7027#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7026#L12-2 assume !!(main_~i~0 < main_~j~0); 7025#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7024#L12-2 assume !!(main_~i~0 < main_~j~0); 7022#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7021#L12-2 assume !!(main_~i~0 < main_~j~0); 7020#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7019#L12-2 assume !!(main_~i~0 < main_~j~0); 7016#L12 [2021-08-27 14:11:29,918 INFO L793 eck$LassoCheckResult]: Loop: 7016#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 7017#L12-2 assume !!(main_~i~0 < main_~j~0); 7020#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7019#L12-2 assume !!(main_~i~0 < main_~j~0); 7016#L12 [2021-08-27 14:11:29,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:29,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1524458614, now seen corresponding path program 32 times [2021-08-27 14:11:29,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:29,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948385474] [2021-08-27 14:11:29,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:29,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:29,931 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:29,939 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:29,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:29,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 30 times [2021-08-27 14:11:29,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:29,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807675659] [2021-08-27 14:11:29,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:29,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:29,945 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:29,946 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:29,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:29,946 INFO L82 PathProgramCache]: Analyzing trace with hash -738410686, now seen corresponding path program 32 times [2021-08-27 14:11:29,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:29,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969790916] [2021-08-27 14:11:29,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:29,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 99 proven. 1056 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:30,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:30,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969790916] [2021-08-27 14:11:30,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969790916] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:30,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510046554] [2021-08-27 14:11:30,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:11:30,413 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:30,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:30,414 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:30,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2021-08-27 14:11:30,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 14:11:30,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:30,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 34 conjunts are in the unsatisfiable core [2021-08-27 14:11:30,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 99 proven. 1056 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:31,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510046554] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:31,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:31,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2021-08-27 14:11:31,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443356295] [2021-08-27 14:11:31,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:31,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-27 14:11:31,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2021-08-27 14:11:31,118 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. cyclomatic complexity: 3 Second operand has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:31,184 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2021-08-27 14:11:31,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-27 14:11:31,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 75 transitions. [2021-08-27 14:11:31,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:31,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 72 states and 74 transitions. [2021-08-27 14:11:31,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:31,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:31,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 74 transitions. [2021-08-27 14:11:31,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:31,186 INFO L681 BuchiCegarLoop]: Abstraction has 72 states and 74 transitions. [2021-08-27 14:11:31,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 74 transitions. [2021-08-27 14:11:31,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2021-08-27 14:11:31,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.028169014084507) internal successors, (73), 70 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2021-08-27 14:11:31,187 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 73 transitions. [2021-08-27 14:11:31,187 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 73 transitions. [2021-08-27 14:11:31,187 INFO L425 BuchiCegarLoop]: ======== Iteration 35============ [2021-08-27 14:11:31,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 73 transitions. [2021-08-27 14:11:31,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:31,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:31,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:31,188 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [34, 33, 1] [2021-08-27 14:11:31,188 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:31,188 INFO L791 eck$LassoCheckResult]: Stem: 7404#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 7400#L12-2 assume !!(main_~i~0 < main_~j~0); 7401#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7402#L12-2 assume !!(main_~i~0 < main_~j~0); 7403#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7407#L12-2 assume !!(main_~i~0 < main_~j~0); 7470#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7469#L12-2 assume !!(main_~i~0 < main_~j~0); 7468#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7467#L12-2 assume !!(main_~i~0 < main_~j~0); 7466#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7465#L12-2 assume !!(main_~i~0 < main_~j~0); 7464#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7463#L12-2 assume !!(main_~i~0 < main_~j~0); 7462#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7461#L12-2 assume !!(main_~i~0 < main_~j~0); 7460#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7459#L12-2 assume !!(main_~i~0 < main_~j~0); 7458#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7457#L12-2 assume !!(main_~i~0 < main_~j~0); 7456#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7455#L12-2 assume !!(main_~i~0 < main_~j~0); 7454#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7453#L12-2 assume !!(main_~i~0 < main_~j~0); 7452#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7451#L12-2 assume !!(main_~i~0 < main_~j~0); 7450#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7449#L12-2 assume !!(main_~i~0 < main_~j~0); 7448#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7447#L12-2 assume !!(main_~i~0 < main_~j~0); 7446#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7445#L12-2 assume !!(main_~i~0 < main_~j~0); 7444#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7443#L12-2 assume !!(main_~i~0 < main_~j~0); 7442#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7441#L12-2 assume !!(main_~i~0 < main_~j~0); 7440#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7439#L12-2 assume !!(main_~i~0 < main_~j~0); 7438#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7437#L12-2 assume !!(main_~i~0 < main_~j~0); 7436#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7435#L12-2 assume !!(main_~i~0 < main_~j~0); 7434#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7433#L12-2 assume !!(main_~i~0 < main_~j~0); 7432#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7431#L12-2 assume !!(main_~i~0 < main_~j~0); 7430#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7429#L12-2 assume !!(main_~i~0 < main_~j~0); 7428#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7427#L12-2 assume !!(main_~i~0 < main_~j~0); 7426#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7425#L12-2 assume !!(main_~i~0 < main_~j~0); 7424#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7423#L12-2 assume !!(main_~i~0 < main_~j~0); 7422#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7421#L12-2 assume !!(main_~i~0 < main_~j~0); 7420#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7419#L12-2 assume !!(main_~i~0 < main_~j~0); 7418#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7417#L12-2 assume !!(main_~i~0 < main_~j~0); 7416#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7415#L12-2 assume !!(main_~i~0 < main_~j~0); 7414#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7413#L12-2 assume !!(main_~i~0 < main_~j~0); 7411#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7410#L12-2 assume !!(main_~i~0 < main_~j~0); 7409#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7408#L12-2 assume !!(main_~i~0 < main_~j~0); 7405#L12 [2021-08-27 14:11:31,188 INFO L793 eck$LassoCheckResult]: Loop: 7405#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 7406#L12-2 assume !!(main_~i~0 < main_~j~0); 7409#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7408#L12-2 assume !!(main_~i~0 < main_~j~0); 7405#L12 [2021-08-27 14:11:31,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:31,189 INFO L82 PathProgramCache]: Analyzing trace with hash -420879705, now seen corresponding path program 33 times [2021-08-27 14:11:31,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:31,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82950715] [2021-08-27 14:11:31,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:31,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:31,197 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:31,205 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:31,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:31,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 31 times [2021-08-27 14:11:31,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:31,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566957143] [2021-08-27 14:11:31,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:31,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:31,209 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:31,210 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:31,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:31,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1000263713, now seen corresponding path program 33 times [2021-08-27 14:11:31,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:31,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660432407] [2021-08-27 14:11:31,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:31,210 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:31,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 102 proven. 1122 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:31,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:31,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660432407] [2021-08-27 14:11:31,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660432407] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:31,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890937487] [2021-08-27 14:11:31,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 14:11:31,759 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:31,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:31,760 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:31,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2021-08-27 14:11:32,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2021-08-27 14:11:32,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:32,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 35 conjunts are in the unsatisfiable core [2021-08-27 14:11:32,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 102 proven. 1122 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:32,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890937487] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:32,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:32,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2021-08-27 14:11:32,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336104861] [2021-08-27 14:11:32,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:32,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-27 14:11:32,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2021-08-27 14:11:32,457 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. cyclomatic complexity: 3 Second operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:32,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:32,526 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2021-08-27 14:11:32,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-27 14:11:32,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 77 transitions. [2021-08-27 14:11:32,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:32,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 74 states and 76 transitions. [2021-08-27 14:11:32,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:32,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:32,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 76 transitions. [2021-08-27 14:11:32,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:32,527 INFO L681 BuchiCegarLoop]: Abstraction has 74 states and 76 transitions. [2021-08-27 14:11:32,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 76 transitions. [2021-08-27 14:11:32,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2021-08-27 14:11:32,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 72 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:32,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2021-08-27 14:11:32,528 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 75 transitions. [2021-08-27 14:11:32,528 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 75 transitions. [2021-08-27 14:11:32,528 INFO L425 BuchiCegarLoop]: ======== Iteration 36============ [2021-08-27 14:11:32,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 75 transitions. [2021-08-27 14:11:32,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:32,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:32,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:32,529 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [35, 34, 1] [2021-08-27 14:11:32,529 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:32,529 INFO L791 eck$LassoCheckResult]: Stem: 7804#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 7800#L12-2 assume !!(main_~i~0 < main_~j~0); 7801#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7802#L12-2 assume !!(main_~i~0 < main_~j~0); 7803#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7807#L12-2 assume !!(main_~i~0 < main_~j~0); 7872#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7871#L12-2 assume !!(main_~i~0 < main_~j~0); 7870#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7869#L12-2 assume !!(main_~i~0 < main_~j~0); 7868#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7867#L12-2 assume !!(main_~i~0 < main_~j~0); 7866#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7865#L12-2 assume !!(main_~i~0 < main_~j~0); 7864#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7863#L12-2 assume !!(main_~i~0 < main_~j~0); 7862#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7861#L12-2 assume !!(main_~i~0 < main_~j~0); 7860#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7859#L12-2 assume !!(main_~i~0 < main_~j~0); 7858#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7857#L12-2 assume !!(main_~i~0 < main_~j~0); 7856#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7855#L12-2 assume !!(main_~i~0 < main_~j~0); 7854#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7853#L12-2 assume !!(main_~i~0 < main_~j~0); 7852#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7851#L12-2 assume !!(main_~i~0 < main_~j~0); 7850#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7849#L12-2 assume !!(main_~i~0 < main_~j~0); 7848#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7847#L12-2 assume !!(main_~i~0 < main_~j~0); 7846#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7845#L12-2 assume !!(main_~i~0 < main_~j~0); 7844#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7843#L12-2 assume !!(main_~i~0 < main_~j~0); 7842#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7841#L12-2 assume !!(main_~i~0 < main_~j~0); 7840#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7839#L12-2 assume !!(main_~i~0 < main_~j~0); 7838#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7837#L12-2 assume !!(main_~i~0 < main_~j~0); 7836#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7835#L12-2 assume !!(main_~i~0 < main_~j~0); 7834#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7833#L12-2 assume !!(main_~i~0 < main_~j~0); 7832#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7831#L12-2 assume !!(main_~i~0 < main_~j~0); 7830#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7829#L12-2 assume !!(main_~i~0 < main_~j~0); 7828#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7827#L12-2 assume !!(main_~i~0 < main_~j~0); 7826#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7825#L12-2 assume !!(main_~i~0 < main_~j~0); 7824#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7823#L12-2 assume !!(main_~i~0 < main_~j~0); 7822#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7821#L12-2 assume !!(main_~i~0 < main_~j~0); 7820#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7819#L12-2 assume !!(main_~i~0 < main_~j~0); 7818#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7817#L12-2 assume !!(main_~i~0 < main_~j~0); 7816#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7815#L12-2 assume !!(main_~i~0 < main_~j~0); 7814#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7813#L12-2 assume !!(main_~i~0 < main_~j~0); 7811#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7810#L12-2 assume !!(main_~i~0 < main_~j~0); 7809#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7808#L12-2 assume !!(main_~i~0 < main_~j~0); 7805#L12 [2021-08-27 14:11:32,530 INFO L793 eck$LassoCheckResult]: Loop: 7805#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 7806#L12-2 assume !!(main_~i~0 < main_~j~0); 7809#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7808#L12-2 assume !!(main_~i~0 < main_~j~0); 7805#L12 [2021-08-27 14:11:32,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:32,530 INFO L82 PathProgramCache]: Analyzing trace with hash -738470268, now seen corresponding path program 34 times [2021-08-27 14:11:32,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:32,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039578693] [2021-08-27 14:11:32,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:32,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:32,566 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:32,574 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:32,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:32,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 32 times [2021-08-27 14:11:32,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:32,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403382378] [2021-08-27 14:11:32,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:32,574 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:32,577 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:32,578 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:32,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:32,578 INFO L82 PathProgramCache]: Analyzing trace with hash 762047804, now seen corresponding path program 34 times [2021-08-27 14:11:32,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:32,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048653296] [2021-08-27 14:11:32,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:32,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 105 proven. 1190 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:33,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:33,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048653296] [2021-08-27 14:11:33,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048653296] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:33,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858993601] [2021-08-27 14:11:33,079 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 14:11:33,079 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:33,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:33,080 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:33,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2021-08-27 14:11:33,631 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 14:11:33,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:33,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 36 conjunts are in the unsatisfiable core [2021-08-27 14:11:33,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:33,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 105 proven. 1190 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:33,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858993601] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:33,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:33,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2021-08-27 14:11:33,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857175097] [2021-08-27 14:11:33,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:33,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-27 14:11:33,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2021-08-27 14:11:33,892 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. cyclomatic complexity: 3 Second operand has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:33,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:33,968 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2021-08-27 14:11:33,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-27 14:11:33,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 79 transitions. [2021-08-27 14:11:33,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:33,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 76 states and 78 transitions. [2021-08-27 14:11:33,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:33,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:33,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 78 transitions. [2021-08-27 14:11:33,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:33,969 INFO L681 BuchiCegarLoop]: Abstraction has 76 states and 78 transitions. [2021-08-27 14:11:33,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 78 transitions. [2021-08-27 14:11:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2021-08-27 14:11:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:33,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2021-08-27 14:11:33,971 INFO L704 BuchiCegarLoop]: Abstraction has 75 states and 77 transitions. [2021-08-27 14:11:33,971 INFO L587 BuchiCegarLoop]: Abstraction has 75 states and 77 transitions. [2021-08-27 14:11:33,971 INFO L425 BuchiCegarLoop]: ======== Iteration 37============ [2021-08-27 14:11:33,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 77 transitions. [2021-08-27 14:11:33,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:33,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:33,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:33,972 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [36, 35, 1] [2021-08-27 14:11:33,972 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:33,973 INFO L791 eck$LassoCheckResult]: Stem: 8215#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 8211#L12-2 assume !!(main_~i~0 < main_~j~0); 8212#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8213#L12-2 assume !!(main_~i~0 < main_~j~0); 8214#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8218#L12-2 assume !!(main_~i~0 < main_~j~0); 8285#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8284#L12-2 assume !!(main_~i~0 < main_~j~0); 8283#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8282#L12-2 assume !!(main_~i~0 < main_~j~0); 8281#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8280#L12-2 assume !!(main_~i~0 < main_~j~0); 8279#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8278#L12-2 assume !!(main_~i~0 < main_~j~0); 8277#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8276#L12-2 assume !!(main_~i~0 < main_~j~0); 8275#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8274#L12-2 assume !!(main_~i~0 < main_~j~0); 8273#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8272#L12-2 assume !!(main_~i~0 < main_~j~0); 8271#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8270#L12-2 assume !!(main_~i~0 < main_~j~0); 8269#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8268#L12-2 assume !!(main_~i~0 < main_~j~0); 8267#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8266#L12-2 assume !!(main_~i~0 < main_~j~0); 8265#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8264#L12-2 assume !!(main_~i~0 < main_~j~0); 8263#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8262#L12-2 assume !!(main_~i~0 < main_~j~0); 8261#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8260#L12-2 assume !!(main_~i~0 < main_~j~0); 8259#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8258#L12-2 assume !!(main_~i~0 < main_~j~0); 8257#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8256#L12-2 assume !!(main_~i~0 < main_~j~0); 8255#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8254#L12-2 assume !!(main_~i~0 < main_~j~0); 8253#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8252#L12-2 assume !!(main_~i~0 < main_~j~0); 8251#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8250#L12-2 assume !!(main_~i~0 < main_~j~0); 8249#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8248#L12-2 assume !!(main_~i~0 < main_~j~0); 8247#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8246#L12-2 assume !!(main_~i~0 < main_~j~0); 8245#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8244#L12-2 assume !!(main_~i~0 < main_~j~0); 8243#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8242#L12-2 assume !!(main_~i~0 < main_~j~0); 8241#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8240#L12-2 assume !!(main_~i~0 < main_~j~0); 8239#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8238#L12-2 assume !!(main_~i~0 < main_~j~0); 8237#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8236#L12-2 assume !!(main_~i~0 < main_~j~0); 8235#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8234#L12-2 assume !!(main_~i~0 < main_~j~0); 8233#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8232#L12-2 assume !!(main_~i~0 < main_~j~0); 8231#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8230#L12-2 assume !!(main_~i~0 < main_~j~0); 8229#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8228#L12-2 assume !!(main_~i~0 < main_~j~0); 8227#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8226#L12-2 assume !!(main_~i~0 < main_~j~0); 8225#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8224#L12-2 assume !!(main_~i~0 < main_~j~0); 8222#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8221#L12-2 assume !!(main_~i~0 < main_~j~0); 8220#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8219#L12-2 assume !!(main_~i~0 < main_~j~0); 8216#L12 [2021-08-27 14:11:33,973 INFO L793 eck$LassoCheckResult]: Loop: 8216#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 8217#L12-2 assume !!(main_~i~0 < main_~j~0); 8220#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8219#L12-2 assume !!(main_~i~0 < main_~j~0); 8216#L12 [2021-08-27 14:11:33,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:33,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1000323295, now seen corresponding path program 35 times [2021-08-27 14:11:33,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:33,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976236116] [2021-08-27 14:11:33,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:33,974 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:33,986 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:33,994 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:33,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:33,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 33 times [2021-08-27 14:11:33,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:33,995 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568865321] [2021-08-27 14:11:33,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:33,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:33,998 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:33,999 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:33,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:33,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2126301017, now seen corresponding path program 35 times [2021-08-27 14:11:33,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:33,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878560807] [2021-08-27 14:11:33,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:33,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 108 proven. 1260 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:34,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:34,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878560807] [2021-08-27 14:11:34,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878560807] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:34,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777008005] [2021-08-27 14:11:34,558 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 14:11:34,558 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:34,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:34,559 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:34,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2021-08-27 14:11:35,104 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2021-08-27 14:11:35,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:35,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 37 conjunts are in the unsatisfiable core [2021-08-27 14:11:35,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 108 proven. 1260 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:35,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777008005] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:35,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:35,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2021-08-27 14:11:35,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200027956] [2021-08-27 14:11:35,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:35,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-08-27 14:11:35,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2021-08-27 14:11:35,339 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. cyclomatic complexity: 3 Second operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:35,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:35,418 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2021-08-27 14:11:35,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-27 14:11:35,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 81 transitions. [2021-08-27 14:11:35,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:35,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 78 states and 80 transitions. [2021-08-27 14:11:35,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:35,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:35,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 80 transitions. [2021-08-27 14:11:35,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:35,419 INFO L681 BuchiCegarLoop]: Abstraction has 78 states and 80 transitions. [2021-08-27 14:11:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 80 transitions. [2021-08-27 14:11:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2021-08-27 14:11:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.025974025974026) internal successors, (79), 76 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2021-08-27 14:11:35,421 INFO L704 BuchiCegarLoop]: Abstraction has 77 states and 79 transitions. [2021-08-27 14:11:35,421 INFO L587 BuchiCegarLoop]: Abstraction has 77 states and 79 transitions. [2021-08-27 14:11:35,421 INFO L425 BuchiCegarLoop]: ======== Iteration 38============ [2021-08-27 14:11:35,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 79 transitions. [2021-08-27 14:11:35,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:35,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:35,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:35,423 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [37, 36, 1] [2021-08-27 14:11:35,423 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:35,423 INFO L791 eck$LassoCheckResult]: Stem: 8637#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 8633#L12-2 assume !!(main_~i~0 < main_~j~0); 8634#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8635#L12-2 assume !!(main_~i~0 < main_~j~0); 8636#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8640#L12-2 assume !!(main_~i~0 < main_~j~0); 8709#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8708#L12-2 assume !!(main_~i~0 < main_~j~0); 8707#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8706#L12-2 assume !!(main_~i~0 < main_~j~0); 8705#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8704#L12-2 assume !!(main_~i~0 < main_~j~0); 8703#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8702#L12-2 assume !!(main_~i~0 < main_~j~0); 8701#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8700#L12-2 assume !!(main_~i~0 < main_~j~0); 8699#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8698#L12-2 assume !!(main_~i~0 < main_~j~0); 8697#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8696#L12-2 assume !!(main_~i~0 < main_~j~0); 8695#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8694#L12-2 assume !!(main_~i~0 < main_~j~0); 8693#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8692#L12-2 assume !!(main_~i~0 < main_~j~0); 8691#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8690#L12-2 assume !!(main_~i~0 < main_~j~0); 8689#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8688#L12-2 assume !!(main_~i~0 < main_~j~0); 8687#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8686#L12-2 assume !!(main_~i~0 < main_~j~0); 8685#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8684#L12-2 assume !!(main_~i~0 < main_~j~0); 8683#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8682#L12-2 assume !!(main_~i~0 < main_~j~0); 8681#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8680#L12-2 assume !!(main_~i~0 < main_~j~0); 8679#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8678#L12-2 assume !!(main_~i~0 < main_~j~0); 8677#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8676#L12-2 assume !!(main_~i~0 < main_~j~0); 8675#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8674#L12-2 assume !!(main_~i~0 < main_~j~0); 8673#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8672#L12-2 assume !!(main_~i~0 < main_~j~0); 8671#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8670#L12-2 assume !!(main_~i~0 < main_~j~0); 8669#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8668#L12-2 assume !!(main_~i~0 < main_~j~0); 8667#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8666#L12-2 assume !!(main_~i~0 < main_~j~0); 8665#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8664#L12-2 assume !!(main_~i~0 < main_~j~0); 8663#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8662#L12-2 assume !!(main_~i~0 < main_~j~0); 8661#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8660#L12-2 assume !!(main_~i~0 < main_~j~0); 8659#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8658#L12-2 assume !!(main_~i~0 < main_~j~0); 8657#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8656#L12-2 assume !!(main_~i~0 < main_~j~0); 8655#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8654#L12-2 assume !!(main_~i~0 < main_~j~0); 8653#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8652#L12-2 assume !!(main_~i~0 < main_~j~0); 8651#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8650#L12-2 assume !!(main_~i~0 < main_~j~0); 8649#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8648#L12-2 assume !!(main_~i~0 < main_~j~0); 8647#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8646#L12-2 assume !!(main_~i~0 < main_~j~0); 8644#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8643#L12-2 assume !!(main_~i~0 < main_~j~0); 8642#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8641#L12-2 assume !!(main_~i~0 < main_~j~0); 8638#L12 [2021-08-27 14:11:35,423 INFO L793 eck$LassoCheckResult]: Loop: 8638#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 8639#L12-2 assume !!(main_~i~0 < main_~j~0); 8642#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8641#L12-2 assume !!(main_~i~0 < main_~j~0); 8638#L12 [2021-08-27 14:11:35,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:35,424 INFO L82 PathProgramCache]: Analyzing trace with hash 761988222, now seen corresponding path program 36 times [2021-08-27 14:11:35,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:35,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500645838] [2021-08-27 14:11:35,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:35,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:35,435 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:35,443 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:35,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 34 times [2021-08-27 14:11:35,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:35,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815128004] [2021-08-27 14:11:35,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:35,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:35,447 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:35,448 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:35,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:35,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1086353866, now seen corresponding path program 36 times [2021-08-27 14:11:35,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:35,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342285078] [2021-08-27 14:11:35,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:35,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 111 proven. 1332 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:36,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:36,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342285078] [2021-08-27 14:11:36,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342285078] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:36,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639395391] [2021-08-27 14:11:36,039 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 14:11:36,039 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:36,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:36,040 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:36,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2021-08-27 14:11:36,615 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2021-08-27 14:11:36,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:36,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 38 conjunts are in the unsatisfiable core [2021-08-27 14:11:36,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 111 proven. 1332 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:36,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639395391] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:36,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:36,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2021-08-27 14:11:36,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605040481] [2021-08-27 14:11:36,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:36,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-08-27 14:11:36,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2021-08-27 14:11:36,860 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. cyclomatic complexity: 3 Second operand has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:36,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:36,927 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2021-08-27 14:11:36,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-08-27 14:11:36,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 83 transitions. [2021-08-27 14:11:36,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:36,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 80 states and 82 transitions. [2021-08-27 14:11:36,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:36,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:36,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 82 transitions. [2021-08-27 14:11:36,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:36,929 INFO L681 BuchiCegarLoop]: Abstraction has 80 states and 82 transitions. [2021-08-27 14:11:36,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 82 transitions. [2021-08-27 14:11:36,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2021-08-27 14:11:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 78 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:36,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2021-08-27 14:11:36,930 INFO L704 BuchiCegarLoop]: Abstraction has 79 states and 81 transitions. [2021-08-27 14:11:36,930 INFO L587 BuchiCegarLoop]: Abstraction has 79 states and 81 transitions. [2021-08-27 14:11:36,930 INFO L425 BuchiCegarLoop]: ======== Iteration 39============ [2021-08-27 14:11:36,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 81 transitions. [2021-08-27 14:11:36,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:36,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:36,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:36,931 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [38, 37, 1] [2021-08-27 14:11:36,931 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:36,931 INFO L791 eck$LassoCheckResult]: Stem: 9070#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 9066#L12-2 assume !!(main_~i~0 < main_~j~0); 9067#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9068#L12-2 assume !!(main_~i~0 < main_~j~0); 9069#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9073#L12-2 assume !!(main_~i~0 < main_~j~0); 9144#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9143#L12-2 assume !!(main_~i~0 < main_~j~0); 9142#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9141#L12-2 assume !!(main_~i~0 < main_~j~0); 9140#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9139#L12-2 assume !!(main_~i~0 < main_~j~0); 9138#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9137#L12-2 assume !!(main_~i~0 < main_~j~0); 9136#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9135#L12-2 assume !!(main_~i~0 < main_~j~0); 9134#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9133#L12-2 assume !!(main_~i~0 < main_~j~0); 9132#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9131#L12-2 assume !!(main_~i~0 < main_~j~0); 9130#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9129#L12-2 assume !!(main_~i~0 < main_~j~0); 9128#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9127#L12-2 assume !!(main_~i~0 < main_~j~0); 9126#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9125#L12-2 assume !!(main_~i~0 < main_~j~0); 9124#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9123#L12-2 assume !!(main_~i~0 < main_~j~0); 9122#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9121#L12-2 assume !!(main_~i~0 < main_~j~0); 9120#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9119#L12-2 assume !!(main_~i~0 < main_~j~0); 9118#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9117#L12-2 assume !!(main_~i~0 < main_~j~0); 9116#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9115#L12-2 assume !!(main_~i~0 < main_~j~0); 9114#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9113#L12-2 assume !!(main_~i~0 < main_~j~0); 9112#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9111#L12-2 assume !!(main_~i~0 < main_~j~0); 9110#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9109#L12-2 assume !!(main_~i~0 < main_~j~0); 9108#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9107#L12-2 assume !!(main_~i~0 < main_~j~0); 9106#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9105#L12-2 assume !!(main_~i~0 < main_~j~0); 9104#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9103#L12-2 assume !!(main_~i~0 < main_~j~0); 9102#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9101#L12-2 assume !!(main_~i~0 < main_~j~0); 9100#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9099#L12-2 assume !!(main_~i~0 < main_~j~0); 9098#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9097#L12-2 assume !!(main_~i~0 < main_~j~0); 9096#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9095#L12-2 assume !!(main_~i~0 < main_~j~0); 9094#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9093#L12-2 assume !!(main_~i~0 < main_~j~0); 9092#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9091#L12-2 assume !!(main_~i~0 < main_~j~0); 9090#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9089#L12-2 assume !!(main_~i~0 < main_~j~0); 9088#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9087#L12-2 assume !!(main_~i~0 < main_~j~0); 9086#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9085#L12-2 assume !!(main_~i~0 < main_~j~0); 9084#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9083#L12-2 assume !!(main_~i~0 < main_~j~0); 9082#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9081#L12-2 assume !!(main_~i~0 < main_~j~0); 9080#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9079#L12-2 assume !!(main_~i~0 < main_~j~0); 9077#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9076#L12-2 assume !!(main_~i~0 < main_~j~0); 9075#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9074#L12-2 assume !!(main_~i~0 < main_~j~0); 9071#L12 [2021-08-27 14:11:36,931 INFO L793 eck$LassoCheckResult]: Loop: 9071#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 9072#L12-2 assume !!(main_~i~0 < main_~j~0); 9075#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9074#L12-2 assume !!(main_~i~0 < main_~j~0); 9071#L12 [2021-08-27 14:11:36,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:36,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2126241435, now seen corresponding path program 37 times [2021-08-27 14:11:36,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:36,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106213756] [2021-08-27 14:11:36,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:36,932 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:36,942 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:36,950 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:36,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:36,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 35 times [2021-08-27 14:11:36,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:36,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627599072] [2021-08-27 14:11:36,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:36,951 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:36,954 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:36,955 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:36,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:36,955 INFO L82 PathProgramCache]: Analyzing trace with hash -366210605, now seen corresponding path program 37 times [2021-08-27 14:11:36,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:36,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639633045] [2021-08-27 14:11:36,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:36,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 114 proven. 1406 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:37,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:37,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639633045] [2021-08-27 14:11:37,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639633045] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:37,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38746217] [2021-08-27 14:11:37,522 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 14:11:37,522 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:37,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:37,523 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:37,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2021-08-27 14:11:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:38,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 39 conjunts are in the unsatisfiable core [2021-08-27 14:11:38,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 114 proven. 1406 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:38,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38746217] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:38,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:38,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2021-08-27 14:11:38,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149468528] [2021-08-27 14:11:38,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:38,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-08-27 14:11:38,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2021-08-27 14:11:38,447 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. cyclomatic complexity: 3 Second operand has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:38,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:38,515 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2021-08-27 14:11:38,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-08-27 14:11:38,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 85 transitions. [2021-08-27 14:11:38,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:38,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 82 states and 84 transitions. [2021-08-27 14:11:38,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:38,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:38,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 84 transitions. [2021-08-27 14:11:38,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:38,516 INFO L681 BuchiCegarLoop]: Abstraction has 82 states and 84 transitions. [2021-08-27 14:11:38,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 84 transitions. [2021-08-27 14:11:38,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2021-08-27 14:11:38,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.0246913580246915) internal successors, (83), 80 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2021-08-27 14:11:38,517 INFO L704 BuchiCegarLoop]: Abstraction has 81 states and 83 transitions. [2021-08-27 14:11:38,517 INFO L587 BuchiCegarLoop]: Abstraction has 81 states and 83 transitions. [2021-08-27 14:11:38,517 INFO L425 BuchiCegarLoop]: ======== Iteration 40============ [2021-08-27 14:11:38,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 83 transitions. [2021-08-27 14:11:38,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:38,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:38,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:38,518 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [39, 38, 1] [2021-08-27 14:11:38,518 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:38,519 INFO L791 eck$LassoCheckResult]: Stem: 9514#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 9510#L12-2 assume !!(main_~i~0 < main_~j~0); 9511#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9512#L12-2 assume !!(main_~i~0 < main_~j~0); 9513#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9517#L12-2 assume !!(main_~i~0 < main_~j~0); 9590#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9589#L12-2 assume !!(main_~i~0 < main_~j~0); 9588#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9587#L12-2 assume !!(main_~i~0 < main_~j~0); 9586#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9585#L12-2 assume !!(main_~i~0 < main_~j~0); 9584#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9583#L12-2 assume !!(main_~i~0 < main_~j~0); 9582#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9581#L12-2 assume !!(main_~i~0 < main_~j~0); 9580#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9579#L12-2 assume !!(main_~i~0 < main_~j~0); 9578#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9577#L12-2 assume !!(main_~i~0 < main_~j~0); 9576#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9575#L12-2 assume !!(main_~i~0 < main_~j~0); 9574#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9573#L12-2 assume !!(main_~i~0 < main_~j~0); 9572#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9571#L12-2 assume !!(main_~i~0 < main_~j~0); 9570#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9569#L12-2 assume !!(main_~i~0 < main_~j~0); 9568#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9567#L12-2 assume !!(main_~i~0 < main_~j~0); 9566#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9565#L12-2 assume !!(main_~i~0 < main_~j~0); 9564#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9563#L12-2 assume !!(main_~i~0 < main_~j~0); 9562#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9561#L12-2 assume !!(main_~i~0 < main_~j~0); 9560#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9559#L12-2 assume !!(main_~i~0 < main_~j~0); 9558#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9557#L12-2 assume !!(main_~i~0 < main_~j~0); 9556#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9555#L12-2 assume !!(main_~i~0 < main_~j~0); 9554#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9553#L12-2 assume !!(main_~i~0 < main_~j~0); 9552#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9551#L12-2 assume !!(main_~i~0 < main_~j~0); 9550#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9549#L12-2 assume !!(main_~i~0 < main_~j~0); 9548#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9547#L12-2 assume !!(main_~i~0 < main_~j~0); 9546#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9545#L12-2 assume !!(main_~i~0 < main_~j~0); 9544#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9543#L12-2 assume !!(main_~i~0 < main_~j~0); 9542#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9541#L12-2 assume !!(main_~i~0 < main_~j~0); 9540#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9539#L12-2 assume !!(main_~i~0 < main_~j~0); 9538#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9537#L12-2 assume !!(main_~i~0 < main_~j~0); 9536#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9535#L12-2 assume !!(main_~i~0 < main_~j~0); 9534#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9533#L12-2 assume !!(main_~i~0 < main_~j~0); 9532#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9531#L12-2 assume !!(main_~i~0 < main_~j~0); 9530#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9529#L12-2 assume !!(main_~i~0 < main_~j~0); 9528#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9527#L12-2 assume !!(main_~i~0 < main_~j~0); 9526#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9525#L12-2 assume !!(main_~i~0 < main_~j~0); 9524#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9523#L12-2 assume !!(main_~i~0 < main_~j~0); 9521#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9520#L12-2 assume !!(main_~i~0 < main_~j~0); 9519#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9518#L12-2 assume !!(main_~i~0 < main_~j~0); 9515#L12 [2021-08-27 14:11:38,519 INFO L793 eck$LassoCheckResult]: Loop: 9515#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 9516#L12-2 assume !!(main_~i~0 < main_~j~0); 9519#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9518#L12-2 assume !!(main_~i~0 < main_~j~0); 9515#L12 [2021-08-27 14:11:38,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:38,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1086413448, now seen corresponding path program 38 times [2021-08-27 14:11:38,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:38,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083222041] [2021-08-27 14:11:38,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:38,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:38,529 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:38,538 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:38,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:38,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 36 times [2021-08-27 14:11:38,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:38,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619210282] [2021-08-27 14:11:38,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:38,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:38,542 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:38,543 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:38,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:38,543 INFO L82 PathProgramCache]: Analyzing trace with hash 201728560, now seen corresponding path program 38 times [2021-08-27 14:11:38,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:38,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769520325] [2021-08-27 14:11:38,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:38,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:39,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 117 proven. 1482 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:39,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:39,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769520325] [2021-08-27 14:11:39,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769520325] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:39,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520071681] [2021-08-27 14:11:39,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:11:39,172 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:39,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:39,173 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:39,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2021-08-27 14:11:39,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 14:11:39,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:39,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 40 conjunts are in the unsatisfiable core [2021-08-27 14:11:39,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 117 proven. 1482 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:40,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520071681] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:40,022 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:40,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2021-08-27 14:11:40,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215807097] [2021-08-27 14:11:40,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:40,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-08-27 14:11:40,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2021-08-27 14:11:40,059 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. cyclomatic complexity: 3 Second operand has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:40,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:40,132 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2021-08-27 14:11:40,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-08-27 14:11:40,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 87 transitions. [2021-08-27 14:11:40,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:40,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 84 states and 86 transitions. [2021-08-27 14:11:40,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:40,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:40,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 86 transitions. [2021-08-27 14:11:40,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:40,134 INFO L681 BuchiCegarLoop]: Abstraction has 84 states and 86 transitions. [2021-08-27 14:11:40,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 86 transitions. [2021-08-27 14:11:40,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2021-08-27 14:11:40,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 82 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2021-08-27 14:11:40,135 INFO L704 BuchiCegarLoop]: Abstraction has 83 states and 85 transitions. [2021-08-27 14:11:40,135 INFO L587 BuchiCegarLoop]: Abstraction has 83 states and 85 transitions. [2021-08-27 14:11:40,135 INFO L425 BuchiCegarLoop]: ======== Iteration 41============ [2021-08-27 14:11:40,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 85 transitions. [2021-08-27 14:11:40,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:40,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:40,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:40,136 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [40, 39, 1] [2021-08-27 14:11:40,136 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:40,137 INFO L791 eck$LassoCheckResult]: Stem: 9969#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 9965#L12-2 assume !!(main_~i~0 < main_~j~0); 9966#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9967#L12-2 assume !!(main_~i~0 < main_~j~0); 9968#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9972#L12-2 assume !!(main_~i~0 < main_~j~0); 10047#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10046#L12-2 assume !!(main_~i~0 < main_~j~0); 10045#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10044#L12-2 assume !!(main_~i~0 < main_~j~0); 10043#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10042#L12-2 assume !!(main_~i~0 < main_~j~0); 10041#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10040#L12-2 assume !!(main_~i~0 < main_~j~0); 10039#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10038#L12-2 assume !!(main_~i~0 < main_~j~0); 10037#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10036#L12-2 assume !!(main_~i~0 < main_~j~0); 10035#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10034#L12-2 assume !!(main_~i~0 < main_~j~0); 10033#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10032#L12-2 assume !!(main_~i~0 < main_~j~0); 10031#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10030#L12-2 assume !!(main_~i~0 < main_~j~0); 10029#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10028#L12-2 assume !!(main_~i~0 < main_~j~0); 10027#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10026#L12-2 assume !!(main_~i~0 < main_~j~0); 10025#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10024#L12-2 assume !!(main_~i~0 < main_~j~0); 10023#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10022#L12-2 assume !!(main_~i~0 < main_~j~0); 10021#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10020#L12-2 assume !!(main_~i~0 < main_~j~0); 10019#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10018#L12-2 assume !!(main_~i~0 < main_~j~0); 10017#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10016#L12-2 assume !!(main_~i~0 < main_~j~0); 10015#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10014#L12-2 assume !!(main_~i~0 < main_~j~0); 10013#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10012#L12-2 assume !!(main_~i~0 < main_~j~0); 10011#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10010#L12-2 assume !!(main_~i~0 < main_~j~0); 10009#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10008#L12-2 assume !!(main_~i~0 < main_~j~0); 10007#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10006#L12-2 assume !!(main_~i~0 < main_~j~0); 10005#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10004#L12-2 assume !!(main_~i~0 < main_~j~0); 10003#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10002#L12-2 assume !!(main_~i~0 < main_~j~0); 10001#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10000#L12-2 assume !!(main_~i~0 < main_~j~0); 9999#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9998#L12-2 assume !!(main_~i~0 < main_~j~0); 9997#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9996#L12-2 assume !!(main_~i~0 < main_~j~0); 9995#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9994#L12-2 assume !!(main_~i~0 < main_~j~0); 9993#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9992#L12-2 assume !!(main_~i~0 < main_~j~0); 9991#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9990#L12-2 assume !!(main_~i~0 < main_~j~0); 9989#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9988#L12-2 assume !!(main_~i~0 < main_~j~0); 9987#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9986#L12-2 assume !!(main_~i~0 < main_~j~0); 9985#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9984#L12-2 assume !!(main_~i~0 < main_~j~0); 9983#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9982#L12-2 assume !!(main_~i~0 < main_~j~0); 9981#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9980#L12-2 assume !!(main_~i~0 < main_~j~0); 9979#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9978#L12-2 assume !!(main_~i~0 < main_~j~0); 9976#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9975#L12-2 assume !!(main_~i~0 < main_~j~0); 9974#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9973#L12-2 assume !!(main_~i~0 < main_~j~0); 9970#L12 [2021-08-27 14:11:40,137 INFO L793 eck$LassoCheckResult]: Loop: 9970#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 9971#L12-2 assume !!(main_~i~0 < main_~j~0); 9974#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9973#L12-2 assume !!(main_~i~0 < main_~j~0); 9970#L12 [2021-08-27 14:11:40,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:40,137 INFO L82 PathProgramCache]: Analyzing trace with hash -366270187, now seen corresponding path program 39 times [2021-08-27 14:11:40,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:40,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128841998] [2021-08-27 14:11:40,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:40,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:40,148 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:40,158 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:40,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:40,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 37 times [2021-08-27 14:11:40,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:40,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163746124] [2021-08-27 14:11:40,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:40,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:40,163 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:40,164 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:40,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:40,183 INFO L82 PathProgramCache]: Analyzing trace with hash 530419533, now seen corresponding path program 39 times [2021-08-27 14:11:40,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:40,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926783190] [2021-08-27 14:11:40,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:40,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:40,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 120 proven. 1560 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:40,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:40,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926783190] [2021-08-27 14:11:40,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926783190] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:40,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110902847] [2021-08-27 14:11:40,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 14:11:40,818 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:40,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:40,819 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:40,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2021-08-27 14:11:41,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2021-08-27 14:11:41,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:41,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 41 conjunts are in the unsatisfiable core [2021-08-27 14:11:41,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 120 proven. 1560 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:41,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110902847] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:41,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:41,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2021-08-27 14:11:41,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142177443] [2021-08-27 14:11:41,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:41,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-08-27 14:11:41,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2021-08-27 14:11:41,730 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. cyclomatic complexity: 3 Second operand has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:41,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:41,819 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2021-08-27 14:11:41,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-08-27 14:11:41,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 89 transitions. [2021-08-27 14:11:41,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:41,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 86 states and 88 transitions. [2021-08-27 14:11:41,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:41,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:41,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 88 transitions. [2021-08-27 14:11:41,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:41,821 INFO L681 BuchiCegarLoop]: Abstraction has 86 states and 88 transitions. [2021-08-27 14:11:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 88 transitions. [2021-08-27 14:11:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2021-08-27 14:11:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 84 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:41,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2021-08-27 14:11:41,822 INFO L704 BuchiCegarLoop]: Abstraction has 85 states and 87 transitions. [2021-08-27 14:11:41,822 INFO L587 BuchiCegarLoop]: Abstraction has 85 states and 87 transitions. [2021-08-27 14:11:41,822 INFO L425 BuchiCegarLoop]: ======== Iteration 42============ [2021-08-27 14:11:41,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 87 transitions. [2021-08-27 14:11:41,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:41,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:41,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:41,823 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [41, 40, 1] [2021-08-27 14:11:41,823 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:41,824 INFO L791 eck$LassoCheckResult]: Stem: 10435#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 10431#L12-2 assume !!(main_~i~0 < main_~j~0); 10432#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10433#L12-2 assume !!(main_~i~0 < main_~j~0); 10434#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10438#L12-2 assume !!(main_~i~0 < main_~j~0); 10515#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10514#L12-2 assume !!(main_~i~0 < main_~j~0); 10513#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10512#L12-2 assume !!(main_~i~0 < main_~j~0); 10511#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10510#L12-2 assume !!(main_~i~0 < main_~j~0); 10509#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10508#L12-2 assume !!(main_~i~0 < main_~j~0); 10507#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10506#L12-2 assume !!(main_~i~0 < main_~j~0); 10505#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10504#L12-2 assume !!(main_~i~0 < main_~j~0); 10503#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10502#L12-2 assume !!(main_~i~0 < main_~j~0); 10501#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10500#L12-2 assume !!(main_~i~0 < main_~j~0); 10499#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10498#L12-2 assume !!(main_~i~0 < main_~j~0); 10497#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10496#L12-2 assume !!(main_~i~0 < main_~j~0); 10495#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10494#L12-2 assume !!(main_~i~0 < main_~j~0); 10493#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10492#L12-2 assume !!(main_~i~0 < main_~j~0); 10491#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10490#L12-2 assume !!(main_~i~0 < main_~j~0); 10489#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10488#L12-2 assume !!(main_~i~0 < main_~j~0); 10487#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10486#L12-2 assume !!(main_~i~0 < main_~j~0); 10485#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10484#L12-2 assume !!(main_~i~0 < main_~j~0); 10483#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10482#L12-2 assume !!(main_~i~0 < main_~j~0); 10481#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10480#L12-2 assume !!(main_~i~0 < main_~j~0); 10479#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10478#L12-2 assume !!(main_~i~0 < main_~j~0); 10477#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10476#L12-2 assume !!(main_~i~0 < main_~j~0); 10475#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10474#L12-2 assume !!(main_~i~0 < main_~j~0); 10473#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10472#L12-2 assume !!(main_~i~0 < main_~j~0); 10471#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10470#L12-2 assume !!(main_~i~0 < main_~j~0); 10469#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10468#L12-2 assume !!(main_~i~0 < main_~j~0); 10467#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10466#L12-2 assume !!(main_~i~0 < main_~j~0); 10465#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10464#L12-2 assume !!(main_~i~0 < main_~j~0); 10463#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10462#L12-2 assume !!(main_~i~0 < main_~j~0); 10461#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10460#L12-2 assume !!(main_~i~0 < main_~j~0); 10459#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10458#L12-2 assume !!(main_~i~0 < main_~j~0); 10457#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10456#L12-2 assume !!(main_~i~0 < main_~j~0); 10455#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10454#L12-2 assume !!(main_~i~0 < main_~j~0); 10453#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10452#L12-2 assume !!(main_~i~0 < main_~j~0); 10451#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10450#L12-2 assume !!(main_~i~0 < main_~j~0); 10449#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10448#L12-2 assume !!(main_~i~0 < main_~j~0); 10447#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10446#L12-2 assume !!(main_~i~0 < main_~j~0); 10445#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10444#L12-2 assume !!(main_~i~0 < main_~j~0); 10442#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10441#L12-2 assume !!(main_~i~0 < main_~j~0); 10440#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10439#L12-2 assume !!(main_~i~0 < main_~j~0); 10436#L12 [2021-08-27 14:11:41,824 INFO L793 eck$LassoCheckResult]: Loop: 10436#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 10437#L12-2 assume !!(main_~i~0 < main_~j~0); 10440#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10439#L12-2 assume !!(main_~i~0 < main_~j~0); 10436#L12 [2021-08-27 14:11:41,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:41,824 INFO L82 PathProgramCache]: Analyzing trace with hash 201668978, now seen corresponding path program 40 times [2021-08-27 14:11:41,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:41,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391853793] [2021-08-27 14:11:41,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:41,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:41,835 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:41,844 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:41,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:41,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 38 times [2021-08-27 14:11:41,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:41,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365583611] [2021-08-27 14:11:41,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:41,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:41,848 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:41,849 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:41,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:41,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1425135318, now seen corresponding path program 40 times [2021-08-27 14:11:41,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:41,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943015645] [2021-08-27 14:11:41,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:41,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:42,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 123 proven. 1640 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:42,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:42,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943015645] [2021-08-27 14:11:42,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943015645] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:42,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514667548] [2021-08-27 14:11:42,503 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 14:11:42,503 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:42,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:42,504 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:42,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2021-08-27 14:11:43,293 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 14:11:43,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:43,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 42 conjunts are in the unsatisfiable core [2021-08-27 14:11:43,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 123 proven. 1640 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:43,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514667548] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:43,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:43,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2021-08-27 14:11:43,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729170454] [2021-08-27 14:11:43,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:43,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-08-27 14:11:43,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2021-08-27 14:11:43,560 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. cyclomatic complexity: 3 Second operand has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:43,636 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2021-08-27 14:11:43,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-08-27 14:11:43,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 91 transitions. [2021-08-27 14:11:43,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:43,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 88 states and 90 transitions. [2021-08-27 14:11:43,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:43,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:43,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 90 transitions. [2021-08-27 14:11:43,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:43,637 INFO L681 BuchiCegarLoop]: Abstraction has 88 states and 90 transitions. [2021-08-27 14:11:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 90 transitions. [2021-08-27 14:11:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2021-08-27 14:11:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 86 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2021-08-27 14:11:43,638 INFO L704 BuchiCegarLoop]: Abstraction has 87 states and 89 transitions. [2021-08-27 14:11:43,638 INFO L587 BuchiCegarLoop]: Abstraction has 87 states and 89 transitions. [2021-08-27 14:11:43,638 INFO L425 BuchiCegarLoop]: ======== Iteration 43============ [2021-08-27 14:11:43,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 89 transitions. [2021-08-27 14:11:43,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:43,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:43,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:43,639 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [42, 41, 1] [2021-08-27 14:11:43,639 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:43,640 INFO L791 eck$LassoCheckResult]: Stem: 10912#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 10908#L12-2 assume !!(main_~i~0 < main_~j~0); 10909#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10910#L12-2 assume !!(main_~i~0 < main_~j~0); 10911#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10915#L12-2 assume !!(main_~i~0 < main_~j~0); 10994#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10993#L12-2 assume !!(main_~i~0 < main_~j~0); 10992#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10991#L12-2 assume !!(main_~i~0 < main_~j~0); 10990#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10989#L12-2 assume !!(main_~i~0 < main_~j~0); 10988#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10987#L12-2 assume !!(main_~i~0 < main_~j~0); 10986#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10985#L12-2 assume !!(main_~i~0 < main_~j~0); 10984#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10983#L12-2 assume !!(main_~i~0 < main_~j~0); 10982#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10981#L12-2 assume !!(main_~i~0 < main_~j~0); 10980#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10979#L12-2 assume !!(main_~i~0 < main_~j~0); 10978#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10977#L12-2 assume !!(main_~i~0 < main_~j~0); 10976#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10975#L12-2 assume !!(main_~i~0 < main_~j~0); 10974#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10973#L12-2 assume !!(main_~i~0 < main_~j~0); 10972#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10971#L12-2 assume !!(main_~i~0 < main_~j~0); 10970#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10969#L12-2 assume !!(main_~i~0 < main_~j~0); 10968#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10967#L12-2 assume !!(main_~i~0 < main_~j~0); 10966#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10965#L12-2 assume !!(main_~i~0 < main_~j~0); 10964#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10963#L12-2 assume !!(main_~i~0 < main_~j~0); 10962#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10961#L12-2 assume !!(main_~i~0 < main_~j~0); 10960#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10959#L12-2 assume !!(main_~i~0 < main_~j~0); 10958#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10957#L12-2 assume !!(main_~i~0 < main_~j~0); 10956#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10955#L12-2 assume !!(main_~i~0 < main_~j~0); 10954#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10953#L12-2 assume !!(main_~i~0 < main_~j~0); 10952#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10951#L12-2 assume !!(main_~i~0 < main_~j~0); 10950#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10949#L12-2 assume !!(main_~i~0 < main_~j~0); 10948#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10947#L12-2 assume !!(main_~i~0 < main_~j~0); 10946#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10945#L12-2 assume !!(main_~i~0 < main_~j~0); 10944#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10943#L12-2 assume !!(main_~i~0 < main_~j~0); 10942#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10941#L12-2 assume !!(main_~i~0 < main_~j~0); 10940#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10939#L12-2 assume !!(main_~i~0 < main_~j~0); 10938#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10937#L12-2 assume !!(main_~i~0 < main_~j~0); 10936#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10935#L12-2 assume !!(main_~i~0 < main_~j~0); 10934#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10933#L12-2 assume !!(main_~i~0 < main_~j~0); 10932#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10931#L12-2 assume !!(main_~i~0 < main_~j~0); 10930#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10929#L12-2 assume !!(main_~i~0 < main_~j~0); 10928#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10927#L12-2 assume !!(main_~i~0 < main_~j~0); 10926#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10925#L12-2 assume !!(main_~i~0 < main_~j~0); 10924#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10923#L12-2 assume !!(main_~i~0 < main_~j~0); 10922#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10921#L12-2 assume !!(main_~i~0 < main_~j~0); 10919#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10918#L12-2 assume !!(main_~i~0 < main_~j~0); 10917#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10916#L12-2 assume !!(main_~i~0 < main_~j~0); 10913#L12 [2021-08-27 14:11:43,640 INFO L793 eck$LassoCheckResult]: Loop: 10913#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 10914#L12-2 assume !!(main_~i~0 < main_~j~0); 10917#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10916#L12-2 assume !!(main_~i~0 < main_~j~0); 10913#L12 [2021-08-27 14:11:43,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:43,640 INFO L82 PathProgramCache]: Analyzing trace with hash 530359951, now seen corresponding path program 41 times [2021-08-27 14:11:43,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:43,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549753123] [2021-08-27 14:11:43,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:43,641 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:43,651 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:43,660 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:43,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 39 times [2021-08-27 14:11:43,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:43,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379171543] [2021-08-27 14:11:43,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:43,661 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:43,664 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:43,665 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:43,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:43,665 INFO L82 PathProgramCache]: Analyzing trace with hash 482328519, now seen corresponding path program 41 times [2021-08-27 14:11:43,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:43,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229404897] [2021-08-27 14:11:43,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:43,665 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 126 proven. 1722 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:44,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:44,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229404897] [2021-08-27 14:11:44,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229404897] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:44,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625359822] [2021-08-27 14:11:44,375 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 14:11:44,375 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:44,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:44,376 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:44,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2021-08-27 14:11:45,103 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 44 check-sat command(s) [2021-08-27 14:11:45,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:45,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 43 conjunts are in the unsatisfiable core [2021-08-27 14:11:45,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 126 proven. 1722 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:45,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625359822] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:45,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:45,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2021-08-27 14:11:45,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295844485] [2021-08-27 14:11:45,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:45,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-08-27 14:11:45,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2021-08-27 14:11:45,375 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. cyclomatic complexity: 3 Second operand has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:45,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:45,463 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2021-08-27 14:11:45,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-08-27 14:11:45,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 93 transitions. [2021-08-27 14:11:45,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:45,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 90 states and 92 transitions. [2021-08-27 14:11:45,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:45,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:45,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 92 transitions. [2021-08-27 14:11:45,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:45,465 INFO L681 BuchiCegarLoop]: Abstraction has 90 states and 92 transitions. [2021-08-27 14:11:45,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 92 transitions. [2021-08-27 14:11:45,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2021-08-27 14:11:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 88 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:45,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2021-08-27 14:11:45,467 INFO L704 BuchiCegarLoop]: Abstraction has 89 states and 91 transitions. [2021-08-27 14:11:45,467 INFO L587 BuchiCegarLoop]: Abstraction has 89 states and 91 transitions. [2021-08-27 14:11:45,467 INFO L425 BuchiCegarLoop]: ======== Iteration 44============ [2021-08-27 14:11:45,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 91 transitions. [2021-08-27 14:11:45,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:45,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:45,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:45,468 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [43, 42, 1] [2021-08-27 14:11:45,468 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:45,468 INFO L791 eck$LassoCheckResult]: Stem: 11400#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 11396#L12-2 assume !!(main_~i~0 < main_~j~0); 11397#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11398#L12-2 assume !!(main_~i~0 < main_~j~0); 11399#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11403#L12-2 assume !!(main_~i~0 < main_~j~0); 11484#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11483#L12-2 assume !!(main_~i~0 < main_~j~0); 11482#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11481#L12-2 assume !!(main_~i~0 < main_~j~0); 11480#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11479#L12-2 assume !!(main_~i~0 < main_~j~0); 11478#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11477#L12-2 assume !!(main_~i~0 < main_~j~0); 11476#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11475#L12-2 assume !!(main_~i~0 < main_~j~0); 11474#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11473#L12-2 assume !!(main_~i~0 < main_~j~0); 11472#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11471#L12-2 assume !!(main_~i~0 < main_~j~0); 11470#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11469#L12-2 assume !!(main_~i~0 < main_~j~0); 11468#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11467#L12-2 assume !!(main_~i~0 < main_~j~0); 11466#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11465#L12-2 assume !!(main_~i~0 < main_~j~0); 11464#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11463#L12-2 assume !!(main_~i~0 < main_~j~0); 11462#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11461#L12-2 assume !!(main_~i~0 < main_~j~0); 11460#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11459#L12-2 assume !!(main_~i~0 < main_~j~0); 11458#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11457#L12-2 assume !!(main_~i~0 < main_~j~0); 11456#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11455#L12-2 assume !!(main_~i~0 < main_~j~0); 11454#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11453#L12-2 assume !!(main_~i~0 < main_~j~0); 11452#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11451#L12-2 assume !!(main_~i~0 < main_~j~0); 11450#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11449#L12-2 assume !!(main_~i~0 < main_~j~0); 11448#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11447#L12-2 assume !!(main_~i~0 < main_~j~0); 11446#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11445#L12-2 assume !!(main_~i~0 < main_~j~0); 11444#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11443#L12-2 assume !!(main_~i~0 < main_~j~0); 11442#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11441#L12-2 assume !!(main_~i~0 < main_~j~0); 11440#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11439#L12-2 assume !!(main_~i~0 < main_~j~0); 11438#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11437#L12-2 assume !!(main_~i~0 < main_~j~0); 11436#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11435#L12-2 assume !!(main_~i~0 < main_~j~0); 11434#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11433#L12-2 assume !!(main_~i~0 < main_~j~0); 11432#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11431#L12-2 assume !!(main_~i~0 < main_~j~0); 11430#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11429#L12-2 assume !!(main_~i~0 < main_~j~0); 11428#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11427#L12-2 assume !!(main_~i~0 < main_~j~0); 11426#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11425#L12-2 assume !!(main_~i~0 < main_~j~0); 11424#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11423#L12-2 assume !!(main_~i~0 < main_~j~0); 11422#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11421#L12-2 assume !!(main_~i~0 < main_~j~0); 11420#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11419#L12-2 assume !!(main_~i~0 < main_~j~0); 11418#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11417#L12-2 assume !!(main_~i~0 < main_~j~0); 11416#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11415#L12-2 assume !!(main_~i~0 < main_~j~0); 11414#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11413#L12-2 assume !!(main_~i~0 < main_~j~0); 11412#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11411#L12-2 assume !!(main_~i~0 < main_~j~0); 11410#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11409#L12-2 assume !!(main_~i~0 < main_~j~0); 11407#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11406#L12-2 assume !!(main_~i~0 < main_~j~0); 11405#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11404#L12-2 assume !!(main_~i~0 < main_~j~0); 11401#L12 [2021-08-27 14:11:45,469 INFO L793 eck$LassoCheckResult]: Loop: 11401#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 11402#L12-2 assume !!(main_~i~0 < main_~j~0); 11405#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11404#L12-2 assume !!(main_~i~0 < main_~j~0); 11401#L12 [2021-08-27 14:11:45,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:45,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1425194900, now seen corresponding path program 42 times [2021-08-27 14:11:45,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:45,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467401028] [2021-08-27 14:11:45,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:45,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:45,485 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:45,500 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:45,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:45,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 40 times [2021-08-27 14:11:45,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:45,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20414676] [2021-08-27 14:11:45,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:45,501 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:45,506 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:45,507 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:45,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:45,507 INFO L82 PathProgramCache]: Analyzing trace with hash -395959516, now seen corresponding path program 42 times [2021-08-27 14:11:45,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:45,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951573510] [2021-08-27 14:11:45,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:45,508 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:46,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 129 proven. 1806 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:46,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:46,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951573510] [2021-08-27 14:11:46,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951573510] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:46,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344950056] [2021-08-27 14:11:46,411 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 14:11:46,411 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:46,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:46,412 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:46,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2021-08-27 14:11:47,165 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 45 check-sat command(s) [2021-08-27 14:11:47,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:47,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 44 conjunts are in the unsatisfiable core [2021-08-27 14:11:47,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:47,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 129 proven. 1806 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:47,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344950056] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:47,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:47,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2021-08-27 14:11:47,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182792934] [2021-08-27 14:11:47,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:47,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-08-27 14:11:47,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2021-08-27 14:11:47,465 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. cyclomatic complexity: 3 Second operand has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:47,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:47,546 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2021-08-27 14:11:47,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-08-27 14:11:47,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 95 transitions. [2021-08-27 14:11:47,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:47,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 92 states and 94 transitions. [2021-08-27 14:11:47,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:47,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:47,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 94 transitions. [2021-08-27 14:11:47,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:47,548 INFO L681 BuchiCegarLoop]: Abstraction has 92 states and 94 transitions. [2021-08-27 14:11:47,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 94 transitions. [2021-08-27 14:11:47,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2021-08-27 14:11:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.021978021978022) internal successors, (93), 90 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:47,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2021-08-27 14:11:47,549 INFO L704 BuchiCegarLoop]: Abstraction has 91 states and 93 transitions. [2021-08-27 14:11:47,549 INFO L587 BuchiCegarLoop]: Abstraction has 91 states and 93 transitions. [2021-08-27 14:11:47,549 INFO L425 BuchiCegarLoop]: ======== Iteration 45============ [2021-08-27 14:11:47,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 93 transitions. [2021-08-27 14:11:47,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:47,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:47,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:47,550 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [44, 43, 1] [2021-08-27 14:11:47,550 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:47,550 INFO L791 eck$LassoCheckResult]: Stem: 11899#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 11895#L12-2 assume !!(main_~i~0 < main_~j~0); 11896#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11897#L12-2 assume !!(main_~i~0 < main_~j~0); 11898#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11902#L12-2 assume !!(main_~i~0 < main_~j~0); 11985#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11984#L12-2 assume !!(main_~i~0 < main_~j~0); 11983#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11982#L12-2 assume !!(main_~i~0 < main_~j~0); 11981#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11980#L12-2 assume !!(main_~i~0 < main_~j~0); 11979#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11978#L12-2 assume !!(main_~i~0 < main_~j~0); 11977#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11976#L12-2 assume !!(main_~i~0 < main_~j~0); 11975#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11974#L12-2 assume !!(main_~i~0 < main_~j~0); 11973#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11972#L12-2 assume !!(main_~i~0 < main_~j~0); 11971#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11970#L12-2 assume !!(main_~i~0 < main_~j~0); 11969#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11968#L12-2 assume !!(main_~i~0 < main_~j~0); 11967#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11966#L12-2 assume !!(main_~i~0 < main_~j~0); 11965#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11964#L12-2 assume !!(main_~i~0 < main_~j~0); 11963#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11962#L12-2 assume !!(main_~i~0 < main_~j~0); 11961#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11960#L12-2 assume !!(main_~i~0 < main_~j~0); 11959#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11958#L12-2 assume !!(main_~i~0 < main_~j~0); 11957#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11956#L12-2 assume !!(main_~i~0 < main_~j~0); 11955#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11954#L12-2 assume !!(main_~i~0 < main_~j~0); 11953#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11952#L12-2 assume !!(main_~i~0 < main_~j~0); 11951#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11950#L12-2 assume !!(main_~i~0 < main_~j~0); 11949#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11948#L12-2 assume !!(main_~i~0 < main_~j~0); 11947#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11946#L12-2 assume !!(main_~i~0 < main_~j~0); 11945#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11944#L12-2 assume !!(main_~i~0 < main_~j~0); 11943#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11942#L12-2 assume !!(main_~i~0 < main_~j~0); 11941#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11940#L12-2 assume !!(main_~i~0 < main_~j~0); 11939#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11938#L12-2 assume !!(main_~i~0 < main_~j~0); 11937#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11936#L12-2 assume !!(main_~i~0 < main_~j~0); 11935#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11934#L12-2 assume !!(main_~i~0 < main_~j~0); 11933#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11932#L12-2 assume !!(main_~i~0 < main_~j~0); 11931#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11930#L12-2 assume !!(main_~i~0 < main_~j~0); 11929#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11928#L12-2 assume !!(main_~i~0 < main_~j~0); 11927#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11926#L12-2 assume !!(main_~i~0 < main_~j~0); 11925#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11924#L12-2 assume !!(main_~i~0 < main_~j~0); 11923#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11922#L12-2 assume !!(main_~i~0 < main_~j~0); 11921#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11920#L12-2 assume !!(main_~i~0 < main_~j~0); 11919#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11918#L12-2 assume !!(main_~i~0 < main_~j~0); 11917#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11916#L12-2 assume !!(main_~i~0 < main_~j~0); 11915#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11914#L12-2 assume !!(main_~i~0 < main_~j~0); 11913#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11912#L12-2 assume !!(main_~i~0 < main_~j~0); 11911#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11910#L12-2 assume !!(main_~i~0 < main_~j~0); 11909#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11908#L12-2 assume !!(main_~i~0 < main_~j~0); 11906#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11905#L12-2 assume !!(main_~i~0 < main_~j~0); 11904#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11903#L12-2 assume !!(main_~i~0 < main_~j~0); 11900#L12 [2021-08-27 14:11:47,550 INFO L793 eck$LassoCheckResult]: Loop: 11900#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 11901#L12-2 assume !!(main_~i~0 < main_~j~0); 11904#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11903#L12-2 assume !!(main_~i~0 < main_~j~0); 11900#L12 [2021-08-27 14:11:47,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:47,550 INFO L82 PathProgramCache]: Analyzing trace with hash 482268937, now seen corresponding path program 43 times [2021-08-27 14:11:47,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:47,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933552168] [2021-08-27 14:11:47,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:47,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:47,562 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:47,573 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:47,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:47,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 41 times [2021-08-27 14:11:47,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:47,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914501174] [2021-08-27 14:11:47,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:47,574 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:47,578 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:47,579 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:47,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:47,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1677796161, now seen corresponding path program 43 times [2021-08-27 14:11:47,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:47,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877160593] [2021-08-27 14:11:47,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:47,580 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:48,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 132 proven. 1892 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:48,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:48,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877160593] [2021-08-27 14:11:48,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877160593] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:48,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209352982] [2021-08-27 14:11:48,362 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 14:11:48,363 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:48,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:48,364 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:48,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2021-08-27 14:11:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:49,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 45 conjunts are in the unsatisfiable core [2021-08-27 14:11:49,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 132 proven. 1892 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:49,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209352982] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:49,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:49,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2021-08-27 14:11:49,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005907281] [2021-08-27 14:11:49,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:49,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-08-27 14:11:49,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2021-08-27 14:11:49,506 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. cyclomatic complexity: 3 Second operand has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:49,599 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2021-08-27 14:11:49,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-08-27 14:11:49,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 97 transitions. [2021-08-27 14:11:49,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:49,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 94 states and 96 transitions. [2021-08-27 14:11:49,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:49,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:49,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 96 transitions. [2021-08-27 14:11:49,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:49,601 INFO L681 BuchiCegarLoop]: Abstraction has 94 states and 96 transitions. [2021-08-27 14:11:49,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 96 transitions. [2021-08-27 14:11:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2021-08-27 14:11:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.021505376344086) internal successors, (95), 92 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2021-08-27 14:11:49,602 INFO L704 BuchiCegarLoop]: Abstraction has 93 states and 95 transitions. [2021-08-27 14:11:49,602 INFO L587 BuchiCegarLoop]: Abstraction has 93 states and 95 transitions. [2021-08-27 14:11:49,602 INFO L425 BuchiCegarLoop]: ======== Iteration 46============ [2021-08-27 14:11:49,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 95 transitions. [2021-08-27 14:11:49,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:49,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:49,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:49,603 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [45, 44, 1] [2021-08-27 14:11:49,603 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:49,603 INFO L791 eck$LassoCheckResult]: Stem: 12409#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 12405#L12-2 assume !!(main_~i~0 < main_~j~0); 12406#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12407#L12-2 assume !!(main_~i~0 < main_~j~0); 12408#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12412#L12-2 assume !!(main_~i~0 < main_~j~0); 12497#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12496#L12-2 assume !!(main_~i~0 < main_~j~0); 12495#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12494#L12-2 assume !!(main_~i~0 < main_~j~0); 12493#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12492#L12-2 assume !!(main_~i~0 < main_~j~0); 12491#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12490#L12-2 assume !!(main_~i~0 < main_~j~0); 12489#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12488#L12-2 assume !!(main_~i~0 < main_~j~0); 12487#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12486#L12-2 assume !!(main_~i~0 < main_~j~0); 12485#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12484#L12-2 assume !!(main_~i~0 < main_~j~0); 12483#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12482#L12-2 assume !!(main_~i~0 < main_~j~0); 12481#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12480#L12-2 assume !!(main_~i~0 < main_~j~0); 12479#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12478#L12-2 assume !!(main_~i~0 < main_~j~0); 12477#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12476#L12-2 assume !!(main_~i~0 < main_~j~0); 12475#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12474#L12-2 assume !!(main_~i~0 < main_~j~0); 12473#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12472#L12-2 assume !!(main_~i~0 < main_~j~0); 12471#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12470#L12-2 assume !!(main_~i~0 < main_~j~0); 12469#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12468#L12-2 assume !!(main_~i~0 < main_~j~0); 12467#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12466#L12-2 assume !!(main_~i~0 < main_~j~0); 12465#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12464#L12-2 assume !!(main_~i~0 < main_~j~0); 12463#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12462#L12-2 assume !!(main_~i~0 < main_~j~0); 12461#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12460#L12-2 assume !!(main_~i~0 < main_~j~0); 12459#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12458#L12-2 assume !!(main_~i~0 < main_~j~0); 12457#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12456#L12-2 assume !!(main_~i~0 < main_~j~0); 12455#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12454#L12-2 assume !!(main_~i~0 < main_~j~0); 12453#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12452#L12-2 assume !!(main_~i~0 < main_~j~0); 12451#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12450#L12-2 assume !!(main_~i~0 < main_~j~0); 12449#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12448#L12-2 assume !!(main_~i~0 < main_~j~0); 12447#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12446#L12-2 assume !!(main_~i~0 < main_~j~0); 12445#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12444#L12-2 assume !!(main_~i~0 < main_~j~0); 12443#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12442#L12-2 assume !!(main_~i~0 < main_~j~0); 12441#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12440#L12-2 assume !!(main_~i~0 < main_~j~0); 12439#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12438#L12-2 assume !!(main_~i~0 < main_~j~0); 12437#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12436#L12-2 assume !!(main_~i~0 < main_~j~0); 12435#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12434#L12-2 assume !!(main_~i~0 < main_~j~0); 12433#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12432#L12-2 assume !!(main_~i~0 < main_~j~0); 12431#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12430#L12-2 assume !!(main_~i~0 < main_~j~0); 12429#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12428#L12-2 assume !!(main_~i~0 < main_~j~0); 12427#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12426#L12-2 assume !!(main_~i~0 < main_~j~0); 12425#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12424#L12-2 assume !!(main_~i~0 < main_~j~0); 12423#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12422#L12-2 assume !!(main_~i~0 < main_~j~0); 12421#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12420#L12-2 assume !!(main_~i~0 < main_~j~0); 12419#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12418#L12-2 assume !!(main_~i~0 < main_~j~0); 12416#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12415#L12-2 assume !!(main_~i~0 < main_~j~0); 12414#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12413#L12-2 assume !!(main_~i~0 < main_~j~0); 12410#L12 [2021-08-27 14:11:49,603 INFO L793 eck$LassoCheckResult]: Loop: 12410#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 12411#L12-2 assume !!(main_~i~0 < main_~j~0); 12414#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12413#L12-2 assume !!(main_~i~0 < main_~j~0); 12410#L12 [2021-08-27 14:11:49,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:49,604 INFO L82 PathProgramCache]: Analyzing trace with hash -396019098, now seen corresponding path program 44 times [2021-08-27 14:11:49,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:49,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372365874] [2021-08-27 14:11:49,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:49,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:49,623 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:49,637 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:49,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:49,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 42 times [2021-08-27 14:11:49,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:49,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851924460] [2021-08-27 14:11:49,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:49,638 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:49,643 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:49,643 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:49,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:49,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1692176414, now seen corresponding path program 44 times [2021-08-27 14:11:49,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:49,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296969289] [2021-08-27 14:11:49,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:49,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 135 proven. 1980 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:50,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:50,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296969289] [2021-08-27 14:11:50,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296969289] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:50,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026234710] [2021-08-27 14:11:50,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:11:50,430 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:50,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:50,435 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:50,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2021-08-27 14:11:51,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 14:11:51,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:51,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 46 conjunts are in the unsatisfiable core [2021-08-27 14:11:51,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:51,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 135 proven. 1980 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:51,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026234710] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:51,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:51,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2021-08-27 14:11:51,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541080648] [2021-08-27 14:11:51,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:51,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-08-27 14:11:51,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2021-08-27 14:11:51,533 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. cyclomatic complexity: 3 Second operand has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:51,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:51,614 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2021-08-27 14:11:51,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-27 14:11:51,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 99 transitions. [2021-08-27 14:11:51,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:51,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 96 states and 98 transitions. [2021-08-27 14:11:51,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:51,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:51,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 98 transitions. [2021-08-27 14:11:51,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:51,615 INFO L681 BuchiCegarLoop]: Abstraction has 96 states and 98 transitions. [2021-08-27 14:11:51,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 98 transitions. [2021-08-27 14:11:51,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2021-08-27 14:11:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 94 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2021-08-27 14:11:51,616 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 97 transitions. [2021-08-27 14:11:51,616 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 97 transitions. [2021-08-27 14:11:51,616 INFO L425 BuchiCegarLoop]: ======== Iteration 47============ [2021-08-27 14:11:51,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 97 transitions. [2021-08-27 14:11:51,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:51,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:51,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:51,617 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [46, 45, 1] [2021-08-27 14:11:51,617 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:51,617 INFO L791 eck$LassoCheckResult]: Stem: 12930#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 12926#L12-2 assume !!(main_~i~0 < main_~j~0); 12927#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12928#L12-2 assume !!(main_~i~0 < main_~j~0); 12929#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12933#L12-2 assume !!(main_~i~0 < main_~j~0); 13020#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13019#L12-2 assume !!(main_~i~0 < main_~j~0); 13018#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13017#L12-2 assume !!(main_~i~0 < main_~j~0); 13016#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13015#L12-2 assume !!(main_~i~0 < main_~j~0); 13014#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13013#L12-2 assume !!(main_~i~0 < main_~j~0); 13012#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13011#L12-2 assume !!(main_~i~0 < main_~j~0); 13010#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13009#L12-2 assume !!(main_~i~0 < main_~j~0); 13008#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13007#L12-2 assume !!(main_~i~0 < main_~j~0); 13006#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13005#L12-2 assume !!(main_~i~0 < main_~j~0); 13004#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13003#L12-2 assume !!(main_~i~0 < main_~j~0); 13002#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13001#L12-2 assume !!(main_~i~0 < main_~j~0); 13000#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12999#L12-2 assume !!(main_~i~0 < main_~j~0); 12998#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12997#L12-2 assume !!(main_~i~0 < main_~j~0); 12996#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12995#L12-2 assume !!(main_~i~0 < main_~j~0); 12994#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12993#L12-2 assume !!(main_~i~0 < main_~j~0); 12992#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12991#L12-2 assume !!(main_~i~0 < main_~j~0); 12990#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12989#L12-2 assume !!(main_~i~0 < main_~j~0); 12988#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12987#L12-2 assume !!(main_~i~0 < main_~j~0); 12986#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12985#L12-2 assume !!(main_~i~0 < main_~j~0); 12984#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12983#L12-2 assume !!(main_~i~0 < main_~j~0); 12982#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12981#L12-2 assume !!(main_~i~0 < main_~j~0); 12980#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12979#L12-2 assume !!(main_~i~0 < main_~j~0); 12978#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12977#L12-2 assume !!(main_~i~0 < main_~j~0); 12976#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12975#L12-2 assume !!(main_~i~0 < main_~j~0); 12974#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12973#L12-2 assume !!(main_~i~0 < main_~j~0); 12972#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12971#L12-2 assume !!(main_~i~0 < main_~j~0); 12970#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12969#L12-2 assume !!(main_~i~0 < main_~j~0); 12968#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12967#L12-2 assume !!(main_~i~0 < main_~j~0); 12966#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12965#L12-2 assume !!(main_~i~0 < main_~j~0); 12964#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12963#L12-2 assume !!(main_~i~0 < main_~j~0); 12962#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12961#L12-2 assume !!(main_~i~0 < main_~j~0); 12960#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12959#L12-2 assume !!(main_~i~0 < main_~j~0); 12958#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12957#L12-2 assume !!(main_~i~0 < main_~j~0); 12956#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12955#L12-2 assume !!(main_~i~0 < main_~j~0); 12954#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12953#L12-2 assume !!(main_~i~0 < main_~j~0); 12952#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12951#L12-2 assume !!(main_~i~0 < main_~j~0); 12950#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12949#L12-2 assume !!(main_~i~0 < main_~j~0); 12948#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12947#L12-2 assume !!(main_~i~0 < main_~j~0); 12946#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12945#L12-2 assume !!(main_~i~0 < main_~j~0); 12944#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12943#L12-2 assume !!(main_~i~0 < main_~j~0); 12942#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12941#L12-2 assume !!(main_~i~0 < main_~j~0); 12940#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12939#L12-2 assume !!(main_~i~0 < main_~j~0); 12937#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12936#L12-2 assume !!(main_~i~0 < main_~j~0); 12935#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12934#L12-2 assume !!(main_~i~0 < main_~j~0); 12931#L12 [2021-08-27 14:11:51,617 INFO L793 eck$LassoCheckResult]: Loop: 12931#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 12932#L12-2 assume !!(main_~i~0 < main_~j~0); 12935#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12934#L12-2 assume !!(main_~i~0 < main_~j~0); 12931#L12 [2021-08-27 14:11:51,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:51,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1677736579, now seen corresponding path program 45 times [2021-08-27 14:11:51,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:51,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491169956] [2021-08-27 14:11:51,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:51,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:51,630 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:51,641 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:51,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:51,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 43 times [2021-08-27 14:11:51,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:51,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629230486] [2021-08-27 14:11:51,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:51,641 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:51,645 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:51,646 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:51,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:51,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1668269637, now seen corresponding path program 45 times [2021-08-27 14:11:51,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:51,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021668311] [2021-08-27 14:11:51,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:51,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 138 proven. 2070 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:52,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:52,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021668311] [2021-08-27 14:11:52,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021668311] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:52,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810132182] [2021-08-27 14:11:52,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 14:11:52,453 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:52,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:52,454 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:52,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2021-08-27 14:11:53,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2021-08-27 14:11:53,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:53,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 47 conjunts are in the unsatisfiable core [2021-08-27 14:11:53,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:53,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 138 proven. 2070 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:53,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810132182] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:53,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:53,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2021-08-27 14:11:53,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524127922] [2021-08-27 14:11:53,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:53,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-08-27 14:11:53,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2021-08-27 14:11:53,620 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. cyclomatic complexity: 3 Second operand has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:53,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:53,716 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2021-08-27 14:11:53,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-27 14:11:53,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 101 transitions. [2021-08-27 14:11:53,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:53,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 98 states and 100 transitions. [2021-08-27 14:11:53,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:53,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:53,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 100 transitions. [2021-08-27 14:11:53,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:53,718 INFO L681 BuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2021-08-27 14:11:53,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 100 transitions. [2021-08-27 14:11:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2021-08-27 14:11:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 96 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2021-08-27 14:11:53,719 INFO L704 BuchiCegarLoop]: Abstraction has 97 states and 99 transitions. [2021-08-27 14:11:53,719 INFO L587 BuchiCegarLoop]: Abstraction has 97 states and 99 transitions. [2021-08-27 14:11:53,719 INFO L425 BuchiCegarLoop]: ======== Iteration 48============ [2021-08-27 14:11:53,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 99 transitions. [2021-08-27 14:11:53,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:53,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:53,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:53,720 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [47, 46, 1] [2021-08-27 14:11:53,720 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:53,721 INFO L791 eck$LassoCheckResult]: Stem: 13462#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 13458#L12-2 assume !!(main_~i~0 < main_~j~0); 13459#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13460#L12-2 assume !!(main_~i~0 < main_~j~0); 13461#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13465#L12-2 assume !!(main_~i~0 < main_~j~0); 13554#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13553#L12-2 assume !!(main_~i~0 < main_~j~0); 13552#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13551#L12-2 assume !!(main_~i~0 < main_~j~0); 13550#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13549#L12-2 assume !!(main_~i~0 < main_~j~0); 13548#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13547#L12-2 assume !!(main_~i~0 < main_~j~0); 13546#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13545#L12-2 assume !!(main_~i~0 < main_~j~0); 13544#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13543#L12-2 assume !!(main_~i~0 < main_~j~0); 13542#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13541#L12-2 assume !!(main_~i~0 < main_~j~0); 13540#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13539#L12-2 assume !!(main_~i~0 < main_~j~0); 13538#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13537#L12-2 assume !!(main_~i~0 < main_~j~0); 13536#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13535#L12-2 assume !!(main_~i~0 < main_~j~0); 13534#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13533#L12-2 assume !!(main_~i~0 < main_~j~0); 13532#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13531#L12-2 assume !!(main_~i~0 < main_~j~0); 13530#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13529#L12-2 assume !!(main_~i~0 < main_~j~0); 13528#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13527#L12-2 assume !!(main_~i~0 < main_~j~0); 13526#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13525#L12-2 assume !!(main_~i~0 < main_~j~0); 13524#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13523#L12-2 assume !!(main_~i~0 < main_~j~0); 13522#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13521#L12-2 assume !!(main_~i~0 < main_~j~0); 13520#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13519#L12-2 assume !!(main_~i~0 < main_~j~0); 13518#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13517#L12-2 assume !!(main_~i~0 < main_~j~0); 13516#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13515#L12-2 assume !!(main_~i~0 < main_~j~0); 13514#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13513#L12-2 assume !!(main_~i~0 < main_~j~0); 13512#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13511#L12-2 assume !!(main_~i~0 < main_~j~0); 13510#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13509#L12-2 assume !!(main_~i~0 < main_~j~0); 13508#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13507#L12-2 assume !!(main_~i~0 < main_~j~0); 13506#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13505#L12-2 assume !!(main_~i~0 < main_~j~0); 13504#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13503#L12-2 assume !!(main_~i~0 < main_~j~0); 13502#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13501#L12-2 assume !!(main_~i~0 < main_~j~0); 13500#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13499#L12-2 assume !!(main_~i~0 < main_~j~0); 13498#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13497#L12-2 assume !!(main_~i~0 < main_~j~0); 13496#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13495#L12-2 assume !!(main_~i~0 < main_~j~0); 13494#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13493#L12-2 assume !!(main_~i~0 < main_~j~0); 13492#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13491#L12-2 assume !!(main_~i~0 < main_~j~0); 13490#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13489#L12-2 assume !!(main_~i~0 < main_~j~0); 13488#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13487#L12-2 assume !!(main_~i~0 < main_~j~0); 13486#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13485#L12-2 assume !!(main_~i~0 < main_~j~0); 13484#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13483#L12-2 assume !!(main_~i~0 < main_~j~0); 13482#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13481#L12-2 assume !!(main_~i~0 < main_~j~0); 13480#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13479#L12-2 assume !!(main_~i~0 < main_~j~0); 13478#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13477#L12-2 assume !!(main_~i~0 < main_~j~0); 13476#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13475#L12-2 assume !!(main_~i~0 < main_~j~0); 13474#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13473#L12-2 assume !!(main_~i~0 < main_~j~0); 13472#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13471#L12-2 assume !!(main_~i~0 < main_~j~0); 13469#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13468#L12-2 assume !!(main_~i~0 < main_~j~0); 13467#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13466#L12-2 assume !!(main_~i~0 < main_~j~0); 13463#L12 [2021-08-27 14:11:53,721 INFO L793 eck$LassoCheckResult]: Loop: 13463#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 13464#L12-2 assume !!(main_~i~0 < main_~j~0); 13467#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13466#L12-2 assume !!(main_~i~0 < main_~j~0); 13463#L12 [2021-08-27 14:11:53,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:53,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1692116832, now seen corresponding path program 46 times [2021-08-27 14:11:53,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:53,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260840570] [2021-08-27 14:11:53,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:53,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:53,736 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:53,747 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:53,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:53,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 44 times [2021-08-27 14:11:53,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:53,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303865579] [2021-08-27 14:11:53,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:53,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:53,752 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:53,753 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:53,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:53,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1241518056, now seen corresponding path program 46 times [2021-08-27 14:11:53,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:53,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111384355] [2021-08-27 14:11:53,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:53,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:54,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:54,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111384355] [2021-08-27 14:11:54,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111384355] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:54,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586947883] [2021-08-27 14:11:54,649 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 14:11:54,649 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:54,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:54,650 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:54,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2021-08-27 14:11:55,527 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 14:11:55,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:55,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 48 conjunts are in the unsatisfiable core [2021-08-27 14:11:55,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:55,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586947883] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:55,768 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:55,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2021-08-27 14:11:55,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822316598] [2021-08-27 14:11:55,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:55,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-08-27 14:11:55,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2021-08-27 14:11:55,806 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. cyclomatic complexity: 3 Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:55,892 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2021-08-27 14:11:55,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-27 14:11:55,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 103 transitions. [2021-08-27 14:11:55,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:55,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 100 states and 102 transitions. [2021-08-27 14:11:55,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:55,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:55,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 102 transitions. [2021-08-27 14:11:55,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:55,893 INFO L681 BuchiCegarLoop]: Abstraction has 100 states and 102 transitions. [2021-08-27 14:11:55,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 102 transitions. [2021-08-27 14:11:55,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2021-08-27 14:11:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.02020202020202) internal successors, (101), 98 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2021-08-27 14:11:55,894 INFO L704 BuchiCegarLoop]: Abstraction has 99 states and 101 transitions. [2021-08-27 14:11:55,894 INFO L587 BuchiCegarLoop]: Abstraction has 99 states and 101 transitions. [2021-08-27 14:11:55,894 INFO L425 BuchiCegarLoop]: ======== Iteration 49============ [2021-08-27 14:11:55,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 101 transitions. [2021-08-27 14:11:55,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:55,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:55,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:55,895 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [48, 47, 1] [2021-08-27 14:11:55,895 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:55,895 INFO L791 eck$LassoCheckResult]: Stem: 14005#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 14001#L12-2 assume !!(main_~i~0 < main_~j~0); 14002#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14003#L12-2 assume !!(main_~i~0 < main_~j~0); 14004#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14008#L12-2 assume !!(main_~i~0 < main_~j~0); 14099#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14098#L12-2 assume !!(main_~i~0 < main_~j~0); 14097#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14096#L12-2 assume !!(main_~i~0 < main_~j~0); 14095#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14094#L12-2 assume !!(main_~i~0 < main_~j~0); 14093#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14092#L12-2 assume !!(main_~i~0 < main_~j~0); 14091#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14090#L12-2 assume !!(main_~i~0 < main_~j~0); 14089#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14088#L12-2 assume !!(main_~i~0 < main_~j~0); 14087#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14086#L12-2 assume !!(main_~i~0 < main_~j~0); 14085#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14084#L12-2 assume !!(main_~i~0 < main_~j~0); 14083#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14082#L12-2 assume !!(main_~i~0 < main_~j~0); 14081#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14080#L12-2 assume !!(main_~i~0 < main_~j~0); 14079#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14078#L12-2 assume !!(main_~i~0 < main_~j~0); 14077#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14076#L12-2 assume !!(main_~i~0 < main_~j~0); 14075#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14074#L12-2 assume !!(main_~i~0 < main_~j~0); 14073#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14072#L12-2 assume !!(main_~i~0 < main_~j~0); 14071#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14070#L12-2 assume !!(main_~i~0 < main_~j~0); 14069#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14068#L12-2 assume !!(main_~i~0 < main_~j~0); 14067#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14066#L12-2 assume !!(main_~i~0 < main_~j~0); 14065#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14064#L12-2 assume !!(main_~i~0 < main_~j~0); 14063#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14062#L12-2 assume !!(main_~i~0 < main_~j~0); 14061#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14060#L12-2 assume !!(main_~i~0 < main_~j~0); 14059#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14058#L12-2 assume !!(main_~i~0 < main_~j~0); 14057#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14056#L12-2 assume !!(main_~i~0 < main_~j~0); 14055#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14054#L12-2 assume !!(main_~i~0 < main_~j~0); 14053#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14052#L12-2 assume !!(main_~i~0 < main_~j~0); 14051#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14050#L12-2 assume !!(main_~i~0 < main_~j~0); 14049#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14048#L12-2 assume !!(main_~i~0 < main_~j~0); 14047#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14046#L12-2 assume !!(main_~i~0 < main_~j~0); 14045#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14044#L12-2 assume !!(main_~i~0 < main_~j~0); 14043#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14042#L12-2 assume !!(main_~i~0 < main_~j~0); 14041#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14040#L12-2 assume !!(main_~i~0 < main_~j~0); 14039#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14038#L12-2 assume !!(main_~i~0 < main_~j~0); 14037#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14036#L12-2 assume !!(main_~i~0 < main_~j~0); 14035#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14034#L12-2 assume !!(main_~i~0 < main_~j~0); 14033#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14032#L12-2 assume !!(main_~i~0 < main_~j~0); 14031#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14030#L12-2 assume !!(main_~i~0 < main_~j~0); 14029#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14028#L12-2 assume !!(main_~i~0 < main_~j~0); 14027#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14026#L12-2 assume !!(main_~i~0 < main_~j~0); 14025#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14024#L12-2 assume !!(main_~i~0 < main_~j~0); 14023#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14022#L12-2 assume !!(main_~i~0 < main_~j~0); 14021#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14020#L12-2 assume !!(main_~i~0 < main_~j~0); 14019#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14018#L12-2 assume !!(main_~i~0 < main_~j~0); 14017#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14016#L12-2 assume !!(main_~i~0 < main_~j~0); 14015#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14014#L12-2 assume !!(main_~i~0 < main_~j~0); 14012#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14011#L12-2 assume !!(main_~i~0 < main_~j~0); 14010#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14009#L12-2 assume !!(main_~i~0 < main_~j~0); 14006#L12 [2021-08-27 14:11:55,895 INFO L793 eck$LassoCheckResult]: Loop: 14006#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 14007#L12-2 assume !!(main_~i~0 < main_~j~0); 14010#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14009#L12-2 assume !!(main_~i~0 < main_~j~0); 14006#L12 [2021-08-27 14:11:55,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:55,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1668329219, now seen corresponding path program 47 times [2021-08-27 14:11:55,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:55,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845387113] [2021-08-27 14:11:55,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:55,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:55,909 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:55,921 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:55,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 45 times [2021-08-27 14:11:55,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:55,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309238198] [2021-08-27 14:11:55,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:55,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:55,926 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:55,926 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:55,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:55,927 INFO L82 PathProgramCache]: Analyzing trace with hash 844858165, now seen corresponding path program 47 times [2021-08-27 14:11:55,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:55,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212755963] [2021-08-27 14:11:55,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:55,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 144 proven. 2256 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:56,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:56,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212755963] [2021-08-27 14:11:56,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212755963] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:56,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194088304] [2021-08-27 14:11:56,927 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 14:11:56,927 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:56,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:56,929 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:56,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2021-08-27 14:11:57,857 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2021-08-27 14:11:57,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:11:57,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 49 conjunts are in the unsatisfiable core [2021-08-27 14:11:57,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:11:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 144 proven. 2256 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:58,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194088304] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:58,154 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:11:58,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2021-08-27 14:11:58,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491796166] [2021-08-27 14:11:58,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:11:58,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-08-27 14:11:58,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2021-08-27 14:11:58,200 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. cyclomatic complexity: 3 Second operand has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:11:58,315 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2021-08-27 14:11:58,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-27 14:11:58,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 105 transitions. [2021-08-27 14:11:58,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:58,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 102 states and 104 transitions. [2021-08-27 14:11:58,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:11:58,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:11:58,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 104 transitions. [2021-08-27 14:11:58,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:11:58,319 INFO L681 BuchiCegarLoop]: Abstraction has 102 states and 104 transitions. [2021-08-27 14:11:58,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 104 transitions. [2021-08-27 14:11:58,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2021-08-27 14:11:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 100 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:11:58,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2021-08-27 14:11:58,320 INFO L704 BuchiCegarLoop]: Abstraction has 101 states and 103 transitions. [2021-08-27 14:11:58,320 INFO L587 BuchiCegarLoop]: Abstraction has 101 states and 103 transitions. [2021-08-27 14:11:58,321 INFO L425 BuchiCegarLoop]: ======== Iteration 50============ [2021-08-27 14:11:58,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 103 transitions. [2021-08-27 14:11:58,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:11:58,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:11:58,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:11:58,322 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [49, 48, 1] [2021-08-27 14:11:58,322 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:11:58,322 INFO L791 eck$LassoCheckResult]: Stem: 14559#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 14555#L12-2 assume !!(main_~i~0 < main_~j~0); 14556#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14557#L12-2 assume !!(main_~i~0 < main_~j~0); 14558#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14562#L12-2 assume !!(main_~i~0 < main_~j~0); 14655#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14654#L12-2 assume !!(main_~i~0 < main_~j~0); 14653#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14652#L12-2 assume !!(main_~i~0 < main_~j~0); 14651#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14650#L12-2 assume !!(main_~i~0 < main_~j~0); 14649#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14648#L12-2 assume !!(main_~i~0 < main_~j~0); 14647#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14646#L12-2 assume !!(main_~i~0 < main_~j~0); 14645#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14644#L12-2 assume !!(main_~i~0 < main_~j~0); 14643#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14642#L12-2 assume !!(main_~i~0 < main_~j~0); 14641#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14640#L12-2 assume !!(main_~i~0 < main_~j~0); 14639#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14638#L12-2 assume !!(main_~i~0 < main_~j~0); 14637#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14636#L12-2 assume !!(main_~i~0 < main_~j~0); 14635#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14634#L12-2 assume !!(main_~i~0 < main_~j~0); 14633#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14632#L12-2 assume !!(main_~i~0 < main_~j~0); 14631#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14630#L12-2 assume !!(main_~i~0 < main_~j~0); 14629#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14628#L12-2 assume !!(main_~i~0 < main_~j~0); 14627#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14626#L12-2 assume !!(main_~i~0 < main_~j~0); 14625#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14624#L12-2 assume !!(main_~i~0 < main_~j~0); 14623#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14622#L12-2 assume !!(main_~i~0 < main_~j~0); 14621#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14620#L12-2 assume !!(main_~i~0 < main_~j~0); 14619#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14618#L12-2 assume !!(main_~i~0 < main_~j~0); 14617#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14616#L12-2 assume !!(main_~i~0 < main_~j~0); 14615#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14614#L12-2 assume !!(main_~i~0 < main_~j~0); 14613#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14612#L12-2 assume !!(main_~i~0 < main_~j~0); 14611#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14610#L12-2 assume !!(main_~i~0 < main_~j~0); 14609#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14608#L12-2 assume !!(main_~i~0 < main_~j~0); 14607#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14606#L12-2 assume !!(main_~i~0 < main_~j~0); 14605#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14604#L12-2 assume !!(main_~i~0 < main_~j~0); 14603#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14602#L12-2 assume !!(main_~i~0 < main_~j~0); 14601#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14600#L12-2 assume !!(main_~i~0 < main_~j~0); 14599#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14598#L12-2 assume !!(main_~i~0 < main_~j~0); 14597#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14596#L12-2 assume !!(main_~i~0 < main_~j~0); 14595#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14594#L12-2 assume !!(main_~i~0 < main_~j~0); 14593#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14592#L12-2 assume !!(main_~i~0 < main_~j~0); 14591#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14590#L12-2 assume !!(main_~i~0 < main_~j~0); 14589#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14588#L12-2 assume !!(main_~i~0 < main_~j~0); 14587#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14586#L12-2 assume !!(main_~i~0 < main_~j~0); 14585#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14584#L12-2 assume !!(main_~i~0 < main_~j~0); 14583#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14582#L12-2 assume !!(main_~i~0 < main_~j~0); 14581#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14580#L12-2 assume !!(main_~i~0 < main_~j~0); 14579#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14578#L12-2 assume !!(main_~i~0 < main_~j~0); 14577#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14576#L12-2 assume !!(main_~i~0 < main_~j~0); 14575#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14574#L12-2 assume !!(main_~i~0 < main_~j~0); 14573#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14572#L12-2 assume !!(main_~i~0 < main_~j~0); 14571#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14570#L12-2 assume !!(main_~i~0 < main_~j~0); 14569#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14568#L12-2 assume !!(main_~i~0 < main_~j~0); 14566#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14565#L12-2 assume !!(main_~i~0 < main_~j~0); 14564#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14563#L12-2 assume !!(main_~i~0 < main_~j~0); 14560#L12 [2021-08-27 14:11:58,322 INFO L793 eck$LassoCheckResult]: Loop: 14560#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 14561#L12-2 assume !!(main_~i~0 < main_~j~0); 14564#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14563#L12-2 assume !!(main_~i~0 < main_~j~0); 14560#L12 [2021-08-27 14:11:58,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:58,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1241577638, now seen corresponding path program 48 times [2021-08-27 14:11:58,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:58,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019750684] [2021-08-27 14:11:58,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:58,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:58,336 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:58,349 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:58,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:58,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 46 times [2021-08-27 14:11:58,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:58,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506574892] [2021-08-27 14:11:58,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:58,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:58,354 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:11:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:11:58,355 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:11:58,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:11:58,355 INFO L82 PathProgramCache]: Analyzing trace with hash 102679314, now seen corresponding path program 48 times [2021-08-27 14:11:58,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:11:58,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776490635] [2021-08-27 14:11:58,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:11:58,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:11:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:11:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 147 proven. 2352 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:11:59,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:11:59,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776490635] [2021-08-27 14:11:59,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776490635] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:11:59,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133878454] [2021-08-27 14:11:59,271 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 14:11:59,271 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:11:59,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:11:59,272 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:11:59,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2021-08-27 14:12:00,241 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2021-08-27 14:12:00,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:12:00,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 50 conjunts are in the unsatisfiable core [2021-08-27 14:12:00,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:12:00,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 147 proven. 2352 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:12:00,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133878454] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:12:00,550 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:12:00,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2021-08-27 14:12:00,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909894585] [2021-08-27 14:12:00,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:12:00,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-08-27 14:12:00,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2021-08-27 14:12:00,586 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. cyclomatic complexity: 3 Second operand has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:12:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:12:00,677 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2021-08-27 14:12:00,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-27 14:12:00,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 107 transitions. [2021-08-27 14:12:00,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:12:00,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 104 states and 106 transitions. [2021-08-27 14:12:00,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2021-08-27 14:12:00,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2021-08-27 14:12:00,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 106 transitions. [2021-08-27 14:12:00,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:12:00,678 INFO L681 BuchiCegarLoop]: Abstraction has 104 states and 106 transitions. [2021-08-27 14:12:00,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 106 transitions. [2021-08-27 14:12:00,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2021-08-27 14:12:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 102 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:12:00,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2021-08-27 14:12:00,679 INFO L704 BuchiCegarLoop]: Abstraction has 103 states and 105 transitions. [2021-08-27 14:12:00,679 INFO L587 BuchiCegarLoop]: Abstraction has 103 states and 105 transitions. [2021-08-27 14:12:00,679 INFO L425 BuchiCegarLoop]: ======== Iteration 51============ [2021-08-27 14:12:00,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 105 transitions. [2021-08-27 14:12:00,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:12:00,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:12:00,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:12:00,680 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [50, 49, 1] [2021-08-27 14:12:00,680 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-08-27 14:12:00,680 INFO L791 eck$LassoCheckResult]: Stem: 15124#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 15120#L12-2 assume !!(main_~i~0 < main_~j~0); 15121#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15122#L12-2 assume !!(main_~i~0 < main_~j~0); 15123#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15127#L12-2 assume !!(main_~i~0 < main_~j~0); 15222#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15221#L12-2 assume !!(main_~i~0 < main_~j~0); 15220#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15219#L12-2 assume !!(main_~i~0 < main_~j~0); 15218#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15217#L12-2 assume !!(main_~i~0 < main_~j~0); 15216#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15215#L12-2 assume !!(main_~i~0 < main_~j~0); 15214#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15213#L12-2 assume !!(main_~i~0 < main_~j~0); 15212#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15211#L12-2 assume !!(main_~i~0 < main_~j~0); 15210#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15209#L12-2 assume !!(main_~i~0 < main_~j~0); 15208#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15207#L12-2 assume !!(main_~i~0 < main_~j~0); 15206#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15205#L12-2 assume !!(main_~i~0 < main_~j~0); 15204#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15203#L12-2 assume !!(main_~i~0 < main_~j~0); 15202#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15201#L12-2 assume !!(main_~i~0 < main_~j~0); 15200#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15199#L12-2 assume !!(main_~i~0 < main_~j~0); 15198#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15197#L12-2 assume !!(main_~i~0 < main_~j~0); 15196#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15195#L12-2 assume !!(main_~i~0 < main_~j~0); 15194#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15193#L12-2 assume !!(main_~i~0 < main_~j~0); 15192#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15191#L12-2 assume !!(main_~i~0 < main_~j~0); 15190#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15189#L12-2 assume !!(main_~i~0 < main_~j~0); 15188#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15187#L12-2 assume !!(main_~i~0 < main_~j~0); 15186#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15185#L12-2 assume !!(main_~i~0 < main_~j~0); 15184#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15183#L12-2 assume !!(main_~i~0 < main_~j~0); 15182#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15181#L12-2 assume !!(main_~i~0 < main_~j~0); 15180#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15179#L12-2 assume !!(main_~i~0 < main_~j~0); 15178#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15177#L12-2 assume !!(main_~i~0 < main_~j~0); 15176#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15175#L12-2 assume !!(main_~i~0 < main_~j~0); 15174#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15173#L12-2 assume !!(main_~i~0 < main_~j~0); 15172#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15171#L12-2 assume !!(main_~i~0 < main_~j~0); 15170#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15169#L12-2 assume !!(main_~i~0 < main_~j~0); 15168#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15167#L12-2 assume !!(main_~i~0 < main_~j~0); 15166#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15165#L12-2 assume !!(main_~i~0 < main_~j~0); 15164#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15163#L12-2 assume !!(main_~i~0 < main_~j~0); 15162#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15161#L12-2 assume !!(main_~i~0 < main_~j~0); 15160#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15159#L12-2 assume !!(main_~i~0 < main_~j~0); 15158#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15157#L12-2 assume !!(main_~i~0 < main_~j~0); 15156#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15155#L12-2 assume !!(main_~i~0 < main_~j~0); 15154#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15153#L12-2 assume !!(main_~i~0 < main_~j~0); 15152#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15151#L12-2 assume !!(main_~i~0 < main_~j~0); 15150#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15149#L12-2 assume !!(main_~i~0 < main_~j~0); 15148#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15147#L12-2 assume !!(main_~i~0 < main_~j~0); 15146#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15145#L12-2 assume !!(main_~i~0 < main_~j~0); 15144#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15143#L12-2 assume !!(main_~i~0 < main_~j~0); 15142#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15141#L12-2 assume !!(main_~i~0 < main_~j~0); 15140#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15139#L12-2 assume !!(main_~i~0 < main_~j~0); 15138#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15137#L12-2 assume !!(main_~i~0 < main_~j~0); 15136#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15135#L12-2 assume !!(main_~i~0 < main_~j~0); 15134#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15133#L12-2 assume !!(main_~i~0 < main_~j~0); 15131#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15130#L12-2 assume !!(main_~i~0 < main_~j~0); 15129#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15128#L12-2 assume !!(main_~i~0 < main_~j~0); 15125#L12 [2021-08-27 14:12:00,680 INFO L793 eck$LassoCheckResult]: Loop: 15125#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 15126#L12-2 assume !!(main_~i~0 < main_~j~0); 15129#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15128#L12-2 assume !!(main_~i~0 < main_~j~0); 15125#L12 [2021-08-27 14:12:00,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:12:00,680 INFO L82 PathProgramCache]: Analyzing trace with hash 844798583, now seen corresponding path program 49 times [2021-08-27 14:12:00,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:12:00,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406517664] [2021-08-27 14:12:00,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:12:00,681 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:12:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:12:00,695 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:12:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:12:00,712 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:12:00,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:12:00,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 47 times [2021-08-27 14:12:00,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:12:00,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663710761] [2021-08-27 14:12:00,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:12:00,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:12:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:12:00,718 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:12:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:12:00,720 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:12:00,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:12:00,720 INFO L82 PathProgramCache]: Analyzing trace with hash -166625361, now seen corresponding path program 49 times [2021-08-27 14:12:00,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:12:00,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477933273] [2021-08-27 14:12:00,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:12:00,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:12:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:12:00,737 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:12:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:12:00,755 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:12:02,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 02:12:02 BoogieIcfgContainer [2021-08-27 14:12:02,970 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 14:12:02,970 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 14:12:02,971 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 14:12:02,971 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 14:12:02,971 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:11:09" (3/4) ... [2021-08-27 14:12:02,973 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 14:12:03,017 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 14:12:03,017 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 14:12:03,018 INFO L168 Benchmark]: Toolchain (without parser) took 53972.51 ms. Allocated memory was 69.2 MB in the beginning and 1.8 GB in the end (delta: 1.8 GB). Free memory was 50.0 MB in the beginning and 941.2 MB in the end (delta: -891.2 MB). Peak memory consumption was 879.2 MB. Max. memory is 16.1 GB. [2021-08-27 14:12:03,018 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 69.2 MB. Free memory is still 50.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:12:03,019 INFO L168 Benchmark]: CACSL2BoogieTranslator took 104.05 ms. Allocated memory is still 69.2 MB. Free memory was 49.9 MB in the beginning and 41.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-27 14:12:03,019 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.81 ms. Allocated memory is still 69.2 MB. Free memory was 41.5 MB in the beginning and 53.5 MB in the end (delta: -11.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:12:03,019 INFO L168 Benchmark]: Boogie Preprocessor took 9.98 ms. Allocated memory is still 69.2 MB. Free memory was 53.5 MB in the beginning and 52.5 MB in the end (delta: 968.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:12:03,019 INFO L168 Benchmark]: RCFGBuilder took 184.85 ms. Allocated memory is still 69.2 MB. Free memory was 52.5 MB in the beginning and 44.0 MB in the end (delta: 8.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-27 14:12:03,019 INFO L168 Benchmark]: BuchiAutomizer took 53575.50 ms. Allocated memory was 69.2 MB in the beginning and 1.8 GB in the end (delta: 1.8 GB). Free memory was 43.8 MB in the beginning and 944.3 MB in the end (delta: -900.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 16.1 GB. [2021-08-27 14:12:03,019 INFO L168 Benchmark]: Witness Printer took 46.94 ms. Allocated memory is still 1.8 GB. Free memory was 944.3 MB in the beginning and 941.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:12:03,020 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.13 ms. Allocated memory is still 69.2 MB. Free memory is still 50.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 104.05 ms. Allocated memory is still 69.2 MB. Free memory was 49.9 MB in the beginning and 41.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 45.81 ms. Allocated memory is still 69.2 MB. Free memory was 41.5 MB in the beginning and 53.5 MB in the end (delta: -11.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 9.98 ms. Allocated memory is still 69.2 MB. Free memory was 53.5 MB in the beginning and 52.5 MB in the end (delta: 968.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 184.85 ms. Allocated memory is still 69.2 MB. Free memory was 52.5 MB in the beginning and 44.0 MB in the end (delta: 8.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 53575.50 ms. Allocated memory was 69.2 MB in the beginning and 1.8 GB in the end (delta: 1.8 GB). Free memory was 43.8 MB in the beginning and 944.3 MB in the end (delta: -900.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 16.1 GB. * Witness Printer took 46.94 ms. Allocated memory is still 1.8 GB. Free memory was 944.3 MB in the beginning and 941.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 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 53 terminating modules (49 trivial, 2 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function j and consists of 4 locations. One deterministic module has affine ranking function j and consists of 3 locations. One nondeterministic module has affine ranking function j and consists of 3 locations. One nondeterministic module has affine ranking function 103 + -2 * j and consists of 3 locations. 49 modules have a trivial ranking function, the largest among these consists of 51 locations. The remainder module has 103 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 53.5s and 51 iterations. TraceHistogramMax:50. Analysis of lassos took 50.0s. Construction of modules took 1.7s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 53. Automata minimization 76.1ms AutomataMinimizationTime, 53 MinimizatonAttempts, 57 StatesRemovedByMinimization, 51 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 103 states and ocurred in iteration 50. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 126 SDtfs, 29 SDslu, 3 SDs, 0 SdLazy, 2770 SolverSat, 171 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1796.8ms Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc46 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax166 hnf100 lsp59 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf93 smp100 dnf100 smp100 tf107 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 46ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 12]: 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 {\result=0, i=49, j=51} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] j = 100 [L9] i = 0 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j Loop: [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-08-27 14:12:03,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:03,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2021-08-27 14:12:03,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2021-08-27 14:12:03,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2021-08-27 14:12:03,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:04,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2021-08-27 14:12:04,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:04,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:04,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2021-08-27 14:12:04,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:05,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:05,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:05,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2021-08-27 14:12:05,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2021-08-27 14:12:05,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:06,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2021-08-27 14:12:06,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:06,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:06,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2021-08-27 14:12:06,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2021-08-27 14:12:07,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2021-08-27 14:12:07,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2021-08-27 14:12:07,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:07,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2021-08-27 14:12:07,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2021-08-27 14:12:08,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:08,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2021-08-27 14:12:08,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:08,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2021-08-27 14:12:08,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2021-08-27 14:12:09,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:09,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2021-08-27 14:12:09,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:09,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:09,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2021-08-27 14:12:10,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:10,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2021-08-27 14:12:10,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:10,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2021-08-27 14:12:10,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2021-08-27 14:12:11,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2021-08-27 14:12:11,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2021-08-27 14:12:11,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2021-08-27 14:12:11,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2021-08-27 14:12:11,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:12,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2021-08-27 14:12:12,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-08-27 14:12:12,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-08-27 14:12:12,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...