./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c 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/systemc/toy2.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 04:23:05,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:23:05,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:23:06,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:23:06,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:23:06,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:23:06,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:23:06,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:23:06,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:23:06,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:23:06,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:23:06,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:23:06,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:23:06,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:23:06,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:23:06,054 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:23:06,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:23:06,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:23:06,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:23:06,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:23:06,064 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:23:06,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:23:06,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:23:06,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:23:06,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:23:06,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:23:06,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:23:06,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:23:06,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:23:06,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:23:06,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:23:06,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:23:06,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:23:06,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:23:06,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:23:06,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:23:06,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:23:06,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:23:06,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:23:06,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:23:06,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:23:06,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:23:06,085 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:23:06,122 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:23:06,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:23:06,123 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:23:06,123 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:23:06,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:23:06,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:23:06,125 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:23:06,125 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:23:06,125 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:23:06,126 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:23:06,126 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:23:06,127 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:23:06,127 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:23:06,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:23:06,127 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:23:06,127 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:23:06,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:23:06,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:23:06,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:23:06,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:23:06,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:23:06,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:23:06,129 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:23:06,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:23:06,129 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:23:06,129 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:23:06,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:23:06,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:23:06,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:23:06,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:23:06,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:23:06,132 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:23:06,132 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 [2022-07-13 04:23:06,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:23:06,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:23:06,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:23:06,398 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:23:06,407 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:23:06,408 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy2.cil.c [2022-07-13 04:23:06,454 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e3dca89/2bbfab9a9fd5457d877cfd453ec60316/FLAG0d61c3cbb [2022-07-13 04:23:06,822 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:23:06,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2022-07-13 04:23:06,830 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e3dca89/2bbfab9a9fd5457d877cfd453ec60316/FLAG0d61c3cbb [2022-07-13 04:23:07,233 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e3dca89/2bbfab9a9fd5457d877cfd453ec60316 [2022-07-13 04:23:07,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:23:07,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:23:07,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:23:07,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:23:07,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:23:07,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:23:07" (1/1) ... [2022-07-13 04:23:07,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b69776a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:23:07, skipping insertion in model container [2022-07-13 04:23:07,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:23:07" (1/1) ... [2022-07-13 04:23:07,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:23:07,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:23:07,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c[698,711] [2022-07-13 04:23:07,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:23:07,496 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:23:07,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c[698,711] [2022-07-13 04:23:07,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:23:07,550 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:23:07,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:23:07 WrapperNode [2022-07-13 04:23:07,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:23:07,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:23:07,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:23:07,552 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:23:07,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:23:07" (1/1) ... [2022-07-13 04:23:07,566 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:23:07" (1/1) ... [2022-07-13 04:23:07,590 INFO L137 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 356 [2022-07-13 04:23:07,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:23:07,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:23:07,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:23:07,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:23:07,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:23:07" (1/1) ... [2022-07-13 04:23:07,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:23:07" (1/1) ... [2022-07-13 04:23:07,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:23:07" (1/1) ... [2022-07-13 04:23:07,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:23:07" (1/1) ... [2022-07-13 04:23:07,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:23:07" (1/1) ... [2022-07-13 04:23:07,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:23:07" (1/1) ... [2022-07-13 04:23:07,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:23:07" (1/1) ... [2022-07-13 04:23:07,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:23:07,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:23:07,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:23:07,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:23:07,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:23:07" (1/1) ... [2022-07-13 04:23:07,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:07,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:07,662 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) [2022-07-13 04:23:07,674 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 [2022-07-13 04:23:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 04:23:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 04:23:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:23:07,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:23:07,753 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:23:07,754 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:23:08,099 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:23:08,111 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:23:08,117 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-13 04:23:08,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:23:08 BoogieIcfgContainer [2022-07-13 04:23:08,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:23:08,127 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:23:08,127 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:23:08,130 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:23:08,131 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:23:08,131 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:23:07" (1/3) ... [2022-07-13 04:23:08,132 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16feae6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:23:08, skipping insertion in model container [2022-07-13 04:23:08,132 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:23:08,132 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:23:07" (2/3) ... [2022-07-13 04:23:08,133 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16feae6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:23:08, skipping insertion in model container [2022-07-13 04:23:08,133 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:23:08,133 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:23:08" (3/3) ... [2022-07-13 04:23:08,134 INFO L354 chiAutomizerObserver]: Analyzing ICFG toy2.cil.c [2022-07-13 04:23:08,186 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:23:08,186 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:23:08,186 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:23:08,186 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:23:08,186 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:23:08,186 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:23:08,186 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:23:08,187 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:23:08,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.8294573643410852) internal successors, (236), 129 states have internal predecessors, (236), 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) [2022-07-13 04:23:08,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-13 04:23:08,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:23:08,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:23:08,223 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:08,224 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:08,224 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:23:08,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.8294573643410852) internal successors, (236), 129 states have internal predecessors, (236), 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) [2022-07-13 04:23:08,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-13 04:23:08,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:23:08,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:23:08,243 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:08,244 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:08,252 INFO L752 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 46#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 113#L404true assume !(1 == ~c_req_up~0); 66#L404-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 25#L415-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 55#L420-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 89#L425-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 43#L430-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 125#L435-1true assume !(0 == ~e_f~0); 31#L440-1true assume !(0 == ~e_g~0); 48#L445-1true assume !(0 == ~e_e~0); 51#L450-1true assume !(0 == ~e_c~0); 24#L455-1true assume !(0 == ~e_wl~0); 81#L460-1true assume !(1 == ~wl_pc~0); 38#L472true assume !(2 == ~wl_pc~0); 122#L473true assume !(1 == ~c1_pc~0); 103#L483true assume !(1 == ~c2_pc~0); 114#L492true assume !(1 == ~wb_pc~0); 57#L501true assume !(1 == ~e_c~0); 36#L510-1true assume !(1 == ~e_e~0); 26#L515-1true assume !(1 == ~e_f~0); 15#L520-1true assume !(1 == ~e_g~0); 49#L525-1true assume !(1 == ~e_c~0); 86#L530-1true assume !(1 == ~e_wl~0); 68#L672-1true [2022-07-13 04:23:08,253 INFO L754 eck$LassoCheckResult]: Loop: 68#L672-1true assume !false; 8#L542true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 127#L377true assume !true; 23#L393true assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 67#L548true assume !(1 == ~c_req_up~0); 11#L548-2true start_simulation_~kernel_st~0#1 := 3; 28#L560true assume 0 == ~e_f~0;~e_f~0 := 1; 97#L560-2true assume 0 == ~e_g~0;~e_g~0 := 1; 19#L565-1true assume 0 == ~e_e~0;~e_e~0 := 1; 128#L570-1true assume 0 == ~e_c~0;~e_c~0 := 1; 39#L575-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 123#L580-1true assume 1 == ~wl_pc~0; 101#L586true assume 1 == ~e_wl~0;~wl_st~0 := 0; 84#L593true assume !(1 == ~c1_pc~0); 115#L603true assume !(1 == ~c2_pc~0); 4#L612true assume !(1 == ~wb_pc~0); 65#L621true assume !(1 == ~e_c~0); 63#L630-1true assume 1 == ~e_e~0;~e_e~0 := 2; 130#L635-1true assume 1 == ~e_f~0;~e_f~0 := 2; 129#L640-1true assume 1 == ~e_g~0;~e_g~0 := 2; 111#L645-1true assume 1 == ~e_c~0;~e_c~0 := 2; 13#L650-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 44#L655-1true assume 0 == ~wl_st~0; 68#L672-1true [2022-07-13 04:23:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:08,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2022-07-13 04:23:08,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:08,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530859692] [2022-07-13 04:23:08,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:08,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:08,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:08,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530859692] [2022-07-13 04:23:08,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530859692] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:08,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:08,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:23:08,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139573994] [2022-07-13 04:23:08,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:08,494 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:23:08,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:08,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1920133393, now seen corresponding path program 1 times [2022-07-13 04:23:08,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:08,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769563715] [2022-07-13 04:23:08,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:08,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:08,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:08,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769563715] [2022-07-13 04:23:08,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769563715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:08,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:08,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 04:23:08,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689405351] [2022-07-13 04:23:08,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:08,555 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:23:08,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:23:08,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 04:23:08,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 04:23:08,590 INFO L87 Difference]: Start difference. First operand has 130 states, 129 states have (on average 1.8294573643410852) internal successors, (236), 129 states have internal predecessors, (236), 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 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:23:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:23:08,614 INFO L93 Difference]: Finished difference Result 129 states and 222 transitions. [2022-07-13 04:23:08,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 04:23:08,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 222 transitions. [2022-07-13 04:23:08,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-13 04:23:08,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 124 states and 217 transitions. [2022-07-13 04:23:08,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-13 04:23:08,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-13 04:23:08,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 217 transitions. [2022-07-13 04:23:08,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:23:08,641 INFO L369 hiAutomatonCegarLoop]: Abstraction has 124 states and 217 transitions. [2022-07-13 04:23:08,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 217 transitions. [2022-07-13 04:23:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-13 04:23:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.75) internal successors, (217), 123 states have internal predecessors, (217), 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) [2022-07-13 04:23:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 217 transitions. [2022-07-13 04:23:08,674 INFO L392 hiAutomatonCegarLoop]: Abstraction has 124 states and 217 transitions. [2022-07-13 04:23:08,674 INFO L374 stractBuchiCegarLoop]: Abstraction has 124 states and 217 transitions. [2022-07-13 04:23:08,674 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:23:08,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 217 transitions. [2022-07-13 04:23:08,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-13 04:23:08,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:23:08,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:23:08,680 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:08,680 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:08,680 INFO L752 eck$LassoCheckResult]: Stem: 389#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 346#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 347#L404 assume !(1 == ~c_req_up~0); 367#L404-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 314#L415-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 315#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 360#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 343#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 344#L435-1 assume !(0 == ~e_f~0); 323#L440-1 assume !(0 == ~e_g~0); 324#L445-1 assume !(0 == ~e_e~0); 350#L450-1 assume !(0 == ~e_c~0); 312#L455-1 assume !(0 == ~e_wl~0); 313#L460-1 assume !(1 == ~wl_pc~0); 332#L472 assume !(2 == ~wl_pc~0); 333#L473 assume !(1 == ~c1_pc~0); 384#L483 assume !(1 == ~c2_pc~0); 298#L492 assume !(1 == ~wb_pc~0); 349#L501 assume !(1 == ~e_c~0); 330#L510-1 assume !(1 == ~e_e~0); 316#L515-1 assume !(1 == ~e_f~0); 295#L520-1 assume !(1 == ~e_g~0); 296#L525-1 assume !(1 == ~e_c~0); 351#L530-1 assume !(1 == ~e_wl~0); 293#L672-1 [2022-07-13 04:23:08,685 INFO L754 eck$LassoCheckResult]: Loop: 293#L672-1 assume !false; 281#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 269#L377 assume !false; 276#L295 assume !(0 == ~wl_st~0); 278#L299 assume !(0 == ~c1_st~0); 342#L302 assume !(0 == ~c2_st~0); 368#L305 assume !(0 == ~wb_st~0); 288#L308 assume !(0 == ~r_st~0); 289#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 311#L548 assume !(1 == ~c_req_up~0); 286#L548-2 start_simulation_~kernel_st~0#1 := 3; 287#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 319#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 305#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 306#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 338#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 339#L580-1 assume !(1 == ~wl_pc~0); 308#L592 assume !(2 == ~wl_pc~0); 309#L593 assume !(1 == ~c1_pc~0); 359#L603 assume !(1 == ~c2_pc~0); 270#L612 assume !(1 == ~wb_pc~0); 272#L621 assume !(1 == ~e_c~0); 364#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 365#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 391#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 388#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 290#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 291#L655-1 assume 0 == ~wl_st~0; 293#L672-1 [2022-07-13 04:23:08,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:08,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2022-07-13 04:23:08,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:08,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539188550] [2022-07-13 04:23:08,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:08,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:08,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:08,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:08,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539188550] [2022-07-13 04:23:08,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539188550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:08,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:08,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:23:08,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660685496] [2022-07-13 04:23:08,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:08,739 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:23:08,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:08,740 INFO L85 PathProgramCache]: Analyzing trace with hash 86756478, now seen corresponding path program 1 times [2022-07-13 04:23:08,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:08,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780592879] [2022-07-13 04:23:08,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:08,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:08,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:08,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780592879] [2022-07-13 04:23:08,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780592879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:08,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:08,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:23:08,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523271971] [2022-07-13 04:23:08,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:08,775 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:23:08,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:23:08,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:23:08,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:23:08,777 INFO L87 Difference]: Start difference. First operand 124 states and 217 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-07-13 04:23:08,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:23:08,806 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2022-07-13 04:23:08,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:23:08,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 216 transitions. [2022-07-13 04:23:08,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-13 04:23:08,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 216 transitions. [2022-07-13 04:23:08,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-13 04:23:08,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-13 04:23:08,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 216 transitions. [2022-07-13 04:23:08,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:23:08,815 INFO L369 hiAutomatonCegarLoop]: Abstraction has 124 states and 216 transitions. [2022-07-13 04:23:08,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 216 transitions. [2022-07-13 04:23:08,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-13 04:23:08,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7419354838709677) internal successors, (216), 123 states have internal predecessors, (216), 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) [2022-07-13 04:23:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 216 transitions. [2022-07-13 04:23:08,827 INFO L392 hiAutomatonCegarLoop]: Abstraction has 124 states and 216 transitions. [2022-07-13 04:23:08,827 INFO L374 stractBuchiCegarLoop]: Abstraction has 124 states and 216 transitions. [2022-07-13 04:23:08,827 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:23:08,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 216 transitions. [2022-07-13 04:23:08,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-13 04:23:08,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:23:08,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:23:08,831 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:08,831 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:08,832 INFO L752 eck$LassoCheckResult]: Stem: 644#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 601#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 602#L404 assume !(1 == ~c_req_up~0); 622#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 569#L415-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 570#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 615#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 598#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 599#L435-1 assume !(0 == ~e_f~0); 578#L440-1 assume !(0 == ~e_g~0); 579#L445-1 assume !(0 == ~e_e~0); 605#L450-1 assume !(0 == ~e_c~0); 567#L455-1 assume !(0 == ~e_wl~0); 568#L460-1 assume !(1 == ~wl_pc~0); 587#L472 assume !(2 == ~wl_pc~0); 588#L473 assume !(1 == ~c1_pc~0); 639#L483 assume !(1 == ~c2_pc~0); 553#L492 assume !(1 == ~wb_pc~0); 604#L501 assume !(1 == ~e_c~0); 585#L510-1 assume !(1 == ~e_e~0); 571#L515-1 assume !(1 == ~e_f~0); 550#L520-1 assume !(1 == ~e_g~0); 551#L525-1 assume !(1 == ~e_c~0); 606#L530-1 assume !(1 == ~e_wl~0); 548#L672-1 [2022-07-13 04:23:08,832 INFO L754 eck$LassoCheckResult]: Loop: 548#L672-1 assume !false; 536#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 524#L377 assume !false; 531#L295 assume !(0 == ~wl_st~0); 533#L299 assume !(0 == ~c1_st~0); 597#L302 assume !(0 == ~c2_st~0); 623#L305 assume !(0 == ~wb_st~0); 543#L308 assume !(0 == ~r_st~0); 544#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 566#L548 assume !(1 == ~c_req_up~0); 541#L548-2 start_simulation_~kernel_st~0#1 := 3; 542#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 574#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 560#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 561#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 593#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 594#L580-1 assume !(1 == ~wl_pc~0); 563#L592 assume !(2 == ~wl_pc~0); 564#L593 assume !(1 == ~c1_pc~0); 614#L603 assume !(1 == ~c2_pc~0); 525#L612 assume !(1 == ~wb_pc~0); 527#L621 assume !(1 == ~e_c~0); 619#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 620#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 646#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 643#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 545#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 546#L655-1 assume 0 == ~wl_st~0; 548#L672-1 [2022-07-13 04:23:08,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:08,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2022-07-13 04:23:08,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:08,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484845068] [2022-07-13 04:23:08,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:08,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:08,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:08,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484845068] [2022-07-13 04:23:08,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484845068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:08,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:08,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:23:08,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399617782] [2022-07-13 04:23:08,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:08,882 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:23:08,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:08,884 INFO L85 PathProgramCache]: Analyzing trace with hash 86756478, now seen corresponding path program 2 times [2022-07-13 04:23:08,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:08,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413962579] [2022-07-13 04:23:08,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:08,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:08,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:08,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413962579] [2022-07-13 04:23:08,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413962579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:08,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:08,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:23:08,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830348206] [2022-07-13 04:23:08,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:08,938 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:23:08,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:23:08,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:23:08,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:23:08,940 INFO L87 Difference]: Start difference. First operand 124 states and 216 transitions. cyclomatic complexity: 93 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-07-13 04:23:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:23:08,955 INFO L93 Difference]: Finished difference Result 124 states and 215 transitions. [2022-07-13 04:23:08,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:23:08,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 215 transitions. [2022-07-13 04:23:08,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-13 04:23:08,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 215 transitions. [2022-07-13 04:23:08,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-13 04:23:08,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-13 04:23:08,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 215 transitions. [2022-07-13 04:23:08,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:23:08,961 INFO L369 hiAutomatonCegarLoop]: Abstraction has 124 states and 215 transitions. [2022-07-13 04:23:08,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 215 transitions. [2022-07-13 04:23:08,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-13 04:23:08,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 123 states have internal predecessors, (215), 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) [2022-07-13 04:23:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 215 transitions. [2022-07-13 04:23:08,966 INFO L392 hiAutomatonCegarLoop]: Abstraction has 124 states and 215 transitions. [2022-07-13 04:23:08,966 INFO L374 stractBuchiCegarLoop]: Abstraction has 124 states and 215 transitions. [2022-07-13 04:23:08,966 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:23:08,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 215 transitions. [2022-07-13 04:23:08,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-13 04:23:08,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:23:08,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:23:08,968 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:08,968 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:08,969 INFO L752 eck$LassoCheckResult]: Stem: 899#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 856#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 857#L404 assume !(1 == ~c_req_up~0); 877#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 824#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 825#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 870#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 853#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 854#L435-1 assume !(0 == ~e_f~0); 833#L440-1 assume !(0 == ~e_g~0); 834#L445-1 assume !(0 == ~e_e~0); 860#L450-1 assume !(0 == ~e_c~0); 822#L455-1 assume !(0 == ~e_wl~0); 823#L460-1 assume !(1 == ~wl_pc~0); 842#L472 assume !(2 == ~wl_pc~0); 843#L473 assume !(1 == ~c1_pc~0); 894#L483 assume !(1 == ~c2_pc~0); 808#L492 assume !(1 == ~wb_pc~0); 859#L501 assume !(1 == ~e_c~0); 840#L510-1 assume !(1 == ~e_e~0); 826#L515-1 assume !(1 == ~e_f~0); 805#L520-1 assume !(1 == ~e_g~0); 806#L525-1 assume !(1 == ~e_c~0); 861#L530-1 assume !(1 == ~e_wl~0); 803#L672-1 [2022-07-13 04:23:08,969 INFO L754 eck$LassoCheckResult]: Loop: 803#L672-1 assume !false; 791#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 779#L377 assume !false; 786#L295 assume !(0 == ~wl_st~0); 788#L299 assume !(0 == ~c1_st~0); 852#L302 assume !(0 == ~c2_st~0); 878#L305 assume !(0 == ~wb_st~0); 798#L308 assume !(0 == ~r_st~0); 799#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 821#L548 assume !(1 == ~c_req_up~0); 796#L548-2 start_simulation_~kernel_st~0#1 := 3; 797#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 829#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 815#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 816#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 848#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 849#L580-1 assume !(1 == ~wl_pc~0); 818#L592 assume !(2 == ~wl_pc~0); 819#L593 assume !(1 == ~c1_pc~0); 869#L603 assume !(1 == ~c2_pc~0); 780#L612 assume !(1 == ~wb_pc~0); 782#L621 assume !(1 == ~e_c~0); 874#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 875#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 901#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 898#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 800#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 801#L655-1 assume 0 == ~wl_st~0; 803#L672-1 [2022-07-13 04:23:08,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:08,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2022-07-13 04:23:08,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:08,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459181316] [2022-07-13 04:23:08,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:08,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:08,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:08,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:08,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459181316] [2022-07-13 04:23:08,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459181316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:08,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:08,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:23:08,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591035915] [2022-07-13 04:23:08,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:08,994 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:23:08,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:08,994 INFO L85 PathProgramCache]: Analyzing trace with hash 86756478, now seen corresponding path program 3 times [2022-07-13 04:23:08,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:08,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884489106] [2022-07-13 04:23:08,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:08,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:09,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:09,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884489106] [2022-07-13 04:23:09,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884489106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:09,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:09,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:23:09,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885540194] [2022-07-13 04:23:09,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:09,014 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:23:09,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:23:09,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:23:09,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:23:09,015 INFO L87 Difference]: Start difference. First operand 124 states and 215 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-07-13 04:23:09,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:23:09,024 INFO L93 Difference]: Finished difference Result 124 states and 214 transitions. [2022-07-13 04:23:09,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:23:09,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 214 transitions. [2022-07-13 04:23:09,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-13 04:23:09,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 214 transitions. [2022-07-13 04:23:09,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-13 04:23:09,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-13 04:23:09,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 214 transitions. [2022-07-13 04:23:09,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:23:09,028 INFO L369 hiAutomatonCegarLoop]: Abstraction has 124 states and 214 transitions. [2022-07-13 04:23:09,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 214 transitions. [2022-07-13 04:23:09,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-13 04:23:09,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7258064516129032) internal successors, (214), 123 states have internal predecessors, (214), 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) [2022-07-13 04:23:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 214 transitions. [2022-07-13 04:23:09,032 INFO L392 hiAutomatonCegarLoop]: Abstraction has 124 states and 214 transitions. [2022-07-13 04:23:09,033 INFO L374 stractBuchiCegarLoop]: Abstraction has 124 states and 214 transitions. [2022-07-13 04:23:09,033 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 04:23:09,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 214 transitions. [2022-07-13 04:23:09,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-07-13 04:23:09,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:23:09,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:23:09,035 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:09,035 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:09,035 INFO L752 eck$LassoCheckResult]: Stem: 1154#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1111#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1112#L404 assume !(1 == ~c_req_up~0); 1132#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1079#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1080#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1125#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1108#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1109#L435-1 assume !(0 == ~e_f~0); 1088#L440-1 assume !(0 == ~e_g~0); 1089#L445-1 assume !(0 == ~e_e~0); 1115#L450-1 assume !(0 == ~e_c~0); 1077#L455-1 assume !(0 == ~e_wl~0); 1078#L460-1 assume !(1 == ~wl_pc~0); 1097#L472 assume !(2 == ~wl_pc~0); 1098#L473 assume !(1 == ~c1_pc~0); 1149#L483 assume !(1 == ~c2_pc~0); 1063#L492 assume !(1 == ~wb_pc~0); 1114#L501 assume !(1 == ~e_c~0); 1095#L510-1 assume !(1 == ~e_e~0); 1081#L515-1 assume !(1 == ~e_f~0); 1060#L520-1 assume !(1 == ~e_g~0); 1061#L525-1 assume !(1 == ~e_c~0); 1116#L530-1 assume !(1 == ~e_wl~0); 1058#L672-1 [2022-07-13 04:23:09,035 INFO L754 eck$LassoCheckResult]: Loop: 1058#L672-1 assume !false; 1046#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1034#L377 assume !false; 1041#L295 assume !(0 == ~wl_st~0); 1043#L299 assume !(0 == ~c1_st~0); 1107#L302 assume !(0 == ~c2_st~0); 1133#L305 assume !(0 == ~wb_st~0); 1053#L308 assume !(0 == ~r_st~0); 1054#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1076#L548 assume !(1 == ~c_req_up~0); 1051#L548-2 start_simulation_~kernel_st~0#1 := 3; 1052#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1084#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1070#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1071#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1103#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1104#L580-1 assume !(1 == ~wl_pc~0); 1073#L592 assume !(2 == ~wl_pc~0); 1074#L593 assume !(1 == ~c1_pc~0); 1124#L603 assume !(1 == ~c2_pc~0); 1035#L612 assume !(1 == ~wb_pc~0); 1037#L621 assume !(1 == ~e_c~0); 1129#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1130#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1156#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1153#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1055#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1056#L655-1 assume 0 == ~wl_st~0; 1058#L672-1 [2022-07-13 04:23:09,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:09,036 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2022-07-13 04:23:09,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:09,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259124665] [2022-07-13 04:23:09,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:09,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:09,047 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:23:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:09,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:23:09,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:09,073 INFO L85 PathProgramCache]: Analyzing trace with hash 86756478, now seen corresponding path program 4 times [2022-07-13 04:23:09,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:09,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123331231] [2022-07-13 04:23:09,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:09,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:09,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:09,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123331231] [2022-07-13 04:23:09,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123331231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:09,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:09,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:23:09,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015382378] [2022-07-13 04:23:09,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:09,093 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:23:09,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:23:09,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:23:09,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:23:09,094 INFO L87 Difference]: Start difference. First operand 124 states and 214 transitions. cyclomatic complexity: 91 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 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) [2022-07-13 04:23:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:23:09,119 INFO L93 Difference]: Finished difference Result 156 states and 274 transitions. [2022-07-13 04:23:09,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:23:09,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 274 transitions. [2022-07-13 04:23:09,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2022-07-13 04:23:09,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 156 states and 274 transitions. [2022-07-13 04:23:09,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2022-07-13 04:23:09,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2022-07-13 04:23:09,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 274 transitions. [2022-07-13 04:23:09,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:23:09,147 INFO L369 hiAutomatonCegarLoop]: Abstraction has 156 states and 274 transitions. [2022-07-13 04:23:09,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 274 transitions. [2022-07-13 04:23:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-07-13 04:23:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 156 states have (on average 1.7564102564102564) internal successors, (274), 155 states have internal predecessors, (274), 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) [2022-07-13 04:23:09,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 274 transitions. [2022-07-13 04:23:09,152 INFO L392 hiAutomatonCegarLoop]: Abstraction has 156 states and 274 transitions. [2022-07-13 04:23:09,152 INFO L374 stractBuchiCegarLoop]: Abstraction has 156 states and 274 transitions. [2022-07-13 04:23:09,153 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 04:23:09,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 274 transitions. [2022-07-13 04:23:09,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2022-07-13 04:23:09,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:23:09,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:23:09,155 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:09,155 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:09,155 INFO L752 eck$LassoCheckResult]: Stem: 1441#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1397#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1398#L404 assume !(1 == ~c_req_up~0); 1419#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1365#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1366#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1412#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1394#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1395#L435-1 assume !(0 == ~e_f~0); 1374#L440-1 assume !(0 == ~e_g~0); 1375#L445-1 assume !(0 == ~e_e~0); 1401#L450-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1363#L455-1 assume !(0 == ~e_wl~0); 1364#L460-1 assume !(1 == ~wl_pc~0); 1383#L472 assume !(2 == ~wl_pc~0); 1384#L473 assume !(1 == ~c1_pc~0); 1436#L483 assume !(1 == ~c2_pc~0); 1349#L492 assume !(1 == ~wb_pc~0); 1400#L501 assume 1 == ~e_c~0;~r_st~0 := 0; 1381#L510-1 assume !(1 == ~e_e~0); 1367#L515-1 assume !(1 == ~e_f~0); 1346#L520-1 assume !(1 == ~e_g~0); 1347#L525-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1402#L530-1 assume !(1 == ~e_wl~0); 1344#L672-1 [2022-07-13 04:23:09,156 INFO L754 eck$LassoCheckResult]: Loop: 1344#L672-1 assume !false; 1332#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1323#L377 assume !false; 1327#L295 assume !(0 == ~wl_st~0); 1329#L299 assume !(0 == ~c1_st~0); 1393#L302 assume !(0 == ~c2_st~0); 1420#L305 assume !(0 == ~wb_st~0); 1339#L308 assume !(0 == ~r_st~0); 1340#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1362#L548 assume !(1 == ~c_req_up~0); 1337#L548-2 start_simulation_~kernel_st~0#1 := 3; 1338#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1370#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1356#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1357#L570-1 assume !(0 == ~e_c~0); 1443#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1474#L580-1 assume 1 == ~wl_pc~0; 1472#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1469#L593 assume !(1 == ~c1_pc~0); 1468#L603 assume !(1 == ~c2_pc~0); 1466#L612 assume !(1 == ~wb_pc~0); 1464#L621 assume !(1 == ~e_c~0); 1463#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1462#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1444#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1445#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1341#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1342#L655-1 assume 0 == ~wl_st~0; 1344#L672-1 [2022-07-13 04:23:09,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:09,156 INFO L85 PathProgramCache]: Analyzing trace with hash 785152729, now seen corresponding path program 1 times [2022-07-13 04:23:09,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:09,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508684269] [2022-07-13 04:23:09,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:09,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:09,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:09,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508684269] [2022-07-13 04:23:09,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508684269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:09,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:09,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 04:23:09,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059865332] [2022-07-13 04:23:09,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:09,182 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:23:09,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:09,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1473620493, now seen corresponding path program 1 times [2022-07-13 04:23:09,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:09,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084762553] [2022-07-13 04:23:09,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:09,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:09,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:09,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084762553] [2022-07-13 04:23:09,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084762553] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:09,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:09,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:23:09,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184938992] [2022-07-13 04:23:09,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:09,200 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:23:09,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:23:09,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 04:23:09,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 04:23:09,201 INFO L87 Difference]: Start difference. First operand 156 states and 274 transitions. cyclomatic complexity: 119 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2022-07-13 04:23:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:23:09,293 INFO L93 Difference]: Finished difference Result 285 states and 492 transitions. [2022-07-13 04:23:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:23:09,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 492 transitions. [2022-07-13 04:23:09,298 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 199 [2022-07-13 04:23:09,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 285 states and 492 transitions. [2022-07-13 04:23:09,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2022-07-13 04:23:09,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2022-07-13 04:23:09,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 492 transitions. [2022-07-13 04:23:09,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:23:09,301 INFO L369 hiAutomatonCegarLoop]: Abstraction has 285 states and 492 transitions. [2022-07-13 04:23:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 492 transitions. [2022-07-13 04:23:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 273. [2022-07-13 04:23:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 273 states have (on average 1.7362637362637363) internal successors, (474), 272 states have internal predecessors, (474), 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) [2022-07-13 04:23:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 474 transitions. [2022-07-13 04:23:09,312 INFO L392 hiAutomatonCegarLoop]: Abstraction has 273 states and 474 transitions. [2022-07-13 04:23:09,312 INFO L374 stractBuchiCegarLoop]: Abstraction has 273 states and 474 transitions. [2022-07-13 04:23:09,312 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 04:23:09,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 273 states and 474 transitions. [2022-07-13 04:23:09,314 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 199 [2022-07-13 04:23:09,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:23:09,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:23:09,315 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:09,316 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:09,317 INFO L752 eck$LassoCheckResult]: Stem: 1909#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1851#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1852#L404 assume !(1 == ~c_req_up~0); 1887#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1819#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1820#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1897#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1898#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1912#L435-1 assume !(0 == ~e_f~0); 1826#L440-1 assume !(0 == ~e_g~0); 1827#L445-1 assume !(0 == ~e_e~0); 1858#L450-1 assume !(0 == ~e_c~0); 1859#L455-1 assume !(0 == ~e_wl~0); 2007#L460-1 assume !(1 == ~wl_pc~0); 2005#L472 assume !(2 == ~wl_pc~0); 2003#L473 assume !(1 == ~c1_pc~0); 1903#L483 assume !(1 == ~c2_pc~0); 1800#L492 assume !(1 == ~wb_pc~0); 1850#L501 assume 1 == ~e_c~0;~r_st~0 := 0; 1833#L510-1 assume !(1 == ~e_e~0); 1816#L515-1 assume !(1 == ~e_f~0); 1797#L520-1 assume !(1 == ~e_g~0); 1798#L525-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1855#L530-1 assume !(1 == ~e_wl~0); 1795#L672-1 [2022-07-13 04:23:09,317 INFO L754 eck$LassoCheckResult]: Loop: 1795#L672-1 assume !false; 1882#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1964#L377 assume !false; 1963#L295 assume !(0 == ~wl_st~0); 1962#L299 assume !(0 == ~c1_st~0); 1961#L302 assume !(0 == ~c2_st~0); 1960#L305 assume !(0 == ~wb_st~0); 1958#L308 assume !(0 == ~r_st~0); 1957#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1881#L548 assume !(1 == ~c_req_up~0); 1788#L548-2 start_simulation_~kernel_st~0#1 := 3; 1789#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1953#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1995#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1994#L570-1 assume !(0 == ~e_c~0); 1927#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1993#L580-1 assume 1 == ~wl_pc~0; 1991#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1988#L593 assume !(1 == ~c1_pc~0); 1908#L603 assume !(1 == ~c2_pc~0); 1772#L612 assume !(1 == ~wb_pc~0); 1774#L621 assume !(1 == ~e_c~0); 1874#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1875#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1914#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1922#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1792#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1793#L655-1 assume 0 == ~wl_st~0; 1795#L672-1 [2022-07-13 04:23:09,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:09,318 INFO L85 PathProgramCache]: Analyzing trace with hash 198346715, now seen corresponding path program 1 times [2022-07-13 04:23:09,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:09,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910538974] [2022-07-13 04:23:09,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:09,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:09,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:09,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910538974] [2022-07-13 04:23:09,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910538974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:09,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:09,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:23:09,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263441761] [2022-07-13 04:23:09,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:09,352 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:23:09,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1473620493, now seen corresponding path program 2 times [2022-07-13 04:23:09,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:09,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065761462] [2022-07-13 04:23:09,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:09,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:09,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:09,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065761462] [2022-07-13 04:23:09,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065761462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:09,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:09,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:23:09,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621990921] [2022-07-13 04:23:09,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:09,380 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:23:09,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:23:09,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:23:09,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:23:09,381 INFO L87 Difference]: Start difference. First operand 273 states and 474 transitions. cyclomatic complexity: 203 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-07-13 04:23:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:23:09,409 INFO L93 Difference]: Finished difference Result 369 states and 630 transitions. [2022-07-13 04:23:09,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:23:09,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 369 states and 630 transitions. [2022-07-13 04:23:09,413 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 292 [2022-07-13 04:23:09,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 369 states to 369 states and 630 transitions. [2022-07-13 04:23:09,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 369 [2022-07-13 04:23:09,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 369 [2022-07-13 04:23:09,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 369 states and 630 transitions. [2022-07-13 04:23:09,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:23:09,417 INFO L369 hiAutomatonCegarLoop]: Abstraction has 369 states and 630 transitions. [2022-07-13 04:23:09,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states and 630 transitions. [2022-07-13 04:23:09,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2022-07-13 04:23:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 369 states have (on average 1.7073170731707317) internal successors, (630), 368 states have internal predecessors, (630), 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) [2022-07-13 04:23:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 630 transitions. [2022-07-13 04:23:09,428 INFO L392 hiAutomatonCegarLoop]: Abstraction has 369 states and 630 transitions. [2022-07-13 04:23:09,428 INFO L374 stractBuchiCegarLoop]: Abstraction has 369 states and 630 transitions. [2022-07-13 04:23:09,428 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 04:23:09,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 630 transitions. [2022-07-13 04:23:09,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 292 [2022-07-13 04:23:09,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:23:09,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:23:09,431 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:09,431 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:09,432 INFO L752 eck$LassoCheckResult]: Stem: 2562#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 2502#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 2503#L404 assume !(1 == ~c_req_up~0); 2529#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 2530#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 2518#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 2519#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 2498#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 2499#L435-1 assume !(0 == ~e_f~0); 2477#L440-1 assume !(0 == ~e_g~0); 2478#L445-1 assume !(0 == ~e_e~0); 2511#L450-1 assume !(0 == ~e_c~0); 2464#L455-1 assume !(0 == ~e_wl~0); 2465#L460-1 assume !(1 == ~wl_pc~0); 2487#L472 assume !(2 == ~wl_pc~0); 2488#L473 assume !(1 == ~c1_pc~0); 2556#L483 assume !(1 == ~c2_pc~0); 2450#L492 assume !(1 == ~wb_pc~0); 2505#L501 assume !(1 == ~e_c~0); 2522#L510-1 assume !(1 == ~e_e~0); 2468#L515-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2447#L520-1 assume !(1 == ~e_g~0); 2448#L525-1 assume !(1 == ~e_c~0); 2508#L530-1 assume !(1 == ~e_wl~0); 2728#L672-1 [2022-07-13 04:23:09,432 INFO L754 eck$LassoCheckResult]: Loop: 2728#L672-1 assume !false; 2723#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 2722#L377 assume !false; 2721#L295 assume !(0 == ~wl_st~0); 2720#L299 assume !(0 == ~c1_st~0); 2719#L302 assume !(0 == ~c2_st~0); 2718#L305 assume !(0 == ~wb_st~0); 2439#L308 assume !(0 == ~r_st~0); 2441#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 2463#L548 assume !(1 == ~c_req_up~0); 2437#L548-2 start_simulation_~kernel_st~0#1 := 3; 2438#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 2553#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 2457#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 2458#L570-1 assume !(0 == ~e_c~0); 2493#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 2494#L580-1 assume 1 == ~wl_pc~0; 2555#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 2460#L593 assume !(1 == ~c1_pc~0); 2517#L603 assume !(1 == ~c2_pc~0); 2501#L612 assume !(1 == ~wb_pc~0); 2751#L621 assume !(1 == ~e_c~0); 2745#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 2743#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2565#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 2742#L645-1 assume !(1 == ~e_c~0); 2601#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2739#L655-1 assume 0 == ~wl_st~0; 2728#L672-1 [2022-07-13 04:23:09,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:09,432 INFO L85 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2022-07-13 04:23:09,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:09,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747585465] [2022-07-13 04:23:09,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:09,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:09,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:09,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:09,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747585465] [2022-07-13 04:23:09,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747585465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:09,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:09,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 04:23:09,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035301375] [2022-07-13 04:23:09,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:09,479 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:23:09,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:09,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1473618571, now seen corresponding path program 1 times [2022-07-13 04:23:09,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:09,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706089198] [2022-07-13 04:23:09,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:09,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:09,490 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:23:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:09,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:23:09,730 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:23:09,732 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:23:09,732 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:23:09,733 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:23:09,733 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 04:23:09,733 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:09,733 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:23:09,733 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:23:09,733 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration8_Loop [2022-07-13 04:23:09,733 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:23:09,734 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:23:09,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:09,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,052 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:23:10,053 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 04:23:10,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:10,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:10,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:10,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:10,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:10,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-13 04:23:10,091 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:10,091 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=-7} Honda state: {~e_c~0=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:10,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:10,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:10,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:10,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:10,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-13 04:23:10,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:10,121 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:10,144 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:10,144 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:10,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:10,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:10,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:10,169 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:10,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-13 04:23:10,172 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:10,172 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:10,196 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:10,196 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:10,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:10,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:10,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:10,223 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:10,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-13 04:23:10,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:10,226 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:10,247 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:10,248 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___2~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp___2~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:10,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:10,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:10,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:10,272 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:10,278 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:10,278 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:10,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-13 04:23:10,291 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:10,291 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:10,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:10,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:10,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:10,319 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:10,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-13 04:23:10,325 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:10,325 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:10,336 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:10,336 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_req_up~0=4} Honda state: {~c_req_up~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:10,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-13 04:23:10,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:10,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:10,353 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:10,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-13 04:23:10,357 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:10,357 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:10,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:10,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:10,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:10,409 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:10,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 04:23:10,414 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:10,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-13 04:23:10,435 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 04:23:10,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:10,451 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:23:10,451 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:23:10,451 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:23:10,451 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:23:10,451 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:23:10,451 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:10,451 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:23:10,451 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:23:10,451 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration8_Loop [2022-07-13 04:23:10,451 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:23:10,451 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:23:10,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:10,712 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:23:10,716 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:23:10,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:10,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:10,720 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:10,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:10,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:10,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:10,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:10,736 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 04:23:10,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:10,739 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 04:23:10,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:10,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-13 04:23:10,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:10,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:10,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:10,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:10,777 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:10,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:10,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:10,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:10,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:10,793 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 04:23:10,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:10,794 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 04:23:10,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:10,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-13 04:23:10,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:10,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:10,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:10,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:10,828 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:10,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-13 04:23:10,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:10,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:10,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:10,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:10,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:23:10,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:10,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:23:10,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:10,857 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:10,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:10,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:10,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:10,883 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:10,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-13 04:23:10,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:10,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:10,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:10,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:10,896 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 04:23:10,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:10,897 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 04:23:10,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:10,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:10,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-13 04:23:10,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:10,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:10,927 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:10,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-13 04:23:10,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:10,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:10,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:10,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:10,942 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 04:23:10,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:10,945 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 04:23:10,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:10,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:10,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-13 04:23:10,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:10,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:10,984 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:10,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-13 04:23:10,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:10,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:10,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:10,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:10,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:23:10,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:10,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:23:10,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:10,996 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:23:10,999 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 04:23:10,999 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-13 04:23:11,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:11,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:11,007 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:11,015 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:23:11,015 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 04:23:11,015 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:23:11,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-13 04:23:11,016 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_wl~0) = -1*~e_wl~0 + 1 Supporting invariants [] [2022-07-13 04:23:11,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:11,033 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 04:23:11,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:11,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:23:11,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:23:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:11,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:23:11,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:23:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:11,265 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-13 04:23:11,265 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 630 transitions. cyclomatic complexity: 263 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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) [2022-07-13 04:23:11,360 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 630 transitions. cyclomatic complexity: 263. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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) Result 1270 states and 2159 transitions. Complement of second has 5 states. [2022-07-13 04:23:11,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-13 04:23:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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) [2022-07-13 04:23:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2022-07-13 04:23:11,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 28 letters. [2022-07-13 04:23:11,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:23:11,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 52 letters. Loop has 28 letters. [2022-07-13 04:23:11,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:23:11,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 56 letters. [2022-07-13 04:23:11,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:23:11,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1270 states and 2159 transitions. [2022-07-13 04:23:11,390 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 869 [2022-07-13 04:23:11,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1270 states to 1267 states and 2153 transitions. [2022-07-13 04:23:11,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 955 [2022-07-13 04:23:11,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 972 [2022-07-13 04:23:11,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1267 states and 2153 transitions. [2022-07-13 04:23:11,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:23:11,398 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1267 states and 2153 transitions. [2022-07-13 04:23:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states and 2153 transitions. [2022-07-13 04:23:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 952. [2022-07-13 04:23:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 952 states have (on average 1.7069327731092436) internal successors, (1625), 951 states have internal predecessors, (1625), 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) [2022-07-13 04:23:11,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1625 transitions. [2022-07-13 04:23:11,423 INFO L392 hiAutomatonCegarLoop]: Abstraction has 952 states and 1625 transitions. [2022-07-13 04:23:11,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:23:11,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 04:23:11,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 04:23:11,424 INFO L87 Difference]: Start difference. First operand 952 states and 1625 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2022-07-13 04:23:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:23:11,528 INFO L93 Difference]: Finished difference Result 1170 states and 1981 transitions. [2022-07-13 04:23:11,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 04:23:11,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1170 states and 1981 transitions. [2022-07-13 04:23:11,537 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 691 [2022-07-13 04:23:11,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1170 states to 1170 states and 1981 transitions. [2022-07-13 04:23:11,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 811 [2022-07-13 04:23:11,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 811 [2022-07-13 04:23:11,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1170 states and 1981 transitions. [2022-07-13 04:23:11,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:23:11,545 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1170 states and 1981 transitions. [2022-07-13 04:23:11,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states and 1981 transitions. [2022-07-13 04:23:11,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1149. [2022-07-13 04:23:11,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1149 states have (on average 1.7049608355091384) internal successors, (1959), 1148 states have internal predecessors, (1959), 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) [2022-07-13 04:23:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1959 transitions. [2022-07-13 04:23:11,563 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1149 states and 1959 transitions. [2022-07-13 04:23:11,563 INFO L374 stractBuchiCegarLoop]: Abstraction has 1149 states and 1959 transitions. [2022-07-13 04:23:11,564 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-13 04:23:11,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1149 states and 1959 transitions. [2022-07-13 04:23:11,568 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 687 [2022-07-13 04:23:11,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:23:11,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:23:11,570 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:11,570 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:11,572 INFO L752 eck$LassoCheckResult]: Stem: 6639#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 6513#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 6514#L404 assume !(1 == ~c_req_up~0); 6637#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6723#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6722#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6721#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6720#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6647#L435-1 assume !(0 == ~e_f~0); 6465#L440-1 assume !(0 == ~e_g~0); 6466#L445-1 assume !(0 == ~e_e~0); 6517#L450-1 assume !(0 == ~e_c~0); 6523#L455-1 assume !(0 == ~e_wl~0); 6725#L460-1 assume !(1 == ~wl_pc~0); 6487#L472 assume !(2 == ~wl_pc~0); 6488#L473 assume !(1 == ~c1_pc~0); 6620#L483 assume !(1 == ~c2_pc~0); 6419#L492 assume !(1 == ~wb_pc~0); 6516#L501 assume !(1 == ~e_c~0); 6482#L510-1 assume !(1 == ~e_e~0); 6451#L515-1 assume !(1 == ~e_f~0); 6416#L520-1 assume !(1 == ~e_g~0); 6417#L525-1 assume !(1 == ~e_c~0); 6518#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 6598#L672-1 [2022-07-13 04:23:11,572 INFO L754 eck$LassoCheckResult]: Loop: 6598#L672-1 assume !false; 7455#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 7454#L377 assume !false; 7453#L295 assume !(0 == ~wl_st~0); 7452#L299 assume !(0 == ~c1_st~0); 7451#L302 assume !(0 == ~c2_st~0); 7450#L305 assume !(0 == ~wb_st~0); 7219#L308 assume !(0 == ~r_st~0); 7221#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 7199#L548 assume !(1 == ~c_req_up~0); 6397#L548-2 start_simulation_~kernel_st~0#1 := 3; 6398#L560 assume !(0 == ~e_f~0); 6456#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 6432#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 6433#L570-1 assume !(0 == ~e_c~0); 6496#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 6497#L580-1 assume !(1 == ~wl_pc~0); 6438#L592 assume !(2 == ~wl_pc~0); 6439#L593 assume !(1 == ~c1_pc~0); 6534#L603 assume !(1 == ~c2_pc~0); 6361#L612 assume !(1 == ~wb_pc~0); 6363#L621 assume !(1 == ~e_c~0); 7498#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 7497#L635-1 assume !(1 == ~e_f~0); 7496#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 7495#L645-1 assume !(1 == ~e_c~0); 7494#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7491#L655-1 assume 0 == ~wl_st~0; 6598#L672-1 [2022-07-13 04:23:11,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:11,573 INFO L85 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2022-07-13 04:23:11,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:11,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67106217] [2022-07-13 04:23:11,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:11,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:11,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:11,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:11,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67106217] [2022-07-13 04:23:11,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67106217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:11,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:11,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:23:11,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116992239] [2022-07-13 04:23:11,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:11,611 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:23:11,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:11,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1784107586, now seen corresponding path program 1 times [2022-07-13 04:23:11,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:11,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637006998] [2022-07-13 04:23:11,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:11,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:11,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:11,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637006998] [2022-07-13 04:23:11,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637006998] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:11,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:11,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 04:23:11,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119449680] [2022-07-13 04:23:11,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:11,651 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:23:11,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:23:11,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 04:23:11,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 04:23:11,652 INFO L87 Difference]: Start difference. First operand 1149 states and 1959 transitions. cyclomatic complexity: 816 Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2022-07-13 04:23:11,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:23:11,726 INFO L93 Difference]: Finished difference Result 1915 states and 3215 transitions. [2022-07-13 04:23:11,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 04:23:11,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1915 states and 3215 transitions. [2022-07-13 04:23:11,737 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 979 [2022-07-13 04:23:11,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1915 states to 1915 states and 3215 transitions. [2022-07-13 04:23:11,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1280 [2022-07-13 04:23:11,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1280 [2022-07-13 04:23:11,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1915 states and 3215 transitions. [2022-07-13 04:23:11,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:23:11,748 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1915 states and 3215 transitions. [2022-07-13 04:23:11,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states and 3215 transitions. [2022-07-13 04:23:11,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1427. [2022-07-13 04:23:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1427 states have (on average 1.6937631394533987) internal successors, (2417), 1426 states have internal predecessors, (2417), 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) [2022-07-13 04:23:11,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 2417 transitions. [2022-07-13 04:23:11,771 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1427 states and 2417 transitions. [2022-07-13 04:23:11,771 INFO L374 stractBuchiCegarLoop]: Abstraction has 1427 states and 2417 transitions. [2022-07-13 04:23:11,771 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-13 04:23:11,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1427 states and 2417 transitions. [2022-07-13 04:23:11,777 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 789 [2022-07-13 04:23:11,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:23:11,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:23:11,778 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:11,778 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:11,778 INFO L752 eck$LassoCheckResult]: Stem: 9689#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 9585#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 9586#L404 assume !(1 == ~c_req_up~0); 9640#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 9527#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 9528#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 9661#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 9662#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 9692#L435-1 assume !(0 == ~e_f~0); 9693#L440-1 assume !(0 == ~e_g~0); 9702#L445-1 assume !(0 == ~e_e~0); 9596#L450-1 assume !(0 == ~e_c~0); 9520#L455-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 9521#L460-1 assume !(1 == ~wl_pc~0); 9649#L472 assume !(2 == ~wl_pc~0); 10155#L473 assume !(1 == ~c1_pc~0); 10186#L483 assume !(1 == ~c2_pc~0); 10184#L492 assume !(1 == ~wb_pc~0); 10182#L501 assume !(1 == ~e_c~0); 10181#L510-1 assume !(1 == ~e_e~0); 10180#L515-1 assume !(1 == ~e_f~0); 10178#L520-1 assume !(1 == ~e_g~0); 10177#L525-1 assume !(1 == ~e_c~0); 10158#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 10159#L672-1 [2022-07-13 04:23:11,778 INFO L754 eck$LassoCheckResult]: Loop: 10159#L672-1 assume !false; 10505#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 10499#L377 assume !false; 10493#L295 assume !(0 == ~wl_st~0); 10491#L299 assume !(0 == ~c1_st~0); 10489#L302 assume !(0 == ~c2_st~0); 10487#L305 assume !(0 == ~wb_st~0); 10484#L308 assume !(0 == ~r_st~0); 10482#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 10478#L548 assume !(1 == ~c_req_up~0); 10479#L548-2 start_simulation_~kernel_st~0#1 := 3; 10568#L560 assume !(0 == ~e_f~0); 10567#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 10566#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 10565#L570-1 assume !(0 == ~e_c~0); 10563#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 10562#L580-1 assume !(1 == ~wl_pc~0); 10560#L592 assume !(2 == ~wl_pc~0); 10555#L593 assume !(1 == ~c1_pc~0); 10554#L603 assume !(1 == ~c2_pc~0); 10552#L612 assume !(1 == ~wb_pc~0); 10550#L621 assume !(1 == ~e_c~0); 10549#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 10544#L635-1 assume !(1 == ~e_f~0); 10542#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 10540#L645-1 assume !(1 == ~e_c~0); 10189#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 10190#L655-1 assume 0 == ~wl_st~0; 10159#L672-1 [2022-07-13 04:23:11,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:11,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2560361, now seen corresponding path program 1 times [2022-07-13 04:23:11,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:11,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292185064] [2022-07-13 04:23:11,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:11,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:11,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:11,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292185064] [2022-07-13 04:23:11,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292185064] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:11,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:11,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 04:23:11,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420757148] [2022-07-13 04:23:11,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:11,797 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:23:11,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:11,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1784107586, now seen corresponding path program 2 times [2022-07-13 04:23:11,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:11,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365352385] [2022-07-13 04:23:11,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:11,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:11,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:11,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365352385] [2022-07-13 04:23:11,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365352385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:11,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:11,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 04:23:11,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958601867] [2022-07-13 04:23:11,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:11,828 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:23:11,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:23:11,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 04:23:11,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 04:23:11,829 INFO L87 Difference]: Start difference. First operand 1427 states and 2417 transitions. cyclomatic complexity: 996 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2022-07-13 04:23:11,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:23:11,889 INFO L93 Difference]: Finished difference Result 1824 states and 2961 transitions. [2022-07-13 04:23:11,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:23:11,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1824 states and 2961 transitions. [2022-07-13 04:23:11,901 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1192 [2022-07-13 04:23:11,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1824 states to 1290 states and 2103 transitions. [2022-07-13 04:23:11,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2022-07-13 04:23:11,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2022-07-13 04:23:11,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 2103 transitions. [2022-07-13 04:23:11,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:23:11,910 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1290 states and 2103 transitions. [2022-07-13 04:23:11,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 2103 transitions. [2022-07-13 04:23:11,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1003. [2022-07-13 04:23:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1003 states have (on average 1.6340977068793618) internal successors, (1639), 1002 states have internal predecessors, (1639), 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) [2022-07-13 04:23:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1639 transitions. [2022-07-13 04:23:11,927 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1003 states and 1639 transitions. [2022-07-13 04:23:11,927 INFO L374 stractBuchiCegarLoop]: Abstraction has 1003 states and 1639 transitions. [2022-07-13 04:23:11,928 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-13 04:23:11,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1003 states and 1639 transitions. [2022-07-13 04:23:11,932 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 928 [2022-07-13 04:23:11,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:23:11,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:23:11,933 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:11,933 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:11,933 INFO L752 eck$LassoCheckResult]: Stem: 12849#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 12779#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 12780#L404 assume !(1 == ~c_req_up~0); 12811#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 12812#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 12797#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 12798#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 12776#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 12777#L435-1 assume !(0 == ~e_f~0); 12754#L440-1 assume !(0 == ~e_g~0); 12755#L445-1 assume !(0 == ~e_e~0); 12789#L450-1 assume !(0 == ~e_c~0); 12790#L455-1 assume !(0 == ~e_wl~0); 12881#L460-1 assume !(1 == ~wl_pc~0); 12878#L472 assume !(2 == ~wl_pc~0); 12877#L473 assume !(1 == ~c1_pc~0); 12840#L483 assume !(1 == ~c2_pc~0); 12727#L492 assume !(1 == ~wb_pc~0); 12802#L501 assume !(1 == ~e_c~0); 12803#L510-1 assume !(1 == ~e_e~0); 12873#L515-1 assume !(1 == ~e_f~0); 12872#L520-1 assume !(1 == ~e_g~0); 12785#L525-1 assume !(1 == ~e_c~0); 12786#L530-1 assume !(1 == ~e_wl~0); 13238#L672-1 [2022-07-13 04:23:11,933 INFO L754 eck$LassoCheckResult]: Loop: 13238#L672-1 assume !false; 13239#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 13230#L377 assume !false; 13231#L295 assume !(0 == ~wl_st~0); 13226#L299 assume !(0 == ~c1_st~0); 13227#L302 assume !(0 == ~c2_st~0); 13219#L305 assume !(0 == ~wb_st~0); 13220#L308 assume !(0 == ~r_st~0); 13334#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 13335#L548 assume !(1 == ~c_req_up~0); 13330#L548-2 start_simulation_~kernel_st~0#1 := 3; 13325#L560 assume !(0 == ~e_f~0); 13326#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 13321#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 13322#L570-1 assume !(0 == ~e_c~0); 13317#L575-1 assume !(0 == ~e_wl~0); 13318#L580-1 assume !(1 == ~wl_pc~0); 13315#L592 assume !(2 == ~wl_pc~0); 13314#L593 assume !(1 == ~c1_pc~0); 13309#L603 assume !(1 == ~c2_pc~0); 13307#L612 assume !(1 == ~wb_pc~0); 13305#L621 assume !(1 == ~e_c~0); 13304#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 13302#L635-1 assume !(1 == ~e_f~0); 13303#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 13481#L645-1 assume !(1 == ~e_c~0); 13479#L650-1 assume !(1 == ~e_wl~0); 13288#L655-1 assume 0 == ~wl_st~0; 13238#L672-1 [2022-07-13 04:23:11,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:11,934 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 2 times [2022-07-13 04:23:11,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:11,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415627215] [2022-07-13 04:23:11,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:11,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:11,940 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:23:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:11,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:23:11,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1197301634, now seen corresponding path program 1 times [2022-07-13 04:23:11,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:11,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686069731] [2022-07-13 04:23:11,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:11,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:11,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:11,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686069731] [2022-07-13 04:23:11,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686069731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:11,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:11,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 04:23:11,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898901054] [2022-07-13 04:23:11,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:11,964 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:23:11,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:23:11,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:23:11,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:23:11,965 INFO L87 Difference]: Start difference. First operand 1003 states and 1639 transitions. cyclomatic complexity: 640 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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) [2022-07-13 04:23:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:23:11,989 INFO L93 Difference]: Finished difference Result 1585 states and 2559 transitions. [2022-07-13 04:23:11,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:23:11,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1585 states and 2559 transitions. [2022-07-13 04:23:12,000 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1510 [2022-07-13 04:23:12,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1585 states to 1585 states and 2559 transitions. [2022-07-13 04:23:12,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1585 [2022-07-13 04:23:12,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1585 [2022-07-13 04:23:12,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1585 states and 2559 transitions. [2022-07-13 04:23:12,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:23:12,011 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1585 states and 2559 transitions. [2022-07-13 04:23:12,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states and 2559 transitions. [2022-07-13 04:23:12,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1585. [2022-07-13 04:23:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1585 states have (on average 1.6145110410094636) internal successors, (2559), 1584 states have internal predecessors, (2559), 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) [2022-07-13 04:23:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2559 transitions. [2022-07-13 04:23:12,036 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1585 states and 2559 transitions. [2022-07-13 04:23:12,036 INFO L374 stractBuchiCegarLoop]: Abstraction has 1585 states and 2559 transitions. [2022-07-13 04:23:12,036 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-13 04:23:12,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1585 states and 2559 transitions. [2022-07-13 04:23:12,042 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1510 [2022-07-13 04:23:12,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:23:12,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:23:12,043 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:12,043 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:12,043 INFO L752 eck$LassoCheckResult]: Stem: 15442#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 15375#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 15376#L404 assume !(1 == ~c_req_up~0); 15402#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 15338#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 15339#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 15392#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 15372#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 15373#L435-1 assume !(0 == ~e_f~0); 15350#L440-1 assume !(0 == ~e_g~0); 15351#L445-1 assume !(0 == ~e_e~0); 15379#L450-1 assume !(0 == ~e_c~0); 15384#L455-1 assume !(0 == ~e_wl~0); 15477#L460-1 assume !(1 == ~wl_pc~0); 15474#L472 assume !(2 == ~wl_pc~0); 15473#L473 assume !(1 == ~c1_pc~0); 15471#L483 assume !(1 == ~c2_pc~0); 15466#L492 assume !(1 == ~wb_pc~0); 15395#L501 assume !(1 == ~e_c~0); 15358#L510-1 assume !(1 == ~e_e~0); 15359#L515-1 assume !(1 == ~e_f~0); 15464#L520-1 assume !(1 == ~e_g~0); 15380#L525-1 assume !(1 == ~e_c~0); 15381#L530-1 assume !(1 == ~e_wl~0); 16050#L672-1 [2022-07-13 04:23:12,043 INFO L754 eck$LassoCheckResult]: Loop: 16050#L672-1 assume !false; 15983#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 15982#L377 assume !false; 15963#L295 assume !(0 == ~wl_st~0); 15964#L299 assume !(0 == ~c1_st~0); 16404#L302 assume !(0 == ~c2_st~0); 16401#L305 assume !(0 == ~wb_st~0); 16402#L308 assume !(0 == ~r_st~0); 16403#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 16466#L548 assume !(1 == ~c_req_up~0); 16463#L548-2 start_simulation_~kernel_st~0#1 := 3; 16461#L560 assume !(0 == ~e_f~0); 16460#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 16459#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 16458#L570-1 assume !(0 == ~e_c~0); 16457#L575-1 assume !(0 == ~e_wl~0); 16456#L580-1 assume !(1 == ~wl_pc~0); 16454#L592 assume 2 == ~wl_pc~0; 16452#L594 assume 1 == ~e_e~0;~wl_st~0 := 0; 16453#L593 assume !(1 == ~c1_pc~0); 16482#L603 assume !(1 == ~c2_pc~0); 16447#L612 assume !(1 == ~wb_pc~0); 16443#L621 assume !(1 == ~e_c~0); 16441#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 16439#L635-1 assume !(1 == ~e_f~0); 16437#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 16435#L645-1 assume !(1 == ~e_c~0); 16433#L650-1 assume !(1 == ~e_wl~0); 16430#L655-1 assume 0 == ~wl_st~0; 16050#L672-1 [2022-07-13 04:23:12,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:12,044 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 3 times [2022-07-13 04:23:12,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:12,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785786868] [2022-07-13 04:23:12,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:12,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:12,050 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:23:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:12,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:23:12,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:12,058 INFO L85 PathProgramCache]: Analyzing trace with hash -869781309, now seen corresponding path program 1 times [2022-07-13 04:23:12,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:12,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416352827] [2022-07-13 04:23:12,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:12,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:12,062 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:23:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:12,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:23:12,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:12,067 INFO L85 PathProgramCache]: Analyzing trace with hash 44318509, now seen corresponding path program 1 times [2022-07-13 04:23:12,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:12,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966455520] [2022-07-13 04:23:12,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:12,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:12,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:12,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966455520] [2022-07-13 04:23:12,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966455520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:12,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:12,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:23:12,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049499037] [2022-07-13 04:23:12,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:12,272 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:23:12,272 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:23:12,272 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:23:12,272 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:23:12,272 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 04:23:12,272 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:12,272 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:23:12,272 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:23:12,272 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration12_Loop [2022-07-13 04:23:12,273 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:23:12,273 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:23:12,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:12,553 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:23:12,553 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 04:23:12,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:12,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:12,556 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2022-07-13 04:23:12,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:12,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:12,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-13 04:23:12,584 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:12,584 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:12,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:12,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:12,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:12,609 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:12,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-13 04:23:12,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:12,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:12,634 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:12,634 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=-7} Honda state: {~e_c~0=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:12,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:12,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:12,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:12,650 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:12,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-13 04:23:12,654 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:12,654 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:12,665 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:12,665 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:12,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:12,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:12,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:12,681 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:12,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-13 04:23:12,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:12,685 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:12,691 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:12,692 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:12,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:12,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:12,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:12,711 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:12,720 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:12,720 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:12,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-13 04:23:12,741 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:12,741 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:12,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:12,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:12,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:12,767 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2022-07-13 04:23:12,771 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:12,772 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:12,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-13 04:23:12,787 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:12,787 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp___0~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:12,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:12,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:12,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:12,811 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:12,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:12,816 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:12,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-13 04:23:12,835 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:12,835 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet7#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:12,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:12,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:12,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:12,859 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:12,864 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:12,864 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:12,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-13 04:23:12,883 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:12,883 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet5#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:12,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:12,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:12,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:12,909 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:12,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:12,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:12,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-13 04:23:12,935 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:12,936 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=-1} Honda state: {~r_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:12,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:12,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:12,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:12,961 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:12,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-13 04:23:12,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:12,964 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:12,977 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:12,977 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_st~0=-1} Honda state: {~wb_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:12,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:12,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:12,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:12,993 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:23:12,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-13 04:23:12,996 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:12,996 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:13,002 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:13,002 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:13,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-13 04:23:13,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:13,018 INFO L229 MonitoredProcess]: Starting monitored process 28 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) [2022-07-13 04:23:13,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-13 04:23:13,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:13,021 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:13,032 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:13,032 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_pc~0=4} Honda state: {~wb_pc~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:13,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:13,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:13,050 INFO L229 MonitoredProcess]: Starting monitored process 29 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) [2022-07-13 04:23:13,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-13 04:23:13,052 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:13,052 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:13,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-13 04:23:13,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:13,079 INFO L229 MonitoredProcess]: Starting monitored process 30 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) [2022-07-13 04:23:13,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-13 04:23:13,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 04:23:13,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:13,130 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 04:23:13,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-13 04:23:13,132 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:23:13,132 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:23:13,132 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:23:13,132 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:23:13,133 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:23:13,133 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,133 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:23:13,133 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:23:13,133 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration12_Loop [2022-07-13 04:23:13,133 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:23:13,133 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:23:13,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:13,403 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:23:13,403 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:23:13,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:13,405 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2022-07-13 04:23:13,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-13 04:23:13,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:13,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:13,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:13,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:13,413 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 04:23:13,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:13,413 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 04:23:13,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:13,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:13,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:13,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:13,438 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2022-07-13 04:23:13,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-13 04:23:13,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:13,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:13,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:13,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:13,445 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 04:23:13,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:13,445 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 04:23:13,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:13,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:13,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-13 04:23:13,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:13,476 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2022-07-13 04:23:13,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-13 04:23:13,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:13,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:13,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:13,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:13,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:23:13,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:13,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:23:13,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:13,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:13,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-13 04:23:13,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:13,503 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2022-07-13 04:23:13,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-13 04:23:13,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:13,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:13,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:13,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:13,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:23:13,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:13,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:23:13,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:13,522 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:13,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-13 04:23:13,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:13,538 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2022-07-13 04:23:13,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-13 04:23:13,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:13,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:13,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:13,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:13,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:23:13,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:13,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:23:13,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:13,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:13,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:13,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:13,570 INFO L229 MonitoredProcess]: Starting monitored process 36 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) [2022-07-13 04:23:13,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-13 04:23:13,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:13,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:13,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:13,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:13,579 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 04:23:13,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:13,580 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 04:23:13,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:13,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:13,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-13 04:23:13,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:13,599 INFO L229 MonitoredProcess]: Starting monitored process 37 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) [2022-07-13 04:23:13,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-13 04:23:13,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:13,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:13,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:13,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:13,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:23:13,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:13,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:23:13,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:13,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:13,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:13,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:13,624 INFO L229 MonitoredProcess]: Starting monitored process 38 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) [2022-07-13 04:23:13,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-13 04:23:13,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:13,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:13,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:13,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:13,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:23:13,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:13,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:23:13,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:13,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:13,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-13 04:23:13,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:13,650 INFO L229 MonitoredProcess]: Starting monitored process 39 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) [2022-07-13 04:23:13,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-13 04:23:13,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:13,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:13,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:13,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:13,657 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 04:23:13,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:13,658 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 04:23:13,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:13,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:13,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:13,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:13,715 INFO L229 MonitoredProcess]: Starting monitored process 40 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) [2022-07-13 04:23:13,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:13,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:13,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:13,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:13,727 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 04:23:13,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:13,728 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 04:23:13,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:13,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-13 04:23:13,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:13,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-13 04:23:13,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:13,761 INFO L229 MonitoredProcess]: Starting monitored process 41 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) [2022-07-13 04:23:13,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-13 04:23:13,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:13,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:13,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:13,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:13,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:23:13,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:13,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:23:13,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:13,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:13,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:13,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:13,800 INFO L229 MonitoredProcess]: Starting monitored process 42 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) [2022-07-13 04:23:13,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-13 04:23:13,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:13,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:13,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:13,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:13,808 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 04:23:13,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:13,808 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 04:23:13,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:13,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:13,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:13,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:13,825 INFO L229 MonitoredProcess]: Starting monitored process 43 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) [2022-07-13 04:23:13,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-13 04:23:13,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:13,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:13,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:13,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:13,833 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 04:23:13,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:13,834 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 04:23:13,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:13,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:13,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-13 04:23:13,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:13,852 INFO L229 MonitoredProcess]: Starting monitored process 44 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) [2022-07-13 04:23:13,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-13 04:23:13,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:13,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:13,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:13,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:13,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:23:13,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:13,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:23:13,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:13,862 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:23:13,863 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 04:23:13,863 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-13 04:23:13,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:13,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:13,869 INFO L229 MonitoredProcess]: Starting monitored process 45 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) [2022-07-13 04:23:13,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-13 04:23:13,870 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:23:13,870 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 04:23:13,870 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:23:13,870 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_g~0) = -1*~e_g~0 + 1 Supporting invariants [] [2022-07-13 04:23:13,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-13 04:23:13,886 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 04:23:13,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:13,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:23:13,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:23:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:13,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:23:13,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:23:14,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:14,048 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-13 04:23:14,048 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1585 states and 2559 transitions. cyclomatic complexity: 978 Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:23:14,095 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1585 states and 2559 transitions. cyclomatic complexity: 978. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 4473 states and 7197 transitions. Complement of second has 5 states. [2022-07-13 04:23:14,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-13 04:23:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:23:14,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2022-07-13 04:23:14,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 24 letters. Loop has 29 letters. [2022-07-13 04:23:14,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:23:14,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 53 letters. Loop has 29 letters. [2022-07-13 04:23:14,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:23:14,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 24 letters. Loop has 58 letters. [2022-07-13 04:23:14,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:23:14,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4473 states and 7197 transitions. [2022-07-13 04:23:14,122 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 2912 [2022-07-13 04:23:14,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4473 states to 4473 states and 7197 transitions. [2022-07-13 04:23:14,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2990 [2022-07-13 04:23:14,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3029 [2022-07-13 04:23:14,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4473 states and 7197 transitions. [2022-07-13 04:23:14,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:23:14,147 INFO L369 hiAutomatonCegarLoop]: Abstraction has 4473 states and 7197 transitions. [2022-07-13 04:23:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4473 states and 7197 transitions. [2022-07-13 04:23:14,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4473 to 4434. [2022-07-13 04:23:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4434 states, 4434 states have (on average 1.6118628777627424) internal successors, (7147), 4433 states have internal predecessors, (7147), 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) [2022-07-13 04:23:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4434 states to 4434 states and 7147 transitions. [2022-07-13 04:23:14,223 INFO L392 hiAutomatonCegarLoop]: Abstraction has 4434 states and 7147 transitions. [2022-07-13 04:23:14,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:23:14,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:23:14,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:23:14,223 INFO L87 Difference]: Start difference. First operand 4434 states and 7147 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:23:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:23:14,253 INFO L93 Difference]: Finished difference Result 3528 states and 5680 transitions. [2022-07-13 04:23:14,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:23:14,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3528 states and 5680 transitions. [2022-07-13 04:23:14,268 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 2306 [2022-07-13 04:23:14,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3528 states to 3528 states and 5680 transitions. [2022-07-13 04:23:14,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2387 [2022-07-13 04:23:14,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2387 [2022-07-13 04:23:14,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3528 states and 5680 transitions. [2022-07-13 04:23:14,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:23:14,285 INFO L369 hiAutomatonCegarLoop]: Abstraction has 3528 states and 5680 transitions. [2022-07-13 04:23:14,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states and 5680 transitions. [2022-07-13 04:23:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3180. [2022-07-13 04:23:14,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3180 states, 3180 states have (on average 1.6182389937106918) internal successors, (5146), 3179 states have internal predecessors, (5146), 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) [2022-07-13 04:23:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 3180 states and 5146 transitions. [2022-07-13 04:23:14,333 INFO L392 hiAutomatonCegarLoop]: Abstraction has 3180 states and 5146 transitions. [2022-07-13 04:23:14,333 INFO L374 stractBuchiCegarLoop]: Abstraction has 3180 states and 5146 transitions. [2022-07-13 04:23:14,333 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-13 04:23:14,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3180 states and 5146 transitions. [2022-07-13 04:23:14,341 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2072 [2022-07-13 04:23:14,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:23:14,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:23:14,342 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:14,342 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:14,342 INFO L752 eck$LassoCheckResult]: Stem: 29766#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 29640#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 29641#L404 assume !(1 == ~c_req_up~0); 29763#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 29801#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 29800#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 29799#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 29633#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 29634#L435-1 assume !(0 == ~e_f~0); 29594#L440-1 assume !(0 == ~e_g~0); 29595#L445-1 assume !(0 == ~e_e~0); 29651#L450-1 assume !(0 == ~e_c~0); 29652#L455-1 assume !(0 == ~e_wl~0); 29716#L460-1 assume !(1 == ~wl_pc~0); 29609#L472 assume !(2 == ~wl_pc~0); 29610#L473 assume !(1 == ~c1_pc~0); 29771#L483 assume !(1 == ~c2_pc~0); 29764#L492 assume !(1 == ~wb_pc~0); 29643#L501 assume !(1 == ~e_c~0); 29786#L510-1 assume !(1 == ~e_e~0); 29787#L515-1 assume !(1 == ~e_f~0); 29547#L520-1 assume !(1 == ~e_g~0); 29548#L525-1 assume !(1 == ~e_c~0); 29646#L530-1 assume !(1 == ~e_wl~0); 29726#L672-1 assume !false; 30692#L542 [2022-07-13 04:23:14,342 INFO L754 eck$LassoCheckResult]: Loop: 30692#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 32094#L377 assume !false; 32091#L295 assume 0 == ~wl_st~0; 32089#L308-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 32033#L321 assume 0 != eval_~tmp~0#1;~wl_st~0 := 1;assume { :begin_inline_write_loop } true;havoc write_loop_~t~0#1;havoc write_loop_~t~0#1; 29622#L66 assume 0 == ~wl_pc~0; 29623#L79 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 29673#L127 assume { :end_inline_write_loop } true; 31701#L317 assume !(0 == ~c1_st~0); 31696#L332 assume !(0 == ~c2_st~0); 31703#L347 assume !(0 == ~wb_st~0); 32003#L362 assume !(0 == ~r_st~0); 32000#L377 assume !false; 31999#L295 assume !(0 == ~wl_st~0); 31997#L299 assume !(0 == ~c1_st~0); 31998#L302 assume !(0 == ~c2_st~0); 31994#L305 assume !(0 == ~wb_st~0); 31995#L308 assume !(0 == ~r_st~0); 31996#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 31128#L548 assume !(1 == ~c_req_up~0); 31129#L548-2 start_simulation_~kernel_st~0#1 := 3; 32345#L560 assume !(0 == ~e_f~0); 32343#L560-2 assume !(0 == ~e_g~0); 32342#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 32341#L570-1 assume !(0 == ~e_c~0); 32300#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 32298#L580-1 assume 1 == ~wl_pc~0; 32299#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 32296#L593 assume !(1 == ~c1_pc~0); 32392#L603 assume !(1 == ~c2_pc~0); 32390#L612 assume !(1 == ~wb_pc~0); 32386#L621 assume !(1 == ~e_c~0); 32381#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 32379#L635-1 assume !(1 == ~e_f~0); 32377#L640-1 assume !(1 == ~e_g~0); 32353#L645-1 assume !(1 == ~e_c~0); 32321#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 32319#L655-1 assume 0 == ~wl_st~0; 32301#L672-1 assume !false; 30692#L542 [2022-07-13 04:23:14,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:14,343 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2022-07-13 04:23:14,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:14,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336563311] [2022-07-13 04:23:14,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:14,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:14,368 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:23:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:14,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:23:14,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:14,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1995227012, now seen corresponding path program 1 times [2022-07-13 04:23:14,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:14,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890185311] [2022-07-13 04:23:14,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:14,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:14,390 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:23:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:14,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:23:14,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:14,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1594093335, now seen corresponding path program 1 times [2022-07-13 04:23:14,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:14,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267987757] [2022-07-13 04:23:14,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:14,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:14,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:14,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:14,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267987757] [2022-07-13 04:23:14,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267987757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:14,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:14,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:23:14,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89268131] [2022-07-13 04:23:14,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:14,644 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:23:14,644 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:23:14,644 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:23:14,644 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:23:14,644 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 04:23:14,644 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:14,644 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:23:14,645 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:23:14,645 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration13_Loop [2022-07-13 04:23:14,645 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:23:14,645 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:23:14,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:14,890 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:23:14,890 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 04:23:14,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:14,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:14,920 INFO L229 MonitoredProcess]: Starting monitored process 46 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) [2022-07-13 04:23:14,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-13 04:23:14,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:14,922 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:14,934 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:14,934 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=-7} Honda state: {~e_c~0=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:14,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-13 04:23:14,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:14,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:14,952 INFO L229 MonitoredProcess]: Starting monitored process 47 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) [2022-07-13 04:23:14,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-13 04:23:14,954 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:14,954 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:14,961 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:14,961 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:14,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:14,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:14,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:14,977 INFO L229 MonitoredProcess]: Starting monitored process 48 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) [2022-07-13 04:23:14,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-13 04:23:14,979 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:14,979 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:14,987 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:23:14,987 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet6#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 04:23:15,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-07-13 04:23:15,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:15,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:15,003 INFO L229 MonitoredProcess]: Starting monitored process 49 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) [2022-07-13 04:23:15,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-13 04:23:15,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:23:15,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:15,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-13 04:23:15,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:15,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:15,029 INFO L229 MonitoredProcess]: Starting monitored process 50 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) [2022-07-13 04:23:15,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-13 04:23:15,031 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 04:23:15,031 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:23:15,039 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 04:23:15,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-13 04:23:15,054 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:23:15,054 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:23:15,054 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:23:15,054 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:23:15,054 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:23:15,054 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:15,054 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:23:15,054 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:23:15,054 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration13_Loop [2022-07-13 04:23:15,054 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:23:15,054 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:23:15,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:23:15,270 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:23:15,270 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:23:15,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:15,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:15,273 INFO L229 MonitoredProcess]: Starting monitored process 51 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) [2022-07-13 04:23:15,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-13 04:23:15,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:15,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:15,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:15,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:15,282 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 04:23:15,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:15,282 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 04:23:15,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:15,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:15,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-13 04:23:15,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:15,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:15,308 INFO L229 MonitoredProcess]: Starting monitored process 52 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) [2022-07-13 04:23:15,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-13 04:23:15,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:15,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:15,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:15,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:15,317 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 04:23:15,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:15,318 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 04:23:15,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:15,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:15,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-13 04:23:15,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:15,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:15,335 INFO L229 MonitoredProcess]: Starting monitored process 53 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) [2022-07-13 04:23:15,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-13 04:23:15,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:15,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:15,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:15,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:15,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:23:15,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:15,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:23:15,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:15,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:15,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-13 04:23:15,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:15,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:15,371 INFO L229 MonitoredProcess]: Starting monitored process 54 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) [2022-07-13 04:23:15,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-13 04:23:15,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:15,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:15,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:15,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:15,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:23:15,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:15,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:23:15,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:15,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:23:15,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-07-13 04:23:15,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:15,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:15,395 INFO L229 MonitoredProcess]: Starting monitored process 55 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) [2022-07-13 04:23:15,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-13 04:23:15,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:23:15,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:23:15,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:23:15,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:23:15,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:23:15,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:23:15,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:23:15,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:23:15,429 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:23:15,432 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 04:23:15,432 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-13 04:23:15,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:23:15,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:23:15,433 INFO L229 MonitoredProcess]: Starting monitored process 56 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) [2022-07-13 04:23:15,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-13 04:23:15,435 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:23:15,435 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 04:23:15,436 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:23:15,436 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2022-07-13 04:23:15,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-07-13 04:23:15,451 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 04:23:15,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:15,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:23:15,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:23:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:15,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:23:15,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:23:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 04:23:15,611 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-13 04:23:15,612 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3180 states and 5146 transitions. cyclomatic complexity: 1972 Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:23:15,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-13 04:23:15,698 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3180 states and 5146 transitions. cyclomatic complexity: 1972. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8425 states and 13698 transitions. Complement of second has 5 states. [2022-07-13 04:23:15,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-13 04:23:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:23:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2022-07-13 04:23:15,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 202 transitions. Stem has 25 letters. Loop has 39 letters. [2022-07-13 04:23:15,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:23:15,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 202 transitions. Stem has 64 letters. Loop has 39 letters. [2022-07-13 04:23:15,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:23:15,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 202 transitions. Stem has 25 letters. Loop has 78 letters. [2022-07-13 04:23:15,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:23:15,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8425 states and 13698 transitions. [2022-07-13 04:23:15,734 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 3740 [2022-07-13 04:23:15,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8425 states to 8425 states and 13698 transitions. [2022-07-13 04:23:15,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3861 [2022-07-13 04:23:15,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3924 [2022-07-13 04:23:15,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8425 states and 13698 transitions. [2022-07-13 04:23:15,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:23:15,772 INFO L369 hiAutomatonCegarLoop]: Abstraction has 8425 states and 13698 transitions. [2022-07-13 04:23:15,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8425 states and 13698 transitions. [2022-07-13 04:23:15,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8425 to 8362. [2022-07-13 04:23:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8362 states, 8362 states have (on average 1.6270031093039943) internal successors, (13605), 8361 states have internal predecessors, (13605), 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) [2022-07-13 04:23:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8362 states to 8362 states and 13605 transitions. [2022-07-13 04:23:15,921 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8362 states and 13605 transitions. [2022-07-13 04:23:15,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:23:15,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:23:15,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:23:15,922 INFO L87 Difference]: Start difference. First operand 8362 states and 13605 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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) [2022-07-13 04:23:16,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:23:16,027 INFO L93 Difference]: Finished difference Result 13026 states and 20958 transitions. [2022-07-13 04:23:16,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:23:16,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13026 states and 20958 transitions. [2022-07-13 04:23:16,092 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 5899 [2022-07-13 04:23:16,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13026 states to 13026 states and 20958 transitions. [2022-07-13 04:23:16,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6028 [2022-07-13 04:23:16,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6028 [2022-07-13 04:23:16,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13026 states and 20958 transitions. [2022-07-13 04:23:16,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:23:16,145 INFO L369 hiAutomatonCegarLoop]: Abstraction has 13026 states and 20958 transitions. [2022-07-13 04:23:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13026 states and 20958 transitions. [2022-07-13 04:23:16,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13026 to 13026. [2022-07-13 04:23:16,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13026 states, 13026 states have (on average 1.6089359742054352) internal successors, (20958), 13025 states have internal predecessors, (20958), 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) [2022-07-13 04:23:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13026 states to 13026 states and 20958 transitions. [2022-07-13 04:23:16,443 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13026 states and 20958 transitions. [2022-07-13 04:23:16,443 INFO L374 stractBuchiCegarLoop]: Abstraction has 13026 states and 20958 transitions. [2022-07-13 04:23:16,443 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-13 04:23:16,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13026 states and 20958 transitions. [2022-07-13 04:23:16,493 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 5899 [2022-07-13 04:23:16,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:23:16,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:23:16,493 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:16,494 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:16,494 INFO L752 eck$LassoCheckResult]: Stem: 62993#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 62856#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 62857#L404 assume !(1 == ~c_req_up~0); 62921#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 62792#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 62793#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 62956#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 62957#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 63003#L435-1 assume !(0 == ~e_f~0); 63004#L440-1 assume !(0 == ~e_g~0); 62860#L445-1 assume !(0 == ~e_e~0); 62861#L450-1 assume !(0 == ~e_c~0); 62790#L455-1 assume !(0 == ~e_wl~0); 62791#L460-1 assume !(1 == ~wl_pc~0); 63034#L472 assume !(2 == ~wl_pc~0); 62997#L473 assume !(1 == ~c1_pc~0); 62972#L483 assume !(1 == ~c2_pc~0); 62760#L492 assume !(1 == ~wb_pc~0); 62859#L501 assume !(1 == ~e_c~0); 62889#L510-1 assume !(1 == ~e_e~0); 63017#L515-1 assume !(1 == ~e_f~0); 62757#L520-1 assume !(1 == ~e_g~0); 62758#L525-1 assume !(1 == ~e_c~0); 62862#L530-1 assume !(1 == ~e_wl~0); 64804#L672-1 assume !false; 64805#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 71626#L377 [2022-07-13 04:23:16,494 INFO L754 eck$LassoCheckResult]: Loop: 71626#L377 assume !false; 71623#L295 assume 0 == ~wl_st~0; 71620#L308-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 71614#L321 assume !(0 != eval_~tmp~0#1); 71613#L317 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 71345#L336 assume !(0 != eval_~tmp___0~0#1); 71610#L332 assume !(0 == ~c2_st~0); 73069#L347 assume !(0 == ~wb_st~0); 71633#L362 assume !(0 == ~r_st~0); 71626#L377 [2022-07-13 04:23:16,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:16,494 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2022-07-13 04:23:16,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:16,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345639685] [2022-07-13 04:23:16,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:16,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:16,500 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:23:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:16,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:23:16,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:16,506 INFO L85 PathProgramCache]: Analyzing trace with hash 910089250, now seen corresponding path program 1 times [2022-07-13 04:23:16,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:16,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679465952] [2022-07-13 04:23:16,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:16,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:16,508 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:23:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:16,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:23:16,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:16,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1807696598, now seen corresponding path program 1 times [2022-07-13 04:23:16,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:16,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072974813] [2022-07-13 04:23:16,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:16,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:16,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:16,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072974813] [2022-07-13 04:23:16,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072974813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:16,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:16,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:23:16,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359291870] [2022-07-13 04:23:16,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:16,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:23:16,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:23:16,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:23:16,594 INFO L87 Difference]: Start difference. First operand 13026 states and 20958 transitions. cyclomatic complexity: 7950 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:23:16,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:23:16,671 INFO L93 Difference]: Finished difference Result 20176 states and 31971 transitions. [2022-07-13 04:23:16,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:23:16,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20176 states and 31971 transitions. [2022-07-13 04:23:16,814 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 9212 [2022-07-13 04:23:16,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20176 states to 20176 states and 31971 transitions. [2022-07-13 04:23:16,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9426 [2022-07-13 04:23:16,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9426 [2022-07-13 04:23:16,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20176 states and 31971 transitions. [2022-07-13 04:23:16,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:23:16,893 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20176 states and 31971 transitions. [2022-07-13 04:23:16,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20176 states and 31971 transitions. [2022-07-13 04:23:17,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20176 to 20176. [2022-07-13 04:23:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20176 states, 20176 states have (on average 1.5846054718477398) internal successors, (31971), 20175 states have internal predecessors, (31971), 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) [2022-07-13 04:23:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20176 states to 20176 states and 31971 transitions. [2022-07-13 04:23:17,448 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20176 states and 31971 transitions. [2022-07-13 04:23:17,448 INFO L374 stractBuchiCegarLoop]: Abstraction has 20176 states and 31971 transitions. [2022-07-13 04:23:17,448 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-13 04:23:17,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20176 states and 31971 transitions. [2022-07-13 04:23:17,597 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 9212 [2022-07-13 04:23:17,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:23:17,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:23:17,598 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:17,598 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:17,598 INFO L752 eck$LassoCheckResult]: Stem: 96218#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 96066#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 96067#L404 assume !(1 == ~c_req_up~0); 96130#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 96000#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 96001#L420-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 96280#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 98656#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 98655#L435-1 assume !(0 == ~e_f~0); 98654#L440-1 assume !(0 == ~e_g~0); 98653#L445-1 assume !(0 == ~e_e~0); 98652#L450-1 assume !(0 == ~e_c~0); 98651#L455-1 assume !(0 == ~e_wl~0); 98650#L460-1 assume !(1 == ~wl_pc~0); 98647#L472 assume !(2 == ~wl_pc~0); 98646#L473 assume !(1 == ~c1_pc~0); 98643#L483 assume !(1 == ~c2_pc~0); 96209#L492 assume !(1 == ~wb_pc~0); 96069#L501 assume !(1 == ~e_c~0); 96250#L510-1 assume !(1 == ~e_e~0); 96247#L515-1 assume !(1 == ~e_f~0); 95965#L520-1 assume !(1 == ~e_g~0); 95966#L525-1 assume !(1 == ~e_c~0); 96072#L530-1 assume !(1 == ~e_wl~0); 98634#L672-1 assume !false; 98635#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 108486#L377 [2022-07-13 04:23:17,598 INFO L754 eck$LassoCheckResult]: Loop: 108486#L377 assume !false; 108483#L295 assume 0 == ~wl_st~0; 108478#L308-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 108475#L321 assume !(0 != eval_~tmp~0#1); 108473#L317 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 108461#L336 assume !(0 != eval_~tmp___0~0#1); 108472#L332 assume !(0 == ~c2_st~0); 109228#L347 assume !(0 == ~wb_st~0); 108491#L362 assume !(0 == ~r_st~0); 108486#L377 [2022-07-13 04:23:17,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2022-07-13 04:23:17,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:17,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135836383] [2022-07-13 04:23:17,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:17,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:17,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135836383] [2022-07-13 04:23:17,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135836383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:17,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:17,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:23:17,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212151975] [2022-07-13 04:23:17,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:17,617 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:23:17,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:17,618 INFO L85 PathProgramCache]: Analyzing trace with hash 910089250, now seen corresponding path program 2 times [2022-07-13 04:23:17,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:17,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028042288] [2022-07-13 04:23:17,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:17,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:17,621 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:23:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:17,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:23:17,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:23:17,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:23:17,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:23:17,660 INFO L87 Difference]: Start difference. First operand 20176 states and 31971 transitions. cyclomatic complexity: 11813 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2022-07-13 04:23:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:23:17,725 INFO L93 Difference]: Finished difference Result 20104 states and 31852 transitions. [2022-07-13 04:23:17,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:23:17,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20104 states and 31852 transitions. [2022-07-13 04:23:17,806 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 9212 [2022-07-13 04:23:17,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20104 states to 20104 states and 31852 transitions. [2022-07-13 04:23:17,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9357 [2022-07-13 04:23:17,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9357 [2022-07-13 04:23:17,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20104 states and 31852 transitions. [2022-07-13 04:23:17,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:23:17,936 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20104 states and 31852 transitions. [2022-07-13 04:23:17,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20104 states and 31852 transitions. [2022-07-13 04:23:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20104 to 20104. [2022-07-13 04:23:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20104 states, 20104 states have (on average 1.5843613211301233) internal successors, (31852), 20103 states have internal predecessors, (31852), 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) [2022-07-13 04:23:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20104 states to 20104 states and 31852 transitions. [2022-07-13 04:23:18,304 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20104 states and 31852 transitions. [2022-07-13 04:23:18,304 INFO L374 stractBuchiCegarLoop]: Abstraction has 20104 states and 31852 transitions. [2022-07-13 04:23:18,304 INFO L287 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-13 04:23:18,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20104 states and 31852 transitions. [2022-07-13 04:23:18,353 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 9212 [2022-07-13 04:23:18,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:23:18,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:23:18,356 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:18,357 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:18,357 INFO L752 eck$LassoCheckResult]: Stem: 136495#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 136346#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 136347#L404 assume !(1 == ~c_req_up~0); 136416#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 136289#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 136290#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 136451#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 136452#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 136499#L435-1 assume !(0 == ~e_f~0); 136500#L440-1 assume !(0 == ~e_g~0); 136350#L445-1 assume !(0 == ~e_e~0); 136351#L450-1 assume !(0 == ~e_c~0); 136283#L455-1 assume !(0 == ~e_wl~0); 136284#L460-1 assume !(1 == ~wl_pc~0); 136532#L472 assume !(2 == ~wl_pc~0); 136497#L473 assume !(1 == ~c1_pc~0); 136476#L483 assume !(1 == ~c2_pc~0); 136253#L492 assume !(1 == ~wb_pc~0); 136349#L501 assume !(1 == ~e_c~0); 136380#L510-1 assume !(1 == ~e_e~0); 136515#L515-1 assume !(1 == ~e_f~0); 136250#L520-1 assume !(1 == ~e_g~0); 136251#L525-1 assume !(1 == ~e_c~0); 136352#L530-1 assume !(1 == ~e_wl~0); 138595#L672-1 assume !false; 138596#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 148552#L377 [2022-07-13 04:23:18,357 INFO L754 eck$LassoCheckResult]: Loop: 148552#L377 assume !false; 148550#L295 assume 0 == ~wl_st~0; 148548#L308-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 148545#L321 assume !(0 != eval_~tmp~0#1); 148546#L317 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 147594#L336 assume !(0 != eval_~tmp___0~0#1); 147609#L332 assume 0 == ~c2_st~0;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 148567#L351 assume !(0 != eval_~tmp___1~0#1); 148566#L347 assume !(0 == ~wb_st~0); 148559#L362 assume !(0 == ~r_st~0); 148552#L377 [2022-07-13 04:23:18,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:18,357 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2022-07-13 04:23:18,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:18,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888246630] [2022-07-13 04:23:18,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:18,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:18,364 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:23:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:18,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:23:18,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:18,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1853655075, now seen corresponding path program 1 times [2022-07-13 04:23:18,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:18,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467751565] [2022-07-13 04:23:18,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:18,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:18,374 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:23:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:18,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:23:18,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:18,378 INFO L85 PathProgramCache]: Analyzing trace with hash -205670443, now seen corresponding path program 1 times [2022-07-13 04:23:18,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:18,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912205324] [2022-07-13 04:23:18,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:18,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:23:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:23:18,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:23:18,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912205324] [2022-07-13 04:23:18,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912205324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:23:18,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:23:18,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:23:18,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959210055] [2022-07-13 04:23:18,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:23:18,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:23:18,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:23:18,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:23:18,443 INFO L87 Difference]: Start difference. First operand 20104 states and 31852 transitions. cyclomatic complexity: 11766 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2022-07-13 04:23:18,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:23:18,553 INFO L93 Difference]: Finished difference Result 33433 states and 51943 transitions. [2022-07-13 04:23:18,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:23:18,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33433 states and 51943 transitions. [2022-07-13 04:23:18,792 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 15444 [2022-07-13 04:23:18,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33433 states to 33433 states and 51943 transitions. [2022-07-13 04:23:18,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15625 [2022-07-13 04:23:18,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15625 [2022-07-13 04:23:18,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33433 states and 51943 transitions. [2022-07-13 04:23:18,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:23:18,899 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33433 states and 51943 transitions. [2022-07-13 04:23:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33433 states and 51943 transitions. [2022-07-13 04:23:19,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33433 to 33433. [2022-07-13 04:23:19,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33433 states, 33433 states have (on average 1.553644602638112) internal successors, (51943), 33432 states have internal predecessors, (51943), 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) [2022-07-13 04:23:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33433 states to 33433 states and 51943 transitions. [2022-07-13 04:23:19,364 INFO L392 hiAutomatonCegarLoop]: Abstraction has 33433 states and 51943 transitions. [2022-07-13 04:23:19,364 INFO L374 stractBuchiCegarLoop]: Abstraction has 33433 states and 51943 transitions. [2022-07-13 04:23:19,364 INFO L287 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-07-13 04:23:19,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33433 states and 51943 transitions. [2022-07-13 04:23:19,452 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 15444 [2022-07-13 04:23:19,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:23:19,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:23:19,453 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:19,453 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:23:19,453 INFO L752 eck$LassoCheckResult]: Stem: 190048#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 189894#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 189895#L404 assume !(1 == ~c_req_up~0); 189961#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 189829#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 189830#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 189997#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 189998#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 190055#L435-1 assume !(0 == ~e_f~0); 190056#L440-1 assume !(0 == ~e_g~0); 189898#L445-1 assume !(0 == ~e_e~0); 189899#L450-1 assume !(0 == ~e_c~0); 189827#L455-1 assume !(0 == ~e_wl~0); 189828#L460-1 assume !(1 == ~wl_pc~0); 190091#L472 assume !(2 == ~wl_pc~0); 190050#L473 assume !(1 == ~c1_pc~0); 190017#L483 assume !(1 == ~c2_pc~0); 189797#L492 assume !(1 == ~wb_pc~0); 189897#L501 assume !(1 == ~e_c~0); 189928#L510-1 assume !(1 == ~e_e~0); 190074#L515-1 assume !(1 == ~e_f~0); 189794#L520-1 assume !(1 == ~e_g~0); 189795#L525-1 assume !(1 == ~e_c~0); 189900#L530-1 assume !(1 == ~e_wl~0); 196797#L672-1 assume !false; 196798#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 207344#L377 [2022-07-13 04:23:19,453 INFO L754 eck$LassoCheckResult]: Loop: 207344#L377 assume !false; 209577#L295 assume 0 == ~wl_st~0; 209575#L308-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 209573#L321 assume !(0 != eval_~tmp~0#1); 208610#L317 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 208608#L336 assume !(0 != eval_~tmp___0~0#1); 208606#L332 assume 0 == ~c2_st~0;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 208594#L351 assume !(0 != eval_~tmp___1~0#1); 208603#L347 assume 0 == ~wb_st~0;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 208706#L366 assume !(0 != eval_~tmp___2~0#1); 208716#L362 assume !(0 == ~r_st~0); 207344#L377 [2022-07-13 04:23:19,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:19,453 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2022-07-13 04:23:19,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:19,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855845358] [2022-07-13 04:23:19,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:19,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:19,458 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:23:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:19,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:23:19,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1628767882, now seen corresponding path program 1 times [2022-07-13 04:23:19,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:19,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877744903] [2022-07-13 04:23:19,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:19,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:19,467 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:23:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:19,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:23:19,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:23:19,469 INFO L85 PathProgramCache]: Analyzing trace with hash -2080851842, now seen corresponding path program 1 times [2022-07-13 04:23:19,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:23:19,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452652017] [2022-07-13 04:23:19,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:23:19,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:23:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:19,474 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:23:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:23:19,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:23:20,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 04:23:20 BoogieIcfgContainer [2022-07-13 04:23:20,401 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 04:23:20,402 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 04:23:20,402 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 04:23:20,402 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 04:23:20,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:23:08" (3/4) ... [2022-07-13 04:23:20,404 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-13 04:23:20,439 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 04:23:20,440 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 04:23:20,440 INFO L158 Benchmark]: Toolchain (without parser) took 13203.75ms. Allocated memory was 115.3MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 77.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 379.2MB. Max. memory is 16.1GB. [2022-07-13 04:23:20,440 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:23:20,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.27ms. Allocated memory is still 115.3MB. Free memory was 77.3MB in the beginning and 87.4MB in the end (delta: -10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 04:23:20,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.77ms. Allocated memory is still 115.3MB. Free memory was 87.4MB in the beginning and 85.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:23:20,441 INFO L158 Benchmark]: Boogie Preprocessor took 31.24ms. Allocated memory is still 115.3MB. Free memory was 85.0MB in the beginning and 83.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:23:20,441 INFO L158 Benchmark]: RCFGBuilder took 503.56ms. Allocated memory is still 115.3MB. Free memory was 83.3MB in the beginning and 64.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-13 04:23:20,442 INFO L158 Benchmark]: BuchiAutomizer took 12274.41ms. Allocated memory was 115.3MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 64.0MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 446.8MB. Max. memory is 16.1GB. [2022-07-13 04:23:20,442 INFO L158 Benchmark]: Witness Printer took 38.17ms. Allocated memory is still 2.0GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 04:23:20,443 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.27ms. Allocated memory is still 115.3MB. Free memory was 77.3MB in the beginning and 87.4MB in the end (delta: -10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.77ms. Allocated memory is still 115.3MB. Free memory was 87.4MB in the beginning and 85.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.24ms. Allocated memory is still 115.3MB. Free memory was 85.0MB in the beginning and 83.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 503.56ms. Allocated memory is still 115.3MB. Free memory was 83.3MB in the beginning and 64.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 12274.41ms. Allocated memory was 115.3MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 64.0MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 446.8MB. Max. memory is 16.1GB. * Witness Printer took 38.17ms. Allocated memory is still 2.0GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 19 terminating modules (16 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_wl + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_g + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_e + 1 and consists of 3 locations. 16 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 33433 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.2s and 17 iterations. TraceHistogramMax:2. Analysis of lassos took 6.6s. Construction of modules took 0.3s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 10. Automata minimization 2.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 1573 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 1.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4286 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4283 mSDsluCounter, 7691 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3114 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 4577 mSDtfsCounter, 413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc2 concLT2 SILN1 SILU0 SILI8 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital82 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq180 hnf100 smp100 dnf211 smp54 tf110 neg94 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 21 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 294]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {p_out=0, wb_st=0, NULL=0, processed=0, tmp___3=0, __retres1=0, NULL=1, tmp___2=0, c2_st=0, wl_pc=0, e_wl=2, e_c=2, e_e=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6999d191=0, e_p_in=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@441872dd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63e34829=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45026df8=0, t_b=0, p_in=0, wb_pc=0, data=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3fa21cf7=0, wb_i=1, tmp___1=0, c_req_up=0, c_t=0, wl_i=1, c1_st=0, c=0, wl_st=0, c1_i=1, c2_pc=0, c2_i=1, tmp=0, tmp___0=0, \result=0, r_i=0, d=0, e_f=2, e_g=2, NULL=0, kernel_st=1, r_st=2, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 294]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; [L689] int __retres1 ; [L693] e_wl = 2 [L694] e_c = e_wl [L695] e_g = e_c [L696] e_f = e_g [L697] e_e = e_f [L698] wl_pc = 0 [L699] c1_pc = 0 [L700] c2_pc = 0 [L701] wb_pc = 0 [L702] wb_i = 1 [L703] c2_i = wb_i [L704] c1_i = c2_i [L705] wl_i = c1_i [L706] r_i = 0 [L707] c_req_up = 0 [L708] d = 0 [L709] c = 0 [L710] CALL start_simulation() [L400] int kernel_st ; [L403] kernel_st = 0 [L404] COND FALSE !((int )c_req_up == 1) [L415] COND TRUE (int )wl_i == 1 [L416] wl_st = 0 [L420] COND TRUE (int )c1_i == 1 [L421] c1_st = 0 [L425] COND TRUE (int )c2_i == 1 [L426] c2_st = 0 [L430] COND TRUE (int )wb_i == 1 [L431] wb_st = 0 [L435] COND FALSE !((int )r_i == 1) [L438] r_st = 2 [L440] COND FALSE !((int )e_f == 0) [L445] COND FALSE !((int )e_g == 0) [L450] COND FALSE !((int )e_e == 0) [L455] COND FALSE !((int )e_c == 0) [L460] COND FALSE !((int )e_wl == 0) [L465] COND FALSE !((int )wl_pc == 1) [L473] COND FALSE !((int )wl_pc == 2) [L483] COND FALSE !((int )c1_pc == 1) [L492] COND FALSE !((int )c2_pc == 1) [L501] COND FALSE !((int )wb_pc == 1) [L510] COND FALSE !((int )e_c == 1) [L515] COND FALSE !((int )e_e == 1) [L520] COND FALSE !((int )e_f == 1) [L525] COND FALSE !((int )e_g == 1) [L530] COND FALSE !((int )e_c == 1) [L535] COND FALSE !((int )e_wl == 1) [L541] COND TRUE 1 [L544] kernel_st = 1 [L545] CALL eval() [L286] int tmp ; [L287] int tmp___0 ; [L288] int tmp___1 ; [L289] int tmp___2 ; [L290] int tmp___3 ; Loop: [L294] COND TRUE 1 [L296] COND TRUE (int )wl_st == 0 [L317] COND TRUE (int )wl_st == 0 [L319] tmp = __VERIFIER_nondet_int() [L321] COND FALSE !(\read(tmp)) [L332] COND TRUE (int )c1_st == 0 [L334] tmp___0 = __VERIFIER_nondet_int() [L336] COND FALSE !(\read(tmp___0)) [L347] COND TRUE (int )c2_st == 0 [L349] tmp___1 = __VERIFIER_nondet_int() [L351] COND FALSE !(\read(tmp___1)) [L362] COND TRUE (int )wb_st == 0 [L364] tmp___2 = __VERIFIER_nondet_int() [L366] COND FALSE !(\read(tmp___2)) [L377] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-13 04:23:20,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)