./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 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-crafted-lit/Urban-WST2013-Fig2-modified1000.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 0b3c6d5b6497aa5ff0eb68154ec5345da59cc3565c3dc280e241d196cfa0cbf4 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 09:20:52,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 09:20:53,001 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 09:20:53,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 09:20:53,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 09:20:53,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 09:20:53,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 09:20:53,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 09:20:53,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 09:20:53,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 09:20:53,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 09:20:53,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 09:20:53,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 09:20:53,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 09:20:53,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 09:20:53,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 09:20:53,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 09:20:53,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 09:20:53,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 09:20:53,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 09:20:53,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 09:20:53,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 09:20:53,074 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 09:20:53,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 09:20:53,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 09:20:53,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 09:20:53,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 09:20:53,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 09:20:53,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 09:20:53,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 09:20:53,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 09:20:53,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 09:20:53,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 09:20:53,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 09:20:53,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 09:20:53,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 09:20:53,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 09:20:53,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 09:20:53,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 09:20:53,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 09:20:53,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 09:20:53,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-16 09:20:53,115 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 09:20:53,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 09:20:53,115 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 09:20:53,115 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 09:20:53,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 09:20:53,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 09:20:53,117 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 09:20:53,117 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-16 09:20:53,117 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-16 09:20:53,117 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-16 09:20:53,117 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-16 09:20:53,118 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-16 09:20:53,118 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-16 09:20:53,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 09:20:53,118 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 09:20:53,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 09:20:53,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 09:20:53,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-16 09:20:53,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-16 09:20:53,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-16 09:20:53,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 09:20:53,119 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-16 09:20:53,120 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 09:20:53,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-16 09:20:53,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 09:20:53,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 09:20:53,120 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 09:20:53,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 09:20:53,121 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 09:20:53,121 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-16 09:20:53,121 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 -> 0b3c6d5b6497aa5ff0eb68154ec5345da59cc3565c3dc280e241d196cfa0cbf4 [2021-12-16 09:20:53,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 09:20:53,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 09:20:53,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 09:20:53,323 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 09:20:53,324 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 09:20:53,325 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c [2021-12-16 09:20:53,376 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c18592eda/057baa7c0cd842c4a1711ebb89e3869b/FLAGbeb59875f [2021-12-16 09:20:53,734 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 09:20:53,734 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c [2021-12-16 09:20:53,743 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c18592eda/057baa7c0cd842c4a1711ebb89e3869b/FLAGbeb59875f [2021-12-16 09:20:53,756 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c18592eda/057baa7c0cd842c4a1711ebb89e3869b [2021-12-16 09:20:53,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 09:20:53,761 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 09:20:53,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 09:20:53,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 09:20:53,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 09:20:53,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:20:53" (1/1) ... [2021-12-16 09:20:53,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ba41d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:20:53, skipping insertion in model container [2021-12-16 09:20:53,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:20:53" (1/1) ... [2021-12-16 09:20:53,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 09:20:53,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 09:20:53,971 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:20:53,975 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 09:20:53,986 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:20:53,996 INFO L208 MainTranslator]: Completed translation [2021-12-16 09:20:53,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:20:53 WrapperNode [2021-12-16 09:20:53,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 09:20:53,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 09:20:53,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 09:20:53,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 09:20:54,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:20:53" (1/1) ... [2021-12-16 09:20:54,009 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:20:53" (1/1) ... [2021-12-16 09:20:54,020 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2021-12-16 09:20:54,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 09:20:54,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 09:20:54,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 09:20:54,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 09:20:54,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:20:53" (1/1) ... [2021-12-16 09:20:54,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:20:53" (1/1) ... [2021-12-16 09:20:54,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:20:53" (1/1) ... [2021-12-16 09:20:54,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:20:53" (1/1) ... [2021-12-16 09:20:54,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:20:53" (1/1) ... [2021-12-16 09:20:54,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:20:53" (1/1) ... [2021-12-16 09:20:54,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:20:53" (1/1) ... [2021-12-16 09:20:54,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 09:20:54,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 09:20:54,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 09:20:54,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 09:20:54,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:20:53" (1/1) ... [2021-12-16 09:20:54,048 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:20:54,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:20:54,073 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-12-16 09:20:54,085 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-12-16 09:20:54,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 09:20:54,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 09:20:54,158 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 09:20:54,160 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 09:20:54,229 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 09:20:54,234 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 09:20:54,235 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-16 09:20:54,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:20:54 BoogieIcfgContainer [2021-12-16 09:20:54,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 09:20:54,239 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-16 09:20:54,239 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-16 09:20:54,242 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-16 09:20:54,242 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:20:54,243 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.12 09:20:53" (1/3) ... [2021-12-16 09:20:54,244 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46f35215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:20:54, skipping insertion in model container [2021-12-16 09:20:54,244 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:20:54,244 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:20:53" (2/3) ... [2021-12-16 09:20:54,244 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46f35215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:20:54, skipping insertion in model container [2021-12-16 09:20:54,244 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:20:54,245 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:20:54" (3/3) ... [2021-12-16 09:20:54,246 INFO L388 chiAutomizerObserver]: Analyzing ICFG Urban-WST2013-Fig2-modified1000.c [2021-12-16 09:20:54,290 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-16 09:20:54,291 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-16 09:20:54,291 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-16 09:20:54,291 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-16 09:20:54,291 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-16 09:20:54,291 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-16 09:20:54,291 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-16 09:20:54,292 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-16 09:20:54,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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-12-16 09:20:54,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-16 09:20:54,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:20:54,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:20:54,322 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:20:54,322 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-16 09:20:54,323 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-16 09:20:54,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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-12-16 09:20:54,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-16 09:20:54,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:20:54,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:20:54,325 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:20:54,325 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-16 09:20:54,330 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 3#L19-2true [2021-12-16 09:20:54,331 INFO L793 eck$LassoCheckResult]: Loop: 3#L19-2true assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 1000; 7#L21-2true assume !(main_~x2~0#1 > 1); 5#L21-3true main_~x1~0#1 := 1 + main_~x1~0#1; 3#L19-2true [2021-12-16 09:20:54,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:20:54,337 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-16 09:20:54,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:20:54,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723196552] [2021-12-16 09:20:54,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:20:54,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:20:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:20:54,408 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:20:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:20:54,425 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:20:54,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:20:54,428 INFO L85 PathProgramCache]: Analyzing trace with hash 40944, now seen corresponding path program 1 times [2021-12-16 09:20:54,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:20:54,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934303468] [2021-12-16 09:20:54,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:20:54,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:20:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:20:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:20:54,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:20:54,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934303468] [2021-12-16 09:20:54,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934303468] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:20:54,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:20:54,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 09:20:54,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396731381] [2021-12-16 09:20:54,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:20:54,508 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:20:54,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:20:54,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:20:54,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:20:54,536 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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-12-16 09:20:54,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:20:54,575 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2021-12-16 09:20:54,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:20:54,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2021-12-16 09:20:54,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-16 09:20:54,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 6 states and 7 transitions. [2021-12-16 09:20:54,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-12-16 09:20:54,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-12-16 09:20:54,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2021-12-16 09:20:54,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:20:54,584 INFO L681 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2021-12-16 09:20:54,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2021-12-16 09:20:54,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2021-12-16 09:20:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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-12-16 09:20:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2021-12-16 09:20:54,632 INFO L704 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2021-12-16 09:20:54,632 INFO L587 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2021-12-16 09:20:54,632 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-16 09:20:54,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2021-12-16 09:20:54,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-16 09:20:54,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:20:54,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:20:54,633 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:20:54,633 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-16 09:20:54,634 INFO L791 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 32#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 28#L19-2 [2021-12-16 09:20:54,634 INFO L793 eck$LassoCheckResult]: Loop: 28#L19-2 assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 1000; 29#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 33#L21-2 assume !(main_~x2~0#1 > 1); 30#L21-3 main_~x1~0#1 := 1 + main_~x1~0#1; 28#L19-2 [2021-12-16 09:20:54,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:20:54,634 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-16 09:20:54,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:20:54,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551751917] [2021-12-16 09:20:54,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:20:54,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:20:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:20:54,638 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:20:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:20:54,640 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:20:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:20:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1271024, now seen corresponding path program 1 times [2021-12-16 09:20:54,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:20:54,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256334377] [2021-12-16 09:20:54,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:20:54,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:20:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:20:54,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:20:54,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:20:54,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256334377] [2021-12-16 09:20:54,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256334377] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:20:54,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958867601] [2021-12-16 09:20:54,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:20:54,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:20:54,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:20:54,669 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:20:54,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-16 09:20:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:20:54,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 09:20:54,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:20:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:20:54,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:20:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:20:54,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958867601] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:20:54,776 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:20:54,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2021-12-16 09:20:54,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929335397] [2021-12-16 09:20:54,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:20:54,777 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:20:54,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:20:54,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 09:20:54,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-16 09:20:54,778 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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-12-16 09:20:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:20:54,791 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2021-12-16 09:20:54,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 09:20:54,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2021-12-16 09:20:54,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-16 09:20:54,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2021-12-16 09:20:54,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-16 09:20:54,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-16 09:20:54,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2021-12-16 09:20:54,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:20:54,794 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-12-16 09:20:54,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2021-12-16 09:20:54,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-12-16 09:20:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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-12-16 09:20:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2021-12-16 09:20:54,796 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-12-16 09:20:54,796 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-12-16 09:20:54,796 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-16 09:20:54,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2021-12-16 09:20:54,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-16 09:20:54,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:20:54,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:20:54,798 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:20:54,798 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 1, 1, 1] [2021-12-16 09:20:54,798 INFO L791 eck$LassoCheckResult]: Stem: 73#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 74#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 70#L19-2 [2021-12-16 09:20:54,798 INFO L793 eck$LassoCheckResult]: Loop: 70#L19-2 assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 1000; 71#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 75#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 78#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 77#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 76#L21-2 assume !(main_~x2~0#1 > 1); 72#L21-3 main_~x1~0#1 := 1 + main_~x1~0#1; 70#L19-2 [2021-12-16 09:20:54,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:20:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-16 09:20:54,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:20:54,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128331620] [2021-12-16 09:20:54,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:20:54,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:20:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:20:54,803 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:20:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:20:54,804 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:20:54,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:20:54,805 INFO L85 PathProgramCache]: Analyzing trace with hash -787882000, now seen corresponding path program 2 times [2021-12-16 09:20:54,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:20:54,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736896826] [2021-12-16 09:20:54,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:20:54,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:20:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:20:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:20:54,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:20:54,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736896826] [2021-12-16 09:20:54,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736896826] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:20:54,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45492103] [2021-12-16 09:20:54,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 09:20:54,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:20:54,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:20:54,859 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:20:54,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-16 09:20:54,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 09:20:54,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:20:54,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:20:54,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:20:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:20:54,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:20:54,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:20:54,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45492103] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:20:54,999 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:20:54,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-12-16 09:20:54,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748559798] [2021-12-16 09:20:55,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:20:55,000 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:20:55,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:20:55,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 09:20:55,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-12-16 09:20:55,001 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 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-12-16 09:20:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:20:55,020 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2021-12-16 09:20:55,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 09:20:55,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2021-12-16 09:20:55,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-12-16 09:20:55,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2021-12-16 09:20:55,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-16 09:20:55,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-12-16 09:20:55,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2021-12-16 09:20:55,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:20:55,023 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-12-16 09:20:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2021-12-16 09:20:55,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-16 09:20:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 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-12-16 09:20:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-12-16 09:20:55,025 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-12-16 09:20:55,025 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-12-16 09:20:55,025 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-16 09:20:55,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2021-12-16 09:20:55,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-12-16 09:20:55,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:20:55,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:20:55,027 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:20:55,027 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 1, 1, 1] [2021-12-16 09:20:55,027 INFO L791 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 149#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 145#L19-2 [2021-12-16 09:20:55,027 INFO L793 eck$LassoCheckResult]: Loop: 145#L19-2 assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 1000; 146#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 150#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 159#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 158#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 157#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 156#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 155#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 154#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 153#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 152#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 151#L21-2 assume !(main_~x2~0#1 > 1); 147#L21-3 main_~x1~0#1 := 1 + main_~x1~0#1; 145#L19-2 [2021-12-16 09:20:55,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:20:55,028 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-16 09:20:55,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:20:55,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486124772] [2021-12-16 09:20:55,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:20:55,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:20:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:20:55,032 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:20:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:20:55,034 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:20:55,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:20:55,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1798029296, now seen corresponding path program 3 times [2021-12-16 09:20:55,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:20:55,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302809034] [2021-12-16 09:20:55,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:20:55,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:20:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:20:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:20:55,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:20:55,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302809034] [2021-12-16 09:20:55,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302809034] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:20:55,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398642341] [2021-12-16 09:20:55,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 09:20:55,154 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:20:55,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:20:55,196 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:20:55,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-16 09:20:55,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-16 09:20:55,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:20:55,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 09:20:55,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:20:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:20:55,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:20:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:20:55,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398642341] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:20:55,477 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:20:55,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2021-12-16 09:20:55,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17143138] [2021-12-16 09:20:55,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:20:55,480 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:20:55,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:20:55,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-16 09:20:55,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2021-12-16 09:20:55,484 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand has 24 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 23 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-12-16 09:20:55,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:20:55,537 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2021-12-16 09:20:55,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-16 09:20:55,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2021-12-16 09:20:55,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-16 09:20:55,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2021-12-16 09:20:55,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-12-16 09:20:55,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2021-12-16 09:20:55,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2021-12-16 09:20:55,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:20:55,540 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-12-16 09:20:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2021-12-16 09:20:55,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-16 09:20:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 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-12-16 09:20:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-12-16 09:20:55,543 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-12-16 09:20:55,543 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-12-16 09:20:55,543 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-16 09:20:55,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2021-12-16 09:20:55,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-16 09:20:55,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:20:55,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:20:55,545 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:20:55,545 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [22, 1, 1, 1] [2021-12-16 09:20:55,545 INFO L791 eck$LassoCheckResult]: Stem: 289#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 290#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 286#L19-2 [2021-12-16 09:20:55,545 INFO L793 eck$LassoCheckResult]: Loop: 286#L19-2 assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 1000; 287#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 291#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 312#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 311#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 310#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 309#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 308#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 307#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 306#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 305#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 304#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 303#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 302#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 301#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 300#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 299#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 298#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 297#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 296#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 295#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 294#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 293#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 292#L21-2 assume !(main_~x2~0#1 > 1); 288#L21-3 main_~x1~0#1 := 1 + main_~x1~0#1; 286#L19-2 [2021-12-16 09:20:55,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:20:55,546 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-16 09:20:55,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:20:55,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789018470] [2021-12-16 09:20:55,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:20:55,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:20:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:20:55,549 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:20:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:20:55,550 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:20:55,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:20:55,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1296597008, now seen corresponding path program 4 times [2021-12-16 09:20:55,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:20:55,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254052043] [2021-12-16 09:20:55,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:20:55,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:20:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:20:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:20:55,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:20:55,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254052043] [2021-12-16 09:20:55,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254052043] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:20:55,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609611361] [2021-12-16 09:20:55,883 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 09:20:55,883 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:20:55,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:20:55,892 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:20:55,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-16 09:20:55,942 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 09:20:55,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:20:55,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-16 09:20:55,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:20:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:20:56,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:20:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:20:56,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609611361] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:20:56,745 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:20:56,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2021-12-16 09:20:56,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474071965] [2021-12-16 09:20:56,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:20:56,746 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:20:56,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:20:56,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-16 09:20:56,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2021-12-16 09:20:56,749 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. cyclomatic complexity: 2 Second operand has 48 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 47 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-12-16 09:20:56,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:20:56,818 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2021-12-16 09:20:56,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-12-16 09:20:56,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 52 transitions. [2021-12-16 09:20:56,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2021-12-16 09:20:56,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 52 transitions. [2021-12-16 09:20:56,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2021-12-16 09:20:56,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2021-12-16 09:20:56,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 52 transitions. [2021-12-16 09:20:56,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:20:56,831 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 52 transitions. [2021-12-16 09:20:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 52 transitions. [2021-12-16 09:20:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-16 09:20:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 50 states have internal predecessors, (52), 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-12-16 09:20:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2021-12-16 09:20:56,838 INFO L704 BuchiCegarLoop]: Abstraction has 51 states and 52 transitions. [2021-12-16 09:20:56,838 INFO L587 BuchiCegarLoop]: Abstraction has 51 states and 52 transitions. [2021-12-16 09:20:56,838 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-16 09:20:56,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 52 transitions. [2021-12-16 09:20:56,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2021-12-16 09:20:56,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:20:56,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:20:56,841 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:20:56,841 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [46, 1, 1, 1] [2021-12-16 09:20:56,842 INFO L791 eck$LassoCheckResult]: Stem: 562#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 563#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 559#L19-2 [2021-12-16 09:20:56,842 INFO L793 eck$LassoCheckResult]: Loop: 559#L19-2 assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 1000; 560#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 564#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 609#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 608#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 607#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 606#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 605#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 604#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 603#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 602#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 601#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 600#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 599#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 598#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 597#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 596#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 595#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 594#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 593#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 592#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 591#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 590#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 589#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 588#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 587#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 586#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 585#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 584#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 583#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 582#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 581#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 580#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 579#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 578#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 577#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 576#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 575#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 574#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 573#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 572#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 571#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 570#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 569#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 568#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 567#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 566#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 565#L21-2 assume !(main_~x2~0#1 > 1); 561#L21-3 main_~x1~0#1 := 1 + main_~x1~0#1; 559#L19-2 [2021-12-16 09:20:56,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:20:56,842 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-16 09:20:56,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:20:56,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30601918] [2021-12-16 09:20:56,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:20:56,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:20:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:20:56,846 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:20:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:20:56,848 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:20:56,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:20:56,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1762721808, now seen corresponding path program 5 times [2021-12-16 09:20:56,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:20:56,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486569104] [2021-12-16 09:20:56,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:20:56,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:20:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:20:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:20:57,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:20:57,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486569104] [2021-12-16 09:20:57,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486569104] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:20:57,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152972208] [2021-12-16 09:20:57,814 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 09:20:57,814 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:20:57,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:20:57,817 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:20:57,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-16 09:20:57,858 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2021-12-16 09:20:57,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:20:57,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-16 09:20:57,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:20:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:20:58,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:21:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:21:00,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152972208] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:21:00,311 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:21:00,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2021-12-16 09:21:00,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370900320] [2021-12-16 09:21:00,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:21:00,312 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:21:00,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:00,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2021-12-16 09:21:00,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2021-12-16 09:21:00,317 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. cyclomatic complexity: 2 Second operand has 96 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 95 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-12-16 09:21:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:00,491 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2021-12-16 09:21:00,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-12-16 09:21:00,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 100 transitions. [2021-12-16 09:21:00,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 97 [2021-12-16 09:21:00,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 100 transitions. [2021-12-16 09:21:00,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2021-12-16 09:21:00,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2021-12-16 09:21:00,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 100 transitions. [2021-12-16 09:21:00,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:21:00,502 INFO L681 BuchiCegarLoop]: Abstraction has 99 states and 100 transitions. [2021-12-16 09:21:00,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 100 transitions. [2021-12-16 09:21:00,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-12-16 09:21:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 98 states have internal predecessors, (100), 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-12-16 09:21:00,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2021-12-16 09:21:00,512 INFO L704 BuchiCegarLoop]: Abstraction has 99 states and 100 transitions. [2021-12-16 09:21:00,512 INFO L587 BuchiCegarLoop]: Abstraction has 99 states and 100 transitions. [2021-12-16 09:21:00,512 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-16 09:21:00,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 100 transitions. [2021-12-16 09:21:00,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 97 [2021-12-16 09:21:00,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:00,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:00,518 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:21:00,518 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [94, 1, 1, 1] [2021-12-16 09:21:00,518 INFO L791 eck$LassoCheckResult]: Stem: 1099#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1100#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 1096#L19-2 [2021-12-16 09:21:00,520 INFO L793 eck$LassoCheckResult]: Loop: 1096#L19-2 assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 1000; 1097#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1101#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1194#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1193#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1192#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1191#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1190#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1189#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1188#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1187#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1186#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1185#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1184#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1183#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1182#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1181#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1180#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1179#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1178#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1177#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1176#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1175#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1174#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1173#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1172#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1171#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1170#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1169#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1168#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1167#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1166#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1165#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1164#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1163#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1162#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1161#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1160#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1159#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1158#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1157#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1156#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1155#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1154#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1153#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1152#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1151#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1150#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1149#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1148#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1147#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1146#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1145#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1144#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1143#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1142#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1141#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1140#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1139#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1138#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1137#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1136#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1135#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1134#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1133#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1132#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1131#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1130#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1129#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1128#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1127#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1126#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1125#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1124#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1123#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1122#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1121#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1120#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1119#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1118#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1117#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1116#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1115#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1114#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1113#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1112#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1111#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1110#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1109#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1108#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1107#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1106#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1105#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1104#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1103#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 1102#L21-2 assume !(main_~x2~0#1 > 1); 1098#L21-3 main_~x1~0#1 := 1 + main_~x1~0#1; 1096#L19-2 [2021-12-16 09:21:00,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:00,520 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-12-16 09:21:00,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:00,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605654591] [2021-12-16 09:21:00,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:00,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:00,524 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:00,529 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:00,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:00,529 INFO L85 PathProgramCache]: Analyzing trace with hash -203554832, now seen corresponding path program 6 times [2021-12-16 09:21:00,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:00,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030327246] [2021-12-16 09:21:00,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:00,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:03,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:21:03,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:03,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030327246] [2021-12-16 09:21:03,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030327246] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:21:03,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96949261] [2021-12-16 09:21:03,477 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-16 09:21:03,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:03,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:03,481 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:21:03,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-16 09:21:03,568 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2021-12-16 09:21:03,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:21:03,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 96 conjunts are in the unsatisfiable core [2021-12-16 09:21:03,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:21:03,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:21:11,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:21:11,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96949261] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:21:11,997 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:21:11,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2021-12-16 09:21:11,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535416291] [2021-12-16 09:21:11,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:21:11,998 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:21:11,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:12,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2021-12-16 09:21:12,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2021-12-16 09:21:12,007 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. cyclomatic complexity: 2 Second operand has 192 states, 192 states have (on average 1.0052083333333333) internal successors, (193), 191 states have internal predecessors, (193), 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-12-16 09:21:12,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:12,323 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2021-12-16 09:21:12,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2021-12-16 09:21:12,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 196 transitions. [2021-12-16 09:21:12,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 193 [2021-12-16 09:21:12,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 195 states and 196 transitions. [2021-12-16 09:21:12,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 195 [2021-12-16 09:21:12,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 195 [2021-12-16 09:21:12,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 196 transitions. [2021-12-16 09:21:12,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:21:12,327 INFO L681 BuchiCegarLoop]: Abstraction has 195 states and 196 transitions. [2021-12-16 09:21:12,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 196 transitions. [2021-12-16 09:21:12,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-12-16 09:21:12,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 195 states have (on average 1.005128205128205) internal successors, (196), 194 states have internal predecessors, (196), 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-12-16 09:21:12,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2021-12-16 09:21:12,334 INFO L704 BuchiCegarLoop]: Abstraction has 195 states and 196 transitions. [2021-12-16 09:21:12,334 INFO L587 BuchiCegarLoop]: Abstraction has 195 states and 196 transitions. [2021-12-16 09:21:12,334 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-16 09:21:12,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 196 transitions. [2021-12-16 09:21:12,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 193 [2021-12-16 09:21:12,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:12,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:12,337 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:21:12,337 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [190, 1, 1, 1] [2021-12-16 09:21:12,337 INFO L791 eck$LassoCheckResult]: Stem: 2164#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2165#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 2161#L19-2 [2021-12-16 09:21:12,337 INFO L793 eck$LassoCheckResult]: Loop: 2161#L19-2 assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 1000; 2162#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2166#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2355#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2354#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2353#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2352#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2351#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2350#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2349#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2348#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2347#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2346#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2345#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2344#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2343#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2342#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2341#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2340#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2339#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2338#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2337#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2336#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2335#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2334#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2333#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2332#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2331#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2330#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2329#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2328#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2327#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2326#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2325#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2324#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2323#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2322#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2321#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2320#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2319#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2318#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2317#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2316#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2315#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2314#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2313#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2312#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2311#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2310#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2309#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2308#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2307#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2306#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2305#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2304#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2303#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2302#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2301#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2300#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2299#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2298#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2297#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2296#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2295#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2294#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2293#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2292#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2291#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2290#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2289#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2288#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2287#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2286#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2285#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2284#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2283#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2282#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2281#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2280#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2279#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2278#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2277#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2276#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2275#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2274#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2273#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2272#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2271#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2270#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2269#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2268#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2267#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2266#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2265#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2264#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2263#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2262#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2261#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2260#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2259#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2258#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2257#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2256#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2255#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2254#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2253#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2252#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2251#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2250#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2249#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2248#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2247#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2246#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2245#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2244#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2243#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2242#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2241#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2240#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2239#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2238#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2237#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2236#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2235#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2234#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2233#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2232#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2231#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2230#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2229#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2228#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2227#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2226#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2225#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2224#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2223#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2222#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2221#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2220#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2219#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2218#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2217#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2216#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2215#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2214#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2213#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2212#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2211#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2210#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2209#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2208#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2207#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2206#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2205#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2204#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2203#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2202#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2201#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2200#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2199#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2198#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2197#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2196#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2195#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2194#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2193#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2192#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2191#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2190#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2189#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2188#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2187#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2186#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2185#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2184#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2183#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2182#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2181#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2180#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2179#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2178#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2177#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2176#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2175#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2174#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2173#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2172#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2171#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2170#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2169#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2168#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 2167#L21-2 assume !(main_~x2~0#1 > 1); 2163#L21-3 main_~x1~0#1 := 1 + main_~x1~0#1; 2161#L19-2 [2021-12-16 09:21:12,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:12,338 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-12-16 09:21:12,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:12,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718986627] [2021-12-16 09:21:12,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:12,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:12,340 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:12,342 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:12,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:12,342 INFO L85 PathProgramCache]: Analyzing trace with hash -4456464, now seen corresponding path program 7 times [2021-12-16 09:21:12,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:12,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58967253] [2021-12-16 09:21:12,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:12,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:23,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:21:23,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:23,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58967253] [2021-12-16 09:21:23,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58967253] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:21:23,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131151552] [2021-12-16 09:21:23,614 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-16 09:21:23,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:23,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:23,615 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:21:23,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-16 09:21:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:23,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 192 conjunts are in the unsatisfiable core [2021-12-16 09:21:23,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:21:24,139 INFO L328 TraceCheckSpWp]: Computing backward predicates...