./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/safe006_power.oepc-thin000_power.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/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/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i ./goblint.2024-06-19_11-23-25.files/protection/safe006_power.oepc-thin000_power.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 18:50:32,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 18:50:32,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 18:50:32,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 18:50:32,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 18:50:32,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 18:50:32,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 18:50:32,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 18:50:32,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 18:50:32,967 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 18:50:32,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 18:50:32,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 18:50:32,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 18:50:32,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 18:50:32,969 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 18:50:32,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 18:50:32,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 18:50:32,970 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 18:50:32,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 18:50:32,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 18:50:32,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 18:50:32,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 18:50:32,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 18:50:32,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 18:50:32,971 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 18:50:32,972 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 18:50:32,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 18:50:32,972 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 18:50:32,973 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 18:50:32,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 18:50:32,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 18:50:32,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 18:50:32,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:50:32,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 18:50:32,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 18:50:32,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 18:50:32,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 18:50:32,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 18:50:32,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 18:50:32,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 18:50:32,976 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 18:50:32,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 18:50:32,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 18:50:32,976 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 18:50:33,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 18:50:33,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 18:50:33,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 18:50:33,163 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 18:50:33,163 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 18:50:33,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2024-06-27 18:50:34,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 18:50:34,475 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 18:50:34,477 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2024-06-27 18:50:34,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73397c7d7/b98e91954c564731aa4463d87d001b54/FLAGf08ecf804 [2024-06-27 18:50:34,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73397c7d7/b98e91954c564731aa4463d87d001b54 [2024-06-27 18:50:34,510 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 18:50:34,511 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 18:50:34,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/safe006_power.oepc-thin000_power.oepc.yml/witness.yml [2024-06-27 18:50:34,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 18:50:34,644 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 18:50:34,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 18:50:34,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 18:50:34,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 18:50:34,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:50:34" (1/2) ... [2024-06-27 18:50:34,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7aa214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:50:34, skipping insertion in model container [2024-06-27 18:50:34,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:50:34" (1/2) ... [2024-06-27 18:50:34,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@66f0dafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:50:34, skipping insertion in model container [2024-06-27 18:50:34,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:50:34" (2/2) ... [2024-06-27 18:50:34,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7aa214 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:50:34, skipping insertion in model container [2024-06-27 18:50:34,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:50:34" (2/2) ... [2024-06-27 18:50:34,654 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 18:50:34,758 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 18:50:34,760 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] (((((((((((((((((((((((((((((((! multithreaded || y$r_buff1_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$w_buff1_used == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || y$w_buff1 == 0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1))))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || y$w_buff0 == 0)) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0) [2024-06-27 18:50:34,760 INFO L97 edCorrectnessWitness]: Location invariant before [L817-L817] (((((((((((((((((((((((((((((((! multithreaded || y$r_buff1_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$w_buff1_used == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || y$w_buff1 == 0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1))))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || y$w_buff0 == 0)) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0) [2024-06-27 18:50:34,760 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 18:50:34,760 INFO L106 edCorrectnessWitness]: ghost_update [L814-L814] multithreaded = 1; [2024-06-27 18:50:34,796 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 18:50:34,981 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i[1014,1027] [2024-06-27 18:50:35,149 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:50:35,158 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 18:50:35,186 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i[1014,1027] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 18:50:35,249 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:50:35,278 INFO L206 MainTranslator]: Completed translation [2024-06-27 18:50:35,279 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:50:35 WrapperNode [2024-06-27 18:50:35,279 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 18:50:35,280 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 18:50:35,280 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 18:50:35,280 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 18:50:35,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:50:35" (1/1) ... [2024-06-27 18:50:35,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:50:35" (1/1) ... [2024-06-27 18:50:35,319 INFO L138 Inliner]: procedures = 174, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 144 [2024-06-27 18:50:35,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 18:50:35,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 18:50:35,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 18:50:35,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 18:50:35,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:50:35" (1/1) ... [2024-06-27 18:50:35,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:50:35" (1/1) ... [2024-06-27 18:50:35,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:50:35" (1/1) ... [2024-06-27 18:50:35,346 INFO L175 MemorySlicer]: Split 25 memory accesses to 2 slices as follows [2, 23]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-06-27 18:50:35,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:50:35" (1/1) ... [2024-06-27 18:50:35,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:50:35" (1/1) ... [2024-06-27 18:50:35,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:50:35" (1/1) ... [2024-06-27 18:50:35,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:50:35" (1/1) ... [2024-06-27 18:50:35,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:50:35" (1/1) ... [2024-06-27 18:50:35,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:50:35" (1/1) ... [2024-06-27 18:50:35,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 18:50:35,365 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 18:50:35,365 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 18:50:35,365 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 18:50:35,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:50:35" (1/1) ... [2024-06-27 18:50:35,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:50:35,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:50:35,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 18:50:35,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 18:50:35,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 18:50:35,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 18:50:35,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 18:50:35,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 18:50:35,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 18:50:35,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 18:50:35,466 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 18:50:35,466 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 18:50:35,467 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 18:50:35,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 18:50:35,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 18:50:35,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 18:50:35,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 18:50:35,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 18:50:35,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 18:50:35,471 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 18:50:35,605 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 18:50:35,607 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 18:50:35,953 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 18:50:35,954 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 18:50:36,198 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 18:50:36,198 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 18:50:36,199 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:50:36 BoogieIcfgContainer [2024-06-27 18:50:36,199 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 18:50:36,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 18:50:36,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 18:50:36,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 18:50:36,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 06:50:34" (1/4) ... [2024-06-27 18:50:36,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9b6028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:50:36, skipping insertion in model container [2024-06-27 18:50:36,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:50:34" (2/4) ... [2024-06-27 18:50:36,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9b6028 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:50:36, skipping insertion in model container [2024-06-27 18:50:36,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:50:35" (3/4) ... [2024-06-27 18:50:36,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9b6028 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:50:36, skipping insertion in model container [2024-06-27 18:50:36,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:50:36" (4/4) ... [2024-06-27 18:50:36,206 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2024-06-27 18:50:36,221 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 18:50:36,222 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 18:50:36,222 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 18:50:36,264 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 18:50:36,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 18:50:36,319 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-06-27 18:50:36,319 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:50:36,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 1/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-06-27 18:50:36,322 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 18:50:36,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 66 flow [2024-06-27 18:50:36,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 18:50:36,345 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@30c905c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 18:50:36,345 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 18:50:36,351 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 18:50:36,351 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-27 18:50:36,351 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:50:36,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:50:36,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 18:50:36,352 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:50:36,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:50:36,401 INFO L85 PathProgramCache]: Analyzing trace with hash 581753035, now seen corresponding path program 1 times [2024-06-27 18:50:36,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:50:36,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991904766] [2024-06-27 18:50:36,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:50:36,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:50:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:50:37,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:50:37,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:50:37,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991904766] [2024-06-27 18:50:37,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991904766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:50:37,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:50:37,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:50:37,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117888565] [2024-06-27 18:50:37,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:50:37,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:50:37,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:50:37,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:50:37,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:50:37,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 18:50:37,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-06-27 18:50:37,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:50:37,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 18:50:37,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:50:38,164 INFO L124 PetriNetUnfolderBase]: 353/667 cut-off events. [2024-06-27 18:50:38,164 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-27 18:50:38,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 667 events. 353/667 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3119 event pairs, 175 based on Foata normal form. 0/635 useless extension candidates. Maximal degree in co-relation 1274. Up to 592 conditions per place. [2024-06-27 18:50:38,170 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 31 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-27 18:50:38,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 163 flow [2024-06-27 18:50:38,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:50:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:50:38,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-06-27 18:50:38,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2024-06-27 18:50:38,180 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 66 flow. Second operand 3 states and 67 transitions. [2024-06-27 18:50:38,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 163 flow [2024-06-27 18:50:38,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:50:38,184 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2024-06-27 18:50:38,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2024-06-27 18:50:38,188 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2024-06-27 18:50:38,188 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2024-06-27 18:50:38,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-06-27 18:50:38,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:50:38,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:50:38,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 18:50:38,189 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:50:38,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:50:38,190 INFO L85 PathProgramCache]: Analyzing trace with hash 718961770, now seen corresponding path program 1 times [2024-06-27 18:50:38,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:50:38,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562222070] [2024-06-27 18:50:38,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:50:38,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:50:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:50:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:50:39,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:50:39,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562222070] [2024-06-27 18:50:39,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562222070] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:50:39,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:50:39,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:50:39,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095349089] [2024-06-27 18:50:39,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:50:39,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:50:39,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:50:39,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:50:39,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:50:39,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 18:50:39,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:50:39,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:50:39,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 18:50:39,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:50:40,272 INFO L124 PetriNetUnfolderBase]: 350/625 cut-off events. [2024-06-27 18:50:40,272 INFO L125 PetriNetUnfolderBase]: For 107/111 co-relation queries the response was YES. [2024-06-27 18:50:40,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 625 events. 350/625 cut-off events. For 107/111 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2825 event pairs, 100 based on Foata normal form. 4/626 useless extension candidates. Maximal degree in co-relation 1386. Up to 562 conditions per place. [2024-06-27 18:50:40,276 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 44 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2024-06-27 18:50:40,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 58 transitions, 256 flow [2024-06-27 18:50:40,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:50:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:50:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2024-06-27 18:50:40,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-06-27 18:50:40,278 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 91 transitions. [2024-06-27 18:50:40,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 58 transitions, 256 flow [2024-06-27 18:50:40,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:50:40,280 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 135 flow [2024-06-27 18:50:40,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-06-27 18:50:40,280 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2024-06-27 18:50:40,281 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 135 flow [2024-06-27 18:50:40,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:50:40,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:50:40,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:50:40,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 18:50:40,282 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:50:40,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:50:40,282 INFO L85 PathProgramCache]: Analyzing trace with hash 812979814, now seen corresponding path program 1 times [2024-06-27 18:50:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:50:40,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465540496] [2024-06-27 18:50:40,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:50:40,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:50:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:50:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:50:41,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:50:41,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465540496] [2024-06-27 18:50:41,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465540496] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:50:41,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:50:41,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:50:41,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666223737] [2024-06-27 18:50:41,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:50:41,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:50:41,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:50:41,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:50:41,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:50:41,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:50:41,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:50:41,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:50:41,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:50:41,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:50:42,534 INFO L124 PetriNetUnfolderBase]: 419/734 cut-off events. [2024-06-27 18:50:42,534 INFO L125 PetriNetUnfolderBase]: For 369/369 co-relation queries the response was YES. [2024-06-27 18:50:42,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1855 conditions, 734 events. 419/734 cut-off events. For 369/369 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3302 event pairs, 73 based on Foata normal form. 2/734 useless extension candidates. Maximal degree in co-relation 1840. Up to 649 conditions per place. [2024-06-27 18:50:42,540 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 63 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2024-06-27 18:50:42,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 77 transitions, 384 flow [2024-06-27 18:50:42,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:50:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:50:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2024-06-27 18:50:42,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-06-27 18:50:42,546 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 135 flow. Second operand 5 states and 110 transitions. [2024-06-27 18:50:42,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 77 transitions, 384 flow [2024-06-27 18:50:42,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 18:50:42,549 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 205 flow [2024-06-27 18:50:42,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2024-06-27 18:50:42,551 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2024-06-27 18:50:42,551 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 205 flow [2024-06-27 18:50:42,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:50:42,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:50:42,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:50:42,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 18:50:42,552 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:50:42,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:50:42,553 INFO L85 PathProgramCache]: Analyzing trace with hash -410400027, now seen corresponding path program 1 times [2024-06-27 18:50:42,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:50:42,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320291752] [2024-06-27 18:50:42,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:50:42,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:50:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:50:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:50:44,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:50:44,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320291752] [2024-06-27 18:50:44,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320291752] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:50:44,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:50:44,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:50:44,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468190868] [2024-06-27 18:50:44,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:50:44,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:50:44,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:50:44,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:50:44,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:50:44,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:50:44,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:50:44,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:50:44,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:50:44,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:50:45,170 INFO L124 PetriNetUnfolderBase]: 415/726 cut-off events. [2024-06-27 18:50:45,170 INFO L125 PetriNetUnfolderBase]: For 615/615 co-relation queries the response was YES. [2024-06-27 18:50:45,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 726 events. 415/726 cut-off events. For 615/615 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3280 event pairs, 24 based on Foata normal form. 4/728 useless extension candidates. Maximal degree in co-relation 2036. Up to 595 conditions per place. [2024-06-27 18:50:45,174 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 69 selfloop transitions, 9 changer transitions 0/84 dead transitions. [2024-06-27 18:50:45,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 84 transitions, 449 flow [2024-06-27 18:50:45,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:50:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:50:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-06-27 18:50:45,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-27 18:50:45,175 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 205 flow. Second operand 6 states and 126 transitions. [2024-06-27 18:50:45,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 84 transitions, 449 flow [2024-06-27 18:50:45,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 84 transitions, 449 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 18:50:45,178 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 219 flow [2024-06-27 18:50:45,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2024-06-27 18:50:45,179 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2024-06-27 18:50:45,179 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 219 flow [2024-06-27 18:50:45,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:50:45,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:50:45,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:50:45,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 18:50:45,180 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:50:45,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:50:45,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1687989666, now seen corresponding path program 1 times [2024-06-27 18:50:45,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:50:45,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295741420] [2024-06-27 18:50:45,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:50:45,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:50:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:50:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:50:46,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:50:46,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295741420] [2024-06-27 18:50:46,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295741420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:50:46,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:50:46,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:50:46,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465396807] [2024-06-27 18:50:46,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:50:46,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:50:46,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:50:46,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:50:46,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:50:46,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:50:46,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 219 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:50:46,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:50:46,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:50:46,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:50:47,264 INFO L124 PetriNetUnfolderBase]: 411/766 cut-off events. [2024-06-27 18:50:47,265 INFO L125 PetriNetUnfolderBase]: For 904/904 co-relation queries the response was YES. [2024-06-27 18:50:47,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2197 conditions, 766 events. 411/766 cut-off events. For 904/904 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3585 event pairs, 114 based on Foata normal form. 2/766 useless extension candidates. Maximal degree in co-relation 2173. Up to 650 conditions per place. [2024-06-27 18:50:47,270 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 48 selfloop transitions, 9 changer transitions 0/62 dead transitions. [2024-06-27 18:50:47,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 384 flow [2024-06-27 18:50:47,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:50:47,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:50:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-06-27 18:50:47,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2024-06-27 18:50:47,277 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 219 flow. Second operand 5 states and 87 transitions. [2024-06-27 18:50:47,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 384 flow [2024-06-27 18:50:47,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 62 transitions, 358 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-27 18:50:47,282 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 238 flow [2024-06-27 18:50:47,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-06-27 18:50:47,286 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2024-06-27 18:50:47,287 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 238 flow [2024-06-27 18:50:47,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:50:47,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:50:47,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:50:47,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 18:50:47,288 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:50:47,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:50:47,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1517031353, now seen corresponding path program 1 times [2024-06-27 18:50:47,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:50:47,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203446212] [2024-06-27 18:50:47,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:50:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:50:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:50:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:50:49,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:50:49,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203446212] [2024-06-27 18:50:49,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203446212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:50:49,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:50:49,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:50:49,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662609217] [2024-06-27 18:50:49,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:50:49,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:50:49,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:50:49,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:50:49,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:50:49,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:50:49,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 238 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2024-06-27 18:50:49,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:50:49,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:50:49,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:50:50,260 INFO L124 PetriNetUnfolderBase]: 426/755 cut-off events. [2024-06-27 18:50:50,260 INFO L125 PetriNetUnfolderBase]: For 1035/1035 co-relation queries the response was YES. [2024-06-27 18:50:50,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2291 conditions, 755 events. 426/755 cut-off events. For 1035/1035 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3527 event pairs, 73 based on Foata normal form. 1/754 useless extension candidates. Maximal degree in co-relation 2266. Up to 589 conditions per place. [2024-06-27 18:50:50,264 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 68 selfloop transitions, 17 changer transitions 0/90 dead transitions. [2024-06-27 18:50:50,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 90 transitions, 536 flow [2024-06-27 18:50:50,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:50:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:50:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-27 18:50:50,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-27 18:50:50,265 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 238 flow. Second operand 7 states and 133 transitions. [2024-06-27 18:50:50,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 90 transitions, 536 flow [2024-06-27 18:50:50,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 90 transitions, 516 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-27 18:50:50,269 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 281 flow [2024-06-27 18:50:50,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=281, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2024-06-27 18:50:50,269 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places. [2024-06-27 18:50:50,269 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 281 flow [2024-06-27 18:50:50,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2024-06-27 18:50:50,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:50:50,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:50:50,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 18:50:50,270 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:50:50,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:50:50,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1516911383, now seen corresponding path program 2 times [2024-06-27 18:50:50,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:50:50,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028060482] [2024-06-27 18:50:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:50:50,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:50:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:50:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:50:52,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:50:52,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028060482] [2024-06-27 18:50:52,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028060482] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:50:52,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:50:52,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:50:52,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085600798] [2024-06-27 18:50:52,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:50:52,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:50:52,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:50:52,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:50:52,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:50:52,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:50:52,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 281 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2024-06-27 18:50:52,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:50:52,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:50:52,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:50:53,676 INFO L124 PetriNetUnfolderBase]: 456/809 cut-off events. [2024-06-27 18:50:53,677 INFO L125 PetriNetUnfolderBase]: For 1387/1387 co-relation queries the response was YES. [2024-06-27 18:50:53,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2637 conditions, 809 events. 456/809 cut-off events. For 1387/1387 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3854 event pairs, 71 based on Foata normal form. 1/808 useless extension candidates. Maximal degree in co-relation 2611. Up to 667 conditions per place. [2024-06-27 18:50:53,682 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 68 selfloop transitions, 16 changer transitions 0/89 dead transitions. [2024-06-27 18:50:53,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 89 transitions, 567 flow [2024-06-27 18:50:53,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:50:53,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:50:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-27 18:50:53,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2024-06-27 18:50:53,684 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 281 flow. Second operand 7 states and 127 transitions. [2024-06-27 18:50:53,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 89 transitions, 567 flow [2024-06-27 18:50:53,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 89 transitions, 531 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 18:50:53,688 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 318 flow [2024-06-27 18:50:53,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2024-06-27 18:50:53,689 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2024-06-27 18:50:53,689 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 318 flow [2024-06-27 18:50:53,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2024-06-27 18:50:53,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:50:53,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:50:53,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 18:50:53,690 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:50:53,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:50:53,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1516911197, now seen corresponding path program 1 times [2024-06-27 18:50:53,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:50:53,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934614572] [2024-06-27 18:50:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:50:53,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:50:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:50:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:50:55,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:50:55,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934614572] [2024-06-27 18:50:55,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934614572] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:50:55,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:50:55,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:50:55,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643627447] [2024-06-27 18:50:55,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:50:55,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:50:55,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:50:55,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:50:55,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:50:55,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:50:55,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 318 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2024-06-27 18:50:55,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:50:55,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:50:55,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:50:56,493 INFO L124 PetriNetUnfolderBase]: 520/915 cut-off events. [2024-06-27 18:50:56,495 INFO L125 PetriNetUnfolderBase]: For 1628/1628 co-relation queries the response was YES. [2024-06-27 18:50:56,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2943 conditions, 915 events. 520/915 cut-off events. For 1628/1628 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4368 event pairs, 80 based on Foata normal form. 2/915 useless extension candidates. Maximal degree in co-relation 2916. Up to 721 conditions per place. [2024-06-27 18:50:56,500 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 78 selfloop transitions, 20 changer transitions 0/103 dead transitions. [2024-06-27 18:50:56,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 103 transitions, 654 flow [2024-06-27 18:50:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:50:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:50:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-27 18:50:56,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-27 18:50:56,503 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 318 flow. Second operand 8 states and 147 transitions. [2024-06-27 18:50:56,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 103 transitions, 654 flow [2024-06-27 18:50:56,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 103 transitions, 623 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 18:50:56,508 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 373 flow [2024-06-27 18:50:56,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=373, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2024-06-27 18:50:56,510 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2024-06-27 18:50:56,510 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 373 flow [2024-06-27 18:50:56,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2024-06-27 18:50:56,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:50:56,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:50:56,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 18:50:56,511 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:50:56,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:50:56,511 INFO L85 PathProgramCache]: Analyzing trace with hash -898273721, now seen corresponding path program 3 times [2024-06-27 18:50:56,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:50:56,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78050499] [2024-06-27 18:50:56,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:50:56,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:50:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:50:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:50:58,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:50:58,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78050499] [2024-06-27 18:50:58,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78050499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:50:58,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:50:58,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:50:58,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995645631] [2024-06-27 18:50:58,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:50:58,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:50:58,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:50:58,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:50:58,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:50:58,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:50:58,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 373 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2024-06-27 18:50:58,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:50:58,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:50:58,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:50:59,541 INFO L124 PetriNetUnfolderBase]: 518/910 cut-off events. [2024-06-27 18:50:59,541 INFO L125 PetriNetUnfolderBase]: For 2058/2058 co-relation queries the response was YES. [2024-06-27 18:50:59,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3172 conditions, 910 events. 518/910 cut-off events. For 2058/2058 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4365 event pairs, 81 based on Foata normal form. 1/909 useless extension candidates. Maximal degree in co-relation 3143. Up to 724 conditions per place. [2024-06-27 18:50:59,545 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 68 selfloop transitions, 19 changer transitions 0/92 dead transitions. [2024-06-27 18:50:59,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 92 transitions, 633 flow [2024-06-27 18:50:59,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:50:59,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:50:59,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-27 18:50:59,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-06-27 18:50:59,547 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 373 flow. Second operand 6 states and 115 transitions. [2024-06-27 18:50:59,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 92 transitions, 633 flow [2024-06-27 18:50:59,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 92 transitions, 605 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 18:50:59,551 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 394 flow [2024-06-27 18:50:59,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2024-06-27 18:50:59,552 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 31 predicate places. [2024-06-27 18:50:59,552 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 394 flow [2024-06-27 18:50:59,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2024-06-27 18:50:59,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:50:59,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:50:59,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 18:50:59,555 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:50:59,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:50:59,555 INFO L85 PathProgramCache]: Analyzing trace with hash -898273535, now seen corresponding path program 2 times [2024-06-27 18:50:59,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:50:59,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001316354] [2024-06-27 18:50:59,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:50:59,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:50:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:01,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:01,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001316354] [2024-06-27 18:51:01,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001316354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:01,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:01,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:51:01,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001819998] [2024-06-27 18:51:01,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:01,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:51:01,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:01,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:51:01,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:51:01,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:01,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 394 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2024-06-27 18:51:01,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:01,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:01,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:02,003 INFO L124 PetriNetUnfolderBase]: 514/908 cut-off events. [2024-06-27 18:51:02,003 INFO L125 PetriNetUnfolderBase]: For 2378/2378 co-relation queries the response was YES. [2024-06-27 18:51:02,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3281 conditions, 908 events. 514/908 cut-off events. For 2378/2378 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4338 event pairs, 81 based on Foata normal form. 2/908 useless extension candidates. Maximal degree in co-relation 3250. Up to 715 conditions per place. [2024-06-27 18:51:02,008 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 64 selfloop transitions, 19 changer transitions 0/88 dead transitions. [2024-06-27 18:51:02,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 628 flow [2024-06-27 18:51:02,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:51:02,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:51:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2024-06-27 18:51:02,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-27 18:51:02,010 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 394 flow. Second operand 6 states and 111 transitions. [2024-06-27 18:51:02,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 628 flow [2024-06-27 18:51:02,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 88 transitions, 580 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-27 18:51:02,016 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 394 flow [2024-06-27 18:51:02,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2024-06-27 18:51:02,017 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 32 predicate places. [2024-06-27 18:51:02,017 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 394 flow [2024-06-27 18:51:02,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2024-06-27 18:51:02,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:02,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:02,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 18:51:02,018 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:02,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:02,018 INFO L85 PathProgramCache]: Analyzing trace with hash -898267025, now seen corresponding path program 3 times [2024-06-27 18:51:02,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:02,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193649962] [2024-06-27 18:51:02,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:02,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:03,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:03,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193649962] [2024-06-27 18:51:03,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193649962] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:03,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:03,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:51:03,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026150773] [2024-06-27 18:51:03,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:03,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:51:03,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:03,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:51:03,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:51:03,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:03,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 394 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2024-06-27 18:51:03,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:03,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:03,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:04,546 INFO L124 PetriNetUnfolderBase]: 516/913 cut-off events. [2024-06-27 18:51:04,546 INFO L125 PetriNetUnfolderBase]: For 2499/2502 co-relation queries the response was YES. [2024-06-27 18:51:04,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3303 conditions, 913 events. 516/913 cut-off events. For 2499/2502 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4413 event pairs, 92 based on Foata normal form. 4/914 useless extension candidates. Maximal degree in co-relation 3271. Up to 643 conditions per place. [2024-06-27 18:51:04,551 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 66 selfloop transitions, 20 changer transitions 0/91 dead transitions. [2024-06-27 18:51:04,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 668 flow [2024-06-27 18:51:04,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:51:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:51:04,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-27 18:51:04,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190476190476191 [2024-06-27 18:51:04,553 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 394 flow. Second operand 6 states and 109 transitions. [2024-06-27 18:51:04,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 668 flow [2024-06-27 18:51:04,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 91 transitions, 630 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-27 18:51:04,557 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 453 flow [2024-06-27 18:51:04,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=453, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2024-06-27 18:51:04,558 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2024-06-27 18:51:04,558 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 453 flow [2024-06-27 18:51:04,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2024-06-27 18:51:04,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:04,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:04,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 18:51:04,559 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:04,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:04,559 INFO L85 PathProgramCache]: Analyzing trace with hash -898027457, now seen corresponding path program 1 times [2024-06-27 18:51:04,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:04,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972722133] [2024-06-27 18:51:04,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:04,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:06,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:06,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:06,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972722133] [2024-06-27 18:51:06,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972722133] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:06,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:06,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:06,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384159018] [2024-06-27 18:51:06,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:06,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:06,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:06,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:06,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:06,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:06,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 453 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:06,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:06,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:06,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:07,216 INFO L124 PetriNetUnfolderBase]: 513/945 cut-off events. [2024-06-27 18:51:07,216 INFO L125 PetriNetUnfolderBase]: For 2677/2677 co-relation queries the response was YES. [2024-06-27 18:51:07,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3517 conditions, 945 events. 513/945 cut-off events. For 2677/2677 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4651 event pairs, 114 based on Foata normal form. 2/945 useless extension candidates. Maximal degree in co-relation 3483. Up to 785 conditions per place. [2024-06-27 18:51:07,229 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 73 selfloop transitions, 11 changer transitions 0/89 dead transitions. [2024-06-27 18:51:07,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 89 transitions, 689 flow [2024-06-27 18:51:07,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:51:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:51:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-27 18:51:07,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49047619047619045 [2024-06-27 18:51:07,231 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 453 flow. Second operand 6 states and 103 transitions. [2024-06-27 18:51:07,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 89 transitions, 689 flow [2024-06-27 18:51:07,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 89 transitions, 663 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-27 18:51:07,239 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 478 flow [2024-06-27 18:51:07,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=478, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2024-06-27 18:51:07,240 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2024-06-27 18:51:07,240 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 478 flow [2024-06-27 18:51:07,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:07,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:07,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:07,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 18:51:07,241 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:07,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:07,241 INFO L85 PathProgramCache]: Analyzing trace with hash 216669383, now seen corresponding path program 1 times [2024-06-27 18:51:07,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:07,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869294360] [2024-06-27 18:51:07,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:07,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:09,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:09,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869294360] [2024-06-27 18:51:09,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869294360] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:09,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:09,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:09,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626757409] [2024-06-27 18:51:09,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:09,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:09,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:09,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:09,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:09,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:09,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 478 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:09,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:09,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:09,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:10,372 INFO L124 PetriNetUnfolderBase]: 577/1041 cut-off events. [2024-06-27 18:51:10,373 INFO L125 PetriNetUnfolderBase]: For 3037/3037 co-relation queries the response was YES. [2024-06-27 18:51:10,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3879 conditions, 1041 events. 577/1041 cut-off events. For 3037/3037 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5217 event pairs, 89 based on Foata normal form. 2/1041 useless extension candidates. Maximal degree in co-relation 3843. Up to 645 conditions per place. [2024-06-27 18:51:10,378 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 96 selfloop transitions, 33 changer transitions 0/134 dead transitions. [2024-06-27 18:51:10,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 134 transitions, 964 flow [2024-06-27 18:51:10,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:51:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:51:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-27 18:51:10,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5342857142857143 [2024-06-27 18:51:10,379 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 478 flow. Second operand 10 states and 187 transitions. [2024-06-27 18:51:10,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 134 transitions, 964 flow [2024-06-27 18:51:10,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 134 transitions, 929 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 18:51:10,385 INFO L231 Difference]: Finished difference. Result has 82 places, 73 transitions, 578 flow [2024-06-27 18:51:10,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=578, PETRI_PLACES=82, PETRI_TRANSITIONS=73} [2024-06-27 18:51:10,386 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 45 predicate places. [2024-06-27 18:51:10,386 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 73 transitions, 578 flow [2024-06-27 18:51:10,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:10,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:10,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:10,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 18:51:10,387 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:10,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:10,387 INFO L85 PathProgramCache]: Analyzing trace with hash 220394033, now seen corresponding path program 2 times [2024-06-27 18:51:10,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:10,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443785053] [2024-06-27 18:51:10,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:10,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:13,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:13,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443785053] [2024-06-27 18:51:13,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443785053] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:13,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:13,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:13,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899361808] [2024-06-27 18:51:13,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:13,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:13,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:13,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:13,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:13,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:13,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 73 transitions, 578 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:13,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:13,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:13,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:14,033 INFO L124 PetriNetUnfolderBase]: 644/1146 cut-off events. [2024-06-27 18:51:14,034 INFO L125 PetriNetUnfolderBase]: For 4497/4497 co-relation queries the response was YES. [2024-06-27 18:51:14,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4692 conditions, 1146 events. 644/1146 cut-off events. For 4497/4497 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5810 event pairs, 90 based on Foata normal form. 2/1146 useless extension candidates. Maximal degree in co-relation 4654. Up to 834 conditions per place. [2024-06-27 18:51:14,041 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 111 selfloop transitions, 29 changer transitions 0/145 dead transitions. [2024-06-27 18:51:14,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 145 transitions, 1143 flow [2024-06-27 18:51:14,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:51:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:51:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2024-06-27 18:51:14,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5194805194805194 [2024-06-27 18:51:14,043 INFO L175 Difference]: Start difference. First operand has 82 places, 73 transitions, 578 flow. Second operand 11 states and 200 transitions. [2024-06-27 18:51:14,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 145 transitions, 1143 flow [2024-06-27 18:51:14,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 145 transitions, 1067 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-27 18:51:14,054 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 685 flow [2024-06-27 18:51:14,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=685, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2024-06-27 18:51:14,055 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 51 predicate places. [2024-06-27 18:51:14,055 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 685 flow [2024-06-27 18:51:14,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:14,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:14,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:14,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 18:51:14,056 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:14,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:14,056 INFO L85 PathProgramCache]: Analyzing trace with hash -26167431, now seen corresponding path program 3 times [2024-06-27 18:51:14,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:14,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665117336] [2024-06-27 18:51:14,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:14,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:16,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:16,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665117336] [2024-06-27 18:51:16,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665117336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:16,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:16,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:16,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858716151] [2024-06-27 18:51:16,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:16,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:16,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:16,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:16,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:16,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:16,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 685 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:16,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:16,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:16,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:17,693 INFO L124 PetriNetUnfolderBase]: 640/1134 cut-off events. [2024-06-27 18:51:17,693 INFO L125 PetriNetUnfolderBase]: For 4645/4645 co-relation queries the response was YES. [2024-06-27 18:51:17,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4751 conditions, 1134 events. 640/1134 cut-off events. For 4645/4645 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5713 event pairs, 89 based on Foata normal form. 2/1134 useless extension candidates. Maximal degree in co-relation 4710. Up to 831 conditions per place. [2024-06-27 18:51:17,700 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 104 selfloop transitions, 29 changer transitions 0/138 dead transitions. [2024-06-27 18:51:17,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 138 transitions, 1099 flow [2024-06-27 18:51:17,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:51:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:51:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-27 18:51:17,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5228571428571429 [2024-06-27 18:51:17,701 INFO L175 Difference]: Start difference. First operand has 88 places, 82 transitions, 685 flow. Second operand 10 states and 183 transitions. [2024-06-27 18:51:17,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 138 transitions, 1099 flow [2024-06-27 18:51:17,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 138 transitions, 1031 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-27 18:51:17,712 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 681 flow [2024-06-27 18:51:17,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=681, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2024-06-27 18:51:17,712 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 55 predicate places. [2024-06-27 18:51:17,712 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 681 flow [2024-06-27 18:51:17,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:17,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:17,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:17,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 18:51:17,713 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:17,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:17,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2069323275, now seen corresponding path program 4 times [2024-06-27 18:51:17,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:17,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483383213] [2024-06-27 18:51:17,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:17,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:19,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:19,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483383213] [2024-06-27 18:51:19,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483383213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:19,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:19,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:19,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647661844] [2024-06-27 18:51:19,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:19,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:19,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:19,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:19,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:19,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:19,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 681 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:19,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:19,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:19,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:20,468 INFO L124 PetriNetUnfolderBase]: 648/1165 cut-off events. [2024-06-27 18:51:20,468 INFO L125 PetriNetUnfolderBase]: For 5059/5062 co-relation queries the response was YES. [2024-06-27 18:51:20,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4919 conditions, 1165 events. 648/1165 cut-off events. For 5059/5062 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6010 event pairs, 91 based on Foata normal form. 4/1166 useless extension candidates. Maximal degree in co-relation 4876. Up to 628 conditions per place. [2024-06-27 18:51:20,484 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 96 selfloop transitions, 38 changer transitions 0/139 dead transitions. [2024-06-27 18:51:20,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 139 transitions, 1183 flow [2024-06-27 18:51:20,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:51:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:51:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-27 18:51:20,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-27 18:51:20,487 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 681 flow. Second operand 9 states and 168 transitions. [2024-06-27 18:51:20,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 139 transitions, 1183 flow [2024-06-27 18:51:20,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 139 transitions, 1123 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-27 18:51:20,499 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 738 flow [2024-06-27 18:51:20,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=738, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2024-06-27 18:51:20,500 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 55 predicate places. [2024-06-27 18:51:20,500 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 738 flow [2024-06-27 18:51:20,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:20,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:20,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:20,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 18:51:20,501 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:20,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:20,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2076680505, now seen corresponding path program 5 times [2024-06-27 18:51:20,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:20,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596507381] [2024-06-27 18:51:20,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:20,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:22,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:22,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596507381] [2024-06-27 18:51:22,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596507381] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:22,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:22,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:22,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623845108] [2024-06-27 18:51:22,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:22,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:22,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:22,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:22,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:22,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:22,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 738 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:22,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:22,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:22,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:23,736 INFO L124 PetriNetUnfolderBase]: 678/1220 cut-off events. [2024-06-27 18:51:23,737 INFO L125 PetriNetUnfolderBase]: For 5690/5690 co-relation queries the response was YES. [2024-06-27 18:51:23,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5349 conditions, 1220 events. 678/1220 cut-off events. For 5690/5690 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6315 event pairs, 94 based on Foata normal form. 2/1220 useless extension candidates. Maximal degree in co-relation 5305. Up to 782 conditions per place. [2024-06-27 18:51:23,743 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 99 selfloop transitions, 39 changer transitions 0/143 dead transitions. [2024-06-27 18:51:23,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 143 transitions, 1227 flow [2024-06-27 18:51:23,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:51:23,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:51:23,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-27 18:51:23,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2024-06-27 18:51:23,744 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 738 flow. Second operand 9 states and 170 transitions. [2024-06-27 18:51:23,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 143 transitions, 1227 flow [2024-06-27 18:51:23,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 143 transitions, 1175 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 18:51:23,756 INFO L231 Difference]: Finished difference. Result has 96 places, 89 transitions, 812 flow [2024-06-27 18:51:23,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=812, PETRI_PLACES=96, PETRI_TRANSITIONS=89} [2024-06-27 18:51:23,756 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 59 predicate places. [2024-06-27 18:51:23,756 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 89 transitions, 812 flow [2024-06-27 18:51:23,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:23,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:23,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:23,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 18:51:23,757 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:23,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:23,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2076674925, now seen corresponding path program 6 times [2024-06-27 18:51:23,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:23,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457064090] [2024-06-27 18:51:23,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:23,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:25,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:25,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457064090] [2024-06-27 18:51:25,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457064090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:25,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:25,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:25,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073638540] [2024-06-27 18:51:25,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:25,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:25,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:25,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:25,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:25,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:25,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 812 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:25,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:25,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:25,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:26,875 INFO L124 PetriNetUnfolderBase]: 674/1214 cut-off events. [2024-06-27 18:51:26,875 INFO L125 PetriNetUnfolderBase]: For 5856/5856 co-relation queries the response was YES. [2024-06-27 18:51:26,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5506 conditions, 1214 events. 674/1214 cut-off events. For 5856/5856 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6319 event pairs, 94 based on Foata normal form. 2/1214 useless extension candidates. Maximal degree in co-relation 5460. Up to 779 conditions per place. [2024-06-27 18:51:26,895 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 91 selfloop transitions, 39 changer transitions 0/135 dead transitions. [2024-06-27 18:51:26,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 135 transitions, 1202 flow [2024-06-27 18:51:26,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:51:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:51:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-27 18:51:26,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-27 18:51:26,897 INFO L175 Difference]: Start difference. First operand has 96 places, 89 transitions, 812 flow. Second operand 8 states and 152 transitions. [2024-06-27 18:51:26,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 135 transitions, 1202 flow [2024-06-27 18:51:26,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 135 transitions, 1092 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-27 18:51:26,934 INFO L231 Difference]: Finished difference. Result has 96 places, 89 transitions, 790 flow [2024-06-27 18:51:26,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=790, PETRI_PLACES=96, PETRI_TRANSITIONS=89} [2024-06-27 18:51:26,935 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 59 predicate places. [2024-06-27 18:51:26,935 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 89 transitions, 790 flow [2024-06-27 18:51:26,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:26,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:26,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:26,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 18:51:26,935 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:26,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:26,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1876044538, now seen corresponding path program 1 times [2024-06-27 18:51:26,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:26,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653643129] [2024-06-27 18:51:26,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:26,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:29,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:29,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653643129] [2024-06-27 18:51:29,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653643129] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:29,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:29,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:29,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456282064] [2024-06-27 18:51:29,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:29,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:29,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:29,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:29,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:29,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:29,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 790 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:29,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:29,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:29,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:30,027 INFO L124 PetriNetUnfolderBase]: 696/1252 cut-off events. [2024-06-27 18:51:30,027 INFO L125 PetriNetUnfolderBase]: For 5838/5838 co-relation queries the response was YES. [2024-06-27 18:51:30,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5588 conditions, 1252 events. 696/1252 cut-off events. For 5838/5838 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6573 event pairs, 64 based on Foata normal form. 2/1252 useless extension candidates. Maximal degree in co-relation 5542. Up to 853 conditions per place. [2024-06-27 18:51:30,034 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 109 selfloop transitions, 25 changer transitions 0/139 dead transitions. [2024-06-27 18:51:30,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 139 transitions, 1264 flow [2024-06-27 18:51:30,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:51:30,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:51:30,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-27 18:51:30,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2024-06-27 18:51:30,037 INFO L175 Difference]: Start difference. First operand has 96 places, 89 transitions, 790 flow. Second operand 8 states and 149 transitions. [2024-06-27 18:51:30,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 139 transitions, 1264 flow [2024-06-27 18:51:30,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 139 transitions, 1176 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-27 18:51:30,047 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 764 flow [2024-06-27 18:51:30,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=764, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2024-06-27 18:51:30,048 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 59 predicate places. [2024-06-27 18:51:30,048 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 764 flow [2024-06-27 18:51:30,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:30,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:30,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:30,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 18:51:30,048 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:30,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:30,049 INFO L85 PathProgramCache]: Analyzing trace with hash -929281900, now seen corresponding path program 2 times [2024-06-27 18:51:30,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:30,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353022882] [2024-06-27 18:51:30,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:30,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:32,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:32,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353022882] [2024-06-27 18:51:32,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353022882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:32,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:32,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:32,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413722043] [2024-06-27 18:51:32,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:32,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:32,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:32,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:32,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:32,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:32,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 764 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:32,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:32,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:32,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:33,515 INFO L124 PetriNetUnfolderBase]: 718/1290 cut-off events. [2024-06-27 18:51:33,516 INFO L125 PetriNetUnfolderBase]: For 5605/5605 co-relation queries the response was YES. [2024-06-27 18:51:33,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5618 conditions, 1290 events. 718/1290 cut-off events. For 5605/5605 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6837 event pairs, 108 based on Foata normal form. 2/1290 useless extension candidates. Maximal degree in co-relation 5572. Up to 996 conditions per place. [2024-06-27 18:51:33,522 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 109 selfloop transitions, 24 changer transitions 0/138 dead transitions. [2024-06-27 18:51:33,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 138 transitions, 1202 flow [2024-06-27 18:51:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:51:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:51:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-27 18:51:33,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2024-06-27 18:51:33,523 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 764 flow. Second operand 8 states and 149 transitions. [2024-06-27 18:51:33,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 138 transitions, 1202 flow [2024-06-27 18:51:33,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 138 transitions, 1154 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-27 18:51:33,534 INFO L231 Difference]: Finished difference. Result has 99 places, 91 transitions, 778 flow [2024-06-27 18:51:33,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=778, PETRI_PLACES=99, PETRI_TRANSITIONS=91} [2024-06-27 18:51:33,534 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 62 predicate places. [2024-06-27 18:51:33,535 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 778 flow [2024-06-27 18:51:33,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:33,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:33,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:33,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 18:51:33,535 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:33,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:33,536 INFO L85 PathProgramCache]: Analyzing trace with hash -811194220, now seen corresponding path program 3 times [2024-06-27 18:51:33,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:33,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362929661] [2024-06-27 18:51:33,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:33,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:35,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:35,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:35,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362929661] [2024-06-27 18:51:35,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362929661] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:35,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:35,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:35,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675844508] [2024-06-27 18:51:35,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:35,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:35,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:35,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:35,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:35,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:35,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 778 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:35,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:35,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:35,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:36,678 INFO L124 PetriNetUnfolderBase]: 740/1330 cut-off events. [2024-06-27 18:51:36,678 INFO L125 PetriNetUnfolderBase]: For 5966/5966 co-relation queries the response was YES. [2024-06-27 18:51:36,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5755 conditions, 1330 events. 740/1330 cut-off events. For 5966/5966 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7112 event pairs, 107 based on Foata normal form. 2/1330 useless extension candidates. Maximal degree in co-relation 5708. Up to 1085 conditions per place. [2024-06-27 18:51:36,685 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 110 selfloop transitions, 19 changer transitions 0/134 dead transitions. [2024-06-27 18:51:36,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 134 transitions, 1179 flow [2024-06-27 18:51:36,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:51:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:51:36,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 18:51:36,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 18:51:36,709 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 778 flow. Second operand 8 states and 144 transitions. [2024-06-27 18:51:36,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 134 transitions, 1179 flow [2024-06-27 18:51:36,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 134 transitions, 1117 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-27 18:51:36,720 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 768 flow [2024-06-27 18:51:36,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=768, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2024-06-27 18:51:36,721 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 63 predicate places. [2024-06-27 18:51:36,721 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 92 transitions, 768 flow [2024-06-27 18:51:36,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:36,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:36,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:36,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 18:51:36,722 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:36,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:36,722 INFO L85 PathProgramCache]: Analyzing trace with hash -811009522, now seen corresponding path program 1 times [2024-06-27 18:51:36,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:36,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850991605] [2024-06-27 18:51:36,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:36,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:39,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:39,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850991605] [2024-06-27 18:51:39,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850991605] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:39,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:39,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:51:39,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239675805] [2024-06-27 18:51:39,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:39,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:51:39,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:39,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:51:39,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:51:39,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:39,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 768 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:51:39,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:39,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:39,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:40,032 INFO L124 PetriNetUnfolderBase]: 762/1348 cut-off events. [2024-06-27 18:51:40,032 INFO L125 PetriNetUnfolderBase]: For 6309/6309 co-relation queries the response was YES. [2024-06-27 18:51:40,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5761 conditions, 1348 events. 762/1348 cut-off events. For 6309/6309 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7137 event pairs, 93 based on Foata normal form. 2/1348 useless extension candidates. Maximal degree in co-relation 5714. Up to 1087 conditions per place. [2024-06-27 18:51:40,040 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 116 selfloop transitions, 22 changer transitions 0/143 dead transitions. [2024-06-27 18:51:40,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 143 transitions, 1202 flow [2024-06-27 18:51:40,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:51:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:51:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-27 18:51:40,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174603174603175 [2024-06-27 18:51:40,061 INFO L175 Difference]: Start difference. First operand has 100 places, 92 transitions, 768 flow. Second operand 9 states and 163 transitions. [2024-06-27 18:51:40,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 143 transitions, 1202 flow [2024-06-27 18:51:40,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 143 transitions, 1165 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-27 18:51:40,075 INFO L231 Difference]: Finished difference. Result has 103 places, 94 transitions, 808 flow [2024-06-27 18:51:40,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=808, PETRI_PLACES=103, PETRI_TRANSITIONS=94} [2024-06-27 18:51:40,075 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 66 predicate places. [2024-06-27 18:51:40,075 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 94 transitions, 808 flow [2024-06-27 18:51:40,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:51:40,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:40,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:40,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 18:51:40,077 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:40,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:40,077 INFO L85 PathProgramCache]: Analyzing trace with hash 156233428, now seen corresponding path program 4 times [2024-06-27 18:51:40,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:40,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625512856] [2024-06-27 18:51:40,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:40,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:42,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:42,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625512856] [2024-06-27 18:51:42,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625512856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:42,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:42,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:42,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500651529] [2024-06-27 18:51:42,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:42,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:42,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:42,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:42,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:42,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:42,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 94 transitions, 808 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:42,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:42,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:42,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:43,572 INFO L124 PetriNetUnfolderBase]: 759/1365 cut-off events. [2024-06-27 18:51:43,572 INFO L125 PetriNetUnfolderBase]: For 6615/6615 co-relation queries the response was YES. [2024-06-27 18:51:43,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5840 conditions, 1365 events. 759/1365 cut-off events. For 6615/6615 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7348 event pairs, 65 based on Foata normal form. 2/1365 useless extension candidates. Maximal degree in co-relation 5792. Up to 1004 conditions per place. [2024-06-27 18:51:43,596 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 105 selfloop transitions, 24 changer transitions 0/134 dead transitions. [2024-06-27 18:51:43,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 134 transitions, 1206 flow [2024-06-27 18:51:43,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:51:43,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:51:43,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-27 18:51:43,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5387755102040817 [2024-06-27 18:51:43,605 INFO L175 Difference]: Start difference. First operand has 103 places, 94 transitions, 808 flow. Second operand 7 states and 132 transitions. [2024-06-27 18:51:43,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 134 transitions, 1206 flow [2024-06-27 18:51:43,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 134 transitions, 1145 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-27 18:51:43,618 INFO L231 Difference]: Finished difference. Result has 103 places, 94 transitions, 804 flow [2024-06-27 18:51:43,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=804, PETRI_PLACES=103, PETRI_TRANSITIONS=94} [2024-06-27 18:51:43,619 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 66 predicate places. [2024-06-27 18:51:43,619 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 94 transitions, 804 flow [2024-06-27 18:51:43,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:43,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:43,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:43,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 18:51:43,620 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:43,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:43,620 INFO L85 PathProgramCache]: Analyzing trace with hash 156418126, now seen corresponding path program 2 times [2024-06-27 18:51:43,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:43,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800965681] [2024-06-27 18:51:43,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:43,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:45,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:45,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800965681] [2024-06-27 18:51:45,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800965681] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:45,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:45,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:51:45,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594196927] [2024-06-27 18:51:45,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:45,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:51:45,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:45,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:51:45,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:51:45,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:45,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 94 transitions, 804 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:51:45,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:45,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:45,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:46,528 INFO L124 PetriNetUnfolderBase]: 781/1383 cut-off events. [2024-06-27 18:51:46,528 INFO L125 PetriNetUnfolderBase]: For 7295/7295 co-relation queries the response was YES. [2024-06-27 18:51:46,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6009 conditions, 1383 events. 781/1383 cut-off events. For 7295/7295 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7349 event pairs, 94 based on Foata normal form. 2/1383 useless extension candidates. Maximal degree in co-relation 5960. Up to 1092 conditions per place. [2024-06-27 18:51:46,536 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 103 selfloop transitions, 23 changer transitions 0/131 dead transitions. [2024-06-27 18:51:46,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 131 transitions, 1176 flow [2024-06-27 18:51:46,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:51:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:51:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-27 18:51:46,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2024-06-27 18:51:46,547 INFO L175 Difference]: Start difference. First operand has 103 places, 94 transitions, 804 flow. Second operand 7 states and 128 transitions. [2024-06-27 18:51:46,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 131 transitions, 1176 flow [2024-06-27 18:51:46,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 131 transitions, 1118 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-27 18:51:46,561 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 832 flow [2024-06-27 18:51:46,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=832, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2024-06-27 18:51:46,561 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 66 predicate places. [2024-06-27 18:51:46,562 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 832 flow [2024-06-27 18:51:46,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:51:46,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:46,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:46,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 18:51:46,562 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:46,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:46,563 INFO L85 PathProgramCache]: Analyzing trace with hash 275495774, now seen corresponding path program 3 times [2024-06-27 18:51:46,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:46,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878502368] [2024-06-27 18:51:46,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:46,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:48,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:48,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878502368] [2024-06-27 18:51:48,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878502368] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:48,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:48,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:51:48,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145929369] [2024-06-27 18:51:48,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:48,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:51:48,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:48,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:51:48,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:51:48,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:48,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 832 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:51:48,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:48,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:48,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:49,705 INFO L124 PetriNetUnfolderBase]: 803/1442 cut-off events. [2024-06-27 18:51:49,705 INFO L125 PetriNetUnfolderBase]: For 7575/7578 co-relation queries the response was YES. [2024-06-27 18:51:49,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6208 conditions, 1442 events. 803/1442 cut-off events. For 7575/7578 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7829 event pairs, 98 based on Foata normal form. 4/1443 useless extension candidates. Maximal degree in co-relation 6159. Up to 1080 conditions per place. [2024-06-27 18:51:49,714 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 105 selfloop transitions, 21 changer transitions 0/131 dead transitions. [2024-06-27 18:51:49,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 131 transitions, 1224 flow [2024-06-27 18:51:49,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:51:49,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:51:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-27 18:51:49,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 18:51:49,715 INFO L175 Difference]: Start difference. First operand has 103 places, 96 transitions, 832 flow. Second operand 7 states and 126 transitions. [2024-06-27 18:51:49,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 131 transitions, 1224 flow [2024-06-27 18:51:49,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 131 transitions, 1150 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 18:51:49,737 INFO L231 Difference]: Finished difference. Result has 105 places, 97 transitions, 822 flow [2024-06-27 18:51:49,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=822, PETRI_PLACES=105, PETRI_TRANSITIONS=97} [2024-06-27 18:51:49,738 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 68 predicate places. [2024-06-27 18:51:49,738 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 97 transitions, 822 flow [2024-06-27 18:51:49,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:51:49,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:49,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:49,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 18:51:49,738 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:49,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:49,739 INFO L85 PathProgramCache]: Analyzing trace with hash 284066654, now seen corresponding path program 4 times [2024-06-27 18:51:49,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:49,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083219538] [2024-06-27 18:51:49,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:49,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:52,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:52,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083219538] [2024-06-27 18:51:52,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083219538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:52,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:52,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:51:52,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993214526] [2024-06-27 18:51:52,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:52,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:51:52,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:52,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:51:52,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:51:52,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:52,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 97 transitions, 822 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:51:52,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:52,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:52,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:52,971 INFO L124 PetriNetUnfolderBase]: 804/1449 cut-off events. [2024-06-27 18:51:52,971 INFO L125 PetriNetUnfolderBase]: For 6857/6860 co-relation queries the response was YES. [2024-06-27 18:51:52,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6133 conditions, 1449 events. 804/1449 cut-off events. For 6857/6860 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7898 event pairs, 99 based on Foata normal form. 4/1450 useless extension candidates. Maximal degree in co-relation 6083. Up to 949 conditions per place. [2024-06-27 18:51:52,978 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 103 selfloop transitions, 25 changer transitions 0/133 dead transitions. [2024-06-27 18:51:52,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 133 transitions, 1232 flow [2024-06-27 18:51:52,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:51:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:51:52,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-27 18:51:52,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061224489795918 [2024-06-27 18:51:52,980 INFO L175 Difference]: Start difference. First operand has 105 places, 97 transitions, 822 flow. Second operand 7 states and 124 transitions. [2024-06-27 18:51:52,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 133 transitions, 1232 flow [2024-06-27 18:51:52,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 133 transitions, 1188 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-27 18:51:52,993 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 843 flow [2024-06-27 18:51:52,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=843, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2024-06-27 18:51:52,994 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 70 predicate places. [2024-06-27 18:51:52,994 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 843 flow [2024-06-27 18:51:52,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:51:52,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:52,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:52,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 18:51:52,994 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:52,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:52,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1316298151, now seen corresponding path program 1 times [2024-06-27 18:51:52,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:52,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296720223] [2024-06-27 18:51:52,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:52,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:53,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:53,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296720223] [2024-06-27 18:51:53,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296720223] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:53,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:53,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:51:53,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349210221] [2024-06-27 18:51:53,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:53,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:51:53,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:53,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:51:53,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:51:53,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 18:51:53,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 843 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:53,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:53,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 18:51:53,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:53,231 INFO L124 PetriNetUnfolderBase]: 435/865 cut-off events. [2024-06-27 18:51:53,232 INFO L125 PetriNetUnfolderBase]: For 4839/4875 co-relation queries the response was YES. [2024-06-27 18:51:53,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3388 conditions, 865 events. 435/865 cut-off events. For 4839/4875 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4658 event pairs, 87 based on Foata normal form. 66/896 useless extension candidates. Maximal degree in co-relation 3338. Up to 327 conditions per place. [2024-06-27 18:51:53,235 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 52 selfloop transitions, 22 changer transitions 1/96 dead transitions. [2024-06-27 18:51:53,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 96 transitions, 901 flow [2024-06-27 18:51:53,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:51:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:51:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-06-27 18:51:53,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2024-06-27 18:51:53,236 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 843 flow. Second operand 4 states and 86 transitions. [2024-06-27 18:51:53,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 96 transitions, 901 flow [2024-06-27 18:51:53,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 96 transitions, 766 flow, removed 18 selfloop flow, removed 14 redundant places. [2024-06-27 18:51:53,244 INFO L231 Difference]: Finished difference. Result has 98 places, 78 transitions, 629 flow [2024-06-27 18:51:53,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=629, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2024-06-27 18:51:53,244 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 61 predicate places. [2024-06-27 18:51:53,244 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 629 flow [2024-06-27 18:51:53,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:53,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:53,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:53,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 18:51:53,245 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:53,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:53,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1091847980, now seen corresponding path program 1 times [2024-06-27 18:51:53,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:53,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639336310] [2024-06-27 18:51:53,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:53,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:54,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:54,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639336310] [2024-06-27 18:51:54,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639336310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:54,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:54,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:51:54,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776144220] [2024-06-27 18:51:54,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:54,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:51:54,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:54,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:51:54,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:51:54,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:54,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 78 transitions, 629 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:51:54,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:54,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:54,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:55,833 INFO L124 PetriNetUnfolderBase]: 760/1435 cut-off events. [2024-06-27 18:51:55,833 INFO L125 PetriNetUnfolderBase]: For 8441/8441 co-relation queries the response was YES. [2024-06-27 18:51:55,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5408 conditions, 1435 events. 760/1435 cut-off events. For 8441/8441 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7761 event pairs, 253 based on Foata normal form. 8/1441 useless extension candidates. Maximal degree in co-relation 5363. Up to 720 conditions per place. [2024-06-27 18:51:55,840 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 104 selfloop transitions, 55 changer transitions 0/164 dead transitions. [2024-06-27 18:51:55,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 164 transitions, 1430 flow [2024-06-27 18:51:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 18:51:55,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 18:51:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 213 transitions. [2024-06-27 18:51:55,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46813186813186813 [2024-06-27 18:51:55,842 INFO L175 Difference]: Start difference. First operand has 98 places, 78 transitions, 629 flow. Second operand 13 states and 213 transitions. [2024-06-27 18:51:55,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 164 transitions, 1430 flow [2024-06-27 18:51:55,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 164 transitions, 1277 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-27 18:51:55,859 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 909 flow [2024-06-27 18:51:55,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=909, PETRI_PLACES=109, PETRI_TRANSITIONS=102} [2024-06-27 18:51:55,859 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 72 predicate places. [2024-06-27 18:51:55,860 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 909 flow [2024-06-27 18:51:55,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:51:55,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:55,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:55,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 18:51:55,860 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:55,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:55,861 INFO L85 PathProgramCache]: Analyzing trace with hash -253278030, now seen corresponding path program 2 times [2024-06-27 18:51:55,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:55,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840133341] [2024-06-27 18:51:55,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:55,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:58,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:58,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840133341] [2024-06-27 18:51:58,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840133341] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:58,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:58,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:51:58,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348043292] [2024-06-27 18:51:58,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:58,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:51:58,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:58,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:51:58,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:51:58,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:58,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 102 transitions, 909 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:51:58,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:58,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:58,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:59,041 INFO L124 PetriNetUnfolderBase]: 911/1710 cut-off events. [2024-06-27 18:51:59,041 INFO L125 PetriNetUnfolderBase]: For 11337/11337 co-relation queries the response was YES. [2024-06-27 18:51:59,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6563 conditions, 1710 events. 911/1710 cut-off events. For 11337/11337 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9709 event pairs, 228 based on Foata normal form. 8/1716 useless extension candidates. Maximal degree in co-relation 6516. Up to 592 conditions per place. [2024-06-27 18:51:59,050 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 97 selfloop transitions, 57 changer transitions 0/159 dead transitions. [2024-06-27 18:51:59,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 159 transitions, 1499 flow [2024-06-27 18:51:59,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:51:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:51:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2024-06-27 18:51:59,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2024-06-27 18:51:59,052 INFO L175 Difference]: Start difference. First operand has 109 places, 102 transitions, 909 flow. Second operand 11 states and 182 transitions. [2024-06-27 18:51:59,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 159 transitions, 1499 flow [2024-06-27 18:51:59,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 159 transitions, 1450 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-27 18:51:59,069 INFO L231 Difference]: Finished difference. Result has 117 places, 107 transitions, 1082 flow [2024-06-27 18:51:59,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1082, PETRI_PLACES=117, PETRI_TRANSITIONS=107} [2024-06-27 18:51:59,070 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 80 predicate places. [2024-06-27 18:51:59,070 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 107 transitions, 1082 flow [2024-06-27 18:51:59,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:51:59,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:59,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:59,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 18:51:59,071 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:59,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:59,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2137080860, now seen corresponding path program 3 times [2024-06-27 18:51:59,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:59,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547563778] [2024-06-27 18:51:59,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:59,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:01,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:01,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:01,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547563778] [2024-06-27 18:52:01,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547563778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:01,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:01,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:01,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119065421] [2024-06-27 18:52:01,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:01,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:01,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:01,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:01,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:01,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:01,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 107 transitions, 1082 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:52:01,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:01,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:01,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:02,244 INFO L124 PetriNetUnfolderBase]: 1058/1973 cut-off events. [2024-06-27 18:52:02,245 INFO L125 PetriNetUnfolderBase]: For 16445/16445 co-relation queries the response was YES. [2024-06-27 18:52:02,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7650 conditions, 1973 events. 1058/1973 cut-off events. For 16445/16445 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11665 event pairs, 489 based on Foata normal form. 20/1991 useless extension candidates. Maximal degree in co-relation 7600. Up to 1420 conditions per place. [2024-06-27 18:52:02,256 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 92 selfloop transitions, 51 changer transitions 0/148 dead transitions. [2024-06-27 18:52:02,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 148 transitions, 1535 flow [2024-06-27 18:52:02,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:52:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:52:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 170 transitions. [2024-06-27 18:52:02,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-06-27 18:52:02,258 INFO L175 Difference]: Start difference. First operand has 117 places, 107 transitions, 1082 flow. Second operand 11 states and 170 transitions. [2024-06-27 18:52:02,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 148 transitions, 1535 flow [2024-06-27 18:52:02,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 148 transitions, 1445 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-27 18:52:02,280 INFO L231 Difference]: Finished difference. Result has 122 places, 109 transitions, 1138 flow [2024-06-27 18:52:02,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1138, PETRI_PLACES=122, PETRI_TRANSITIONS=109} [2024-06-27 18:52:02,280 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 85 predicate places. [2024-06-27 18:52:02,280 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 109 transitions, 1138 flow [2024-06-27 18:52:02,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:52:02,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:02,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:02,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 18:52:02,281 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:02,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:02,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2060728296, now seen corresponding path program 4 times [2024-06-27 18:52:02,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:02,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955346398] [2024-06-27 18:52:02,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:02,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:04,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:04,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955346398] [2024-06-27 18:52:04,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955346398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:04,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:04,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:04,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640329936] [2024-06-27 18:52:04,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:04,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:04,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:04,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:04,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:04,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:04,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 109 transitions, 1138 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:52:04,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:04,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:04,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:05,790 INFO L124 PetriNetUnfolderBase]: 1148/2135 cut-off events. [2024-06-27 18:52:05,790 INFO L125 PetriNetUnfolderBase]: For 14878/14878 co-relation queries the response was YES. [2024-06-27 18:52:05,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8079 conditions, 2135 events. 1148/2135 cut-off events. For 14878/14878 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12875 event pairs, 461 based on Foata normal form. 16/2149 useless extension candidates. Maximal degree in co-relation 8027. Up to 1320 conditions per place. [2024-06-27 18:52:05,802 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 101 selfloop transitions, 56 changer transitions 0/162 dead transitions. [2024-06-27 18:52:05,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 162 transitions, 1690 flow [2024-06-27 18:52:05,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:52:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:52:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 189 transitions. [2024-06-27 18:52:05,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-27 18:52:05,803 INFO L175 Difference]: Start difference. First operand has 122 places, 109 transitions, 1138 flow. Second operand 12 states and 189 transitions. [2024-06-27 18:52:05,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 162 transitions, 1690 flow [2024-06-27 18:52:05,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 162 transitions, 1568 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-27 18:52:05,826 INFO L231 Difference]: Finished difference. Result has 126 places, 114 transitions, 1224 flow [2024-06-27 18:52:05,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1224, PETRI_PLACES=126, PETRI_TRANSITIONS=114} [2024-06-27 18:52:05,826 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 89 predicate places. [2024-06-27 18:52:05,827 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 114 transitions, 1224 flow [2024-06-27 18:52:05,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:52:05,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:05,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:05,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 18:52:05,827 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:05,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:05,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1339790990, now seen corresponding path program 5 times [2024-06-27 18:52:05,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:05,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538149740] [2024-06-27 18:52:05,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:05,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:07,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:07,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538149740] [2024-06-27 18:52:07,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538149740] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:07,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:07,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:07,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785586329] [2024-06-27 18:52:07,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:07,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:07,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:07,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:07,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:07,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:07,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 114 transitions, 1224 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:52:07,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:07,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:07,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:09,021 INFO L124 PetriNetUnfolderBase]: 1278/2364 cut-off events. [2024-06-27 18:52:09,022 INFO L125 PetriNetUnfolderBase]: For 14984/14984 co-relation queries the response was YES. [2024-06-27 18:52:09,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8906 conditions, 2364 events. 1278/2364 cut-off events. For 14984/14984 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14615 event pairs, 696 based on Foata normal form. 10/2372 useless extension candidates. Maximal degree in co-relation 8852. Up to 1942 conditions per place. [2024-06-27 18:52:09,035 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 119 selfloop transitions, 29 changer transitions 0/153 dead transitions. [2024-06-27 18:52:09,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 153 transitions, 1682 flow [2024-06-27 18:52:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:52:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:52:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 167 transitions. [2024-06-27 18:52:09,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43376623376623374 [2024-06-27 18:52:09,037 INFO L175 Difference]: Start difference. First operand has 126 places, 114 transitions, 1224 flow. Second operand 11 states and 167 transitions. [2024-06-27 18:52:09,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 153 transitions, 1682 flow [2024-06-27 18:52:09,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 153 transitions, 1594 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-27 18:52:09,063 INFO L231 Difference]: Finished difference. Result has 129 places, 116 transitions, 1240 flow [2024-06-27 18:52:09,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1240, PETRI_PLACES=129, PETRI_TRANSITIONS=116} [2024-06-27 18:52:09,063 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 92 predicate places. [2024-06-27 18:52:09,064 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 116 transitions, 1240 flow [2024-06-27 18:52:09,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:52:09,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:09,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:09,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 18:52:09,064 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:09,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:09,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1339787270, now seen corresponding path program 6 times [2024-06-27 18:52:09,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:09,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881101405] [2024-06-27 18:52:09,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:09,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:11,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:11,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881101405] [2024-06-27 18:52:11,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881101405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:11,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:11,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:11,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237411200] [2024-06-27 18:52:11,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:11,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:11,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:11,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:11,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:11,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:11,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 116 transitions, 1240 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:52:11,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:11,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:11,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:12,666 INFO L124 PetriNetUnfolderBase]: 1521/2797 cut-off events. [2024-06-27 18:52:12,666 INFO L125 PetriNetUnfolderBase]: For 19178/19178 co-relation queries the response was YES. [2024-06-27 18:52:12,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10602 conditions, 2797 events. 1521/2797 cut-off events. For 19178/19178 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 18070 event pairs, 760 based on Foata normal form. 8/2803 useless extension candidates. Maximal degree in co-relation 10546. Up to 1916 conditions per place. [2024-06-27 18:52:12,679 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 128 selfloop transitions, 32 changer transitions 0/165 dead transitions. [2024-06-27 18:52:12,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 165 transitions, 1842 flow [2024-06-27 18:52:12,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:52:12,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:52:12,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2024-06-27 18:52:12,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45194805194805193 [2024-06-27 18:52:12,681 INFO L175 Difference]: Start difference. First operand has 129 places, 116 transitions, 1240 flow. Second operand 11 states and 174 transitions. [2024-06-27 18:52:12,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 165 transitions, 1842 flow [2024-06-27 18:52:12,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 165 transitions, 1772 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-27 18:52:12,710 INFO L231 Difference]: Finished difference. Result has 132 places, 121 transitions, 1344 flow [2024-06-27 18:52:12,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1344, PETRI_PLACES=132, PETRI_TRANSITIONS=121} [2024-06-27 18:52:12,710 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 95 predicate places. [2024-06-27 18:52:12,711 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 121 transitions, 1344 flow [2024-06-27 18:52:12,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:52:12,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:12,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:12,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 18:52:12,711 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:12,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:12,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1345297520, now seen corresponding path program 7 times [2024-06-27 18:52:12,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:12,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691315269] [2024-06-27 18:52:12,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:12,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:15,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:15,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691315269] [2024-06-27 18:52:15,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691315269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:15,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:15,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:15,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260750103] [2024-06-27 18:52:15,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:15,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:15,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:15,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:15,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:15,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:15,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 121 transitions, 1344 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:52:15,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:15,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:15,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:16,356 INFO L124 PetriNetUnfolderBase]: 1508/2774 cut-off events. [2024-06-27 18:52:16,357 INFO L125 PetriNetUnfolderBase]: For 18153/18153 co-relation queries the response was YES. [2024-06-27 18:52:16,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10422 conditions, 2774 events. 1508/2774 cut-off events. For 18153/18153 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17870 event pairs, 856 based on Foata normal form. 10/2782 useless extension candidates. Maximal degree in co-relation 10364. Up to 2352 conditions per place. [2024-06-27 18:52:16,373 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 127 selfloop transitions, 29 changer transitions 0/161 dead transitions. [2024-06-27 18:52:16,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 161 transitions, 1830 flow [2024-06-27 18:52:16,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:52:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:52:16,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 178 transitions. [2024-06-27 18:52:16,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2024-06-27 18:52:16,375 INFO L175 Difference]: Start difference. First operand has 132 places, 121 transitions, 1344 flow. Second operand 12 states and 178 transitions. [2024-06-27 18:52:16,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 161 transitions, 1830 flow [2024-06-27 18:52:16,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 161 transitions, 1743 flow, removed 27 selfloop flow, removed 7 redundant places. [2024-06-27 18:52:16,407 INFO L231 Difference]: Finished difference. Result has 137 places, 123 transitions, 1371 flow [2024-06-27 18:52:16,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1273, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1371, PETRI_PLACES=137, PETRI_TRANSITIONS=123} [2024-06-27 18:52:16,408 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 100 predicate places. [2024-06-27 18:52:16,408 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 123 transitions, 1371 flow [2024-06-27 18:52:16,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:52:16,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:16,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:16,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 18:52:16,409 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:16,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:16,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1345512722, now seen corresponding path program 1 times [2024-06-27 18:52:16,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:16,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786720724] [2024-06-27 18:52:16,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:16,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:19,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:19,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:19,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786720724] [2024-06-27 18:52:19,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786720724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:19,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:19,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:52:19,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802986065] [2024-06-27 18:52:19,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:19,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:52:19,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:19,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:52:19,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:52:19,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:19,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 123 transitions, 1371 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:19,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:19,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:19,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:20,739 INFO L124 PetriNetUnfolderBase]: 1550/2864 cut-off events. [2024-06-27 18:52:20,739 INFO L125 PetriNetUnfolderBase]: For 16705/16705 co-relation queries the response was YES. [2024-06-27 18:52:20,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10607 conditions, 2864 events. 1550/2864 cut-off events. For 16705/16705 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 18662 event pairs, 839 based on Foata normal form. 6/2868 useless extension candidates. Maximal degree in co-relation 10547. Up to 2105 conditions per place. [2024-06-27 18:52:20,755 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 128 selfloop transitions, 34 changer transitions 0/167 dead transitions. [2024-06-27 18:52:20,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 167 transitions, 1859 flow [2024-06-27 18:52:20,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:52:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:52:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 183 transitions. [2024-06-27 18:52:20,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2024-06-27 18:52:20,757 INFO L175 Difference]: Start difference. First operand has 137 places, 123 transitions, 1371 flow. Second operand 12 states and 183 transitions. [2024-06-27 18:52:20,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 167 transitions, 1859 flow [2024-06-27 18:52:20,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 167 transitions, 1801 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-27 18:52:20,791 INFO L231 Difference]: Finished difference. Result has 139 places, 124 transitions, 1403 flow [2024-06-27 18:52:20,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1313, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1403, PETRI_PLACES=139, PETRI_TRANSITIONS=124} [2024-06-27 18:52:20,793 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 102 predicate places. [2024-06-27 18:52:20,793 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 124 transitions, 1403 flow [2024-06-27 18:52:20,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:20,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:20,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:20,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 18:52:20,794 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:20,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:20,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1469856646, now seen corresponding path program 8 times [2024-06-27 18:52:20,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:20,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864511647] [2024-06-27 18:52:20,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:20,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:23,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:23,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864511647] [2024-06-27 18:52:23,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864511647] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:23,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:23,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:23,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953329898] [2024-06-27 18:52:23,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:23,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:23,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:23,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:23,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:23,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:23,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 124 transitions, 1403 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:52:23,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:23,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:23,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:24,636 INFO L124 PetriNetUnfolderBase]: 1680/3083 cut-off events. [2024-06-27 18:52:24,637 INFO L125 PetriNetUnfolderBase]: For 20029/20029 co-relation queries the response was YES. [2024-06-27 18:52:24,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11465 conditions, 3083 events. 1680/3083 cut-off events. For 20029/20029 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 20364 event pairs, 909 based on Foata normal form. 10/3091 useless extension candidates. Maximal degree in co-relation 11404. Up to 2390 conditions per place. [2024-06-27 18:52:24,658 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 113 selfloop transitions, 45 changer transitions 0/163 dead transitions. [2024-06-27 18:52:24,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 163 transitions, 1887 flow [2024-06-27 18:52:24,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:52:24,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:52:24,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-27 18:52:24,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4514285714285714 [2024-06-27 18:52:24,659 INFO L175 Difference]: Start difference. First operand has 139 places, 124 transitions, 1403 flow. Second operand 10 states and 158 transitions. [2024-06-27 18:52:24,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 163 transitions, 1887 flow [2024-06-27 18:52:24,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 163 transitions, 1807 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-27 18:52:24,701 INFO L231 Difference]: Finished difference. Result has 139 places, 126 transitions, 1473 flow [2024-06-27 18:52:24,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1473, PETRI_PLACES=139, PETRI_TRANSITIONS=126} [2024-06-27 18:52:24,702 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 102 predicate places. [2024-06-27 18:52:24,702 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 126 transitions, 1473 flow [2024-06-27 18:52:24,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:52:24,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:24,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:24,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 18:52:24,703 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:24,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:24,703 INFO L85 PathProgramCache]: Analyzing trace with hash -49779916, now seen corresponding path program 9 times [2024-06-27 18:52:24,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:24,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477751758] [2024-06-27 18:52:24,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:24,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:26,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:26,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477751758] [2024-06-27 18:52:26,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477751758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:26,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:26,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:26,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252793809] [2024-06-27 18:52:26,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:26,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:26,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:26,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:26,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:26,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:26,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 126 transitions, 1473 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:52:26,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:26,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:26,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:28,057 INFO L124 PetriNetUnfolderBase]: 1732/3216 cut-off events. [2024-06-27 18:52:28,058 INFO L125 PetriNetUnfolderBase]: For 20100/20103 co-relation queries the response was YES. [2024-06-27 18:52:28,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11790 conditions, 3216 events. 1732/3216 cut-off events. For 20100/20103 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 21621 event pairs, 949 based on Foata normal form. 12/3225 useless extension candidates. Maximal degree in co-relation 11728. Up to 2719 conditions per place. [2024-06-27 18:52:28,077 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 112 selfloop transitions, 45 changer transitions 0/162 dead transitions. [2024-06-27 18:52:28,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 162 transitions, 1924 flow [2024-06-27 18:52:28,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:52:28,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:52:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions. [2024-06-27 18:52:28,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44857142857142857 [2024-06-27 18:52:28,079 INFO L175 Difference]: Start difference. First operand has 139 places, 126 transitions, 1473 flow. Second operand 10 states and 157 transitions. [2024-06-27 18:52:28,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 162 transitions, 1924 flow [2024-06-27 18:52:28,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 162 transitions, 1830 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-27 18:52:28,121 INFO L231 Difference]: Finished difference. Result has 141 places, 126 transitions, 1473 flow [2024-06-27 18:52:28,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1473, PETRI_PLACES=141, PETRI_TRANSITIONS=126} [2024-06-27 18:52:28,122 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 104 predicate places. [2024-06-27 18:52:28,122 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 126 transitions, 1473 flow [2024-06-27 18:52:28,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:52:28,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:28,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:28,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 18:52:28,122 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:28,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:28,123 INFO L85 PathProgramCache]: Analyzing trace with hash -501554988, now seen corresponding path program 10 times [2024-06-27 18:52:28,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:28,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659784564] [2024-06-27 18:52:28,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:28,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:30,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:30,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659784564] [2024-06-27 18:52:30,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659784564] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:30,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:30,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:30,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577965463] [2024-06-27 18:52:30,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:30,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:30,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:30,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:30,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:30,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:30,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 126 transitions, 1473 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:52:30,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:30,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:30,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:31,901 INFO L124 PetriNetUnfolderBase]: 1832/3391 cut-off events. [2024-06-27 18:52:31,901 INFO L125 PetriNetUnfolderBase]: For 20049/20049 co-relation queries the response was YES. [2024-06-27 18:52:31,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12335 conditions, 3391 events. 1832/3391 cut-off events. For 20049/20049 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 22884 event pairs, 681 based on Foata normal form. 8/3397 useless extension candidates. Maximal degree in co-relation 12272. Up to 1717 conditions per place. [2024-06-27 18:52:31,918 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 109 selfloop transitions, 59 changer transitions 0/173 dead transitions. [2024-06-27 18:52:31,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 173 transitions, 2069 flow [2024-06-27 18:52:31,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:52:31,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:52:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-27 18:52:31,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742857142857143 [2024-06-27 18:52:31,937 INFO L175 Difference]: Start difference. First operand has 141 places, 126 transitions, 1473 flow. Second operand 10 states and 166 transitions. [2024-06-27 18:52:31,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 173 transitions, 2069 flow [2024-06-27 18:52:31,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 173 transitions, 1981 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 18:52:31,977 INFO L231 Difference]: Finished difference. Result has 144 places, 129 transitions, 1603 flow [2024-06-27 18:52:31,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1385, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1603, PETRI_PLACES=144, PETRI_TRANSITIONS=129} [2024-06-27 18:52:31,978 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 107 predicate places. [2024-06-27 18:52:31,978 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 129 transitions, 1603 flow [2024-06-27 18:52:31,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:52:31,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:31,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:31,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 18:52:31,979 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:31,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:31,979 INFO L85 PathProgramCache]: Analyzing trace with hash 553780292, now seen corresponding path program 11 times [2024-06-27 18:52:31,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:31,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286535093] [2024-06-27 18:52:31,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:31,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:34,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:34,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286535093] [2024-06-27 18:52:34,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286535093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:34,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:34,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:34,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541470149] [2024-06-27 18:52:34,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:34,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:34,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:34,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:34,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:34,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:34,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 129 transitions, 1603 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:52:34,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:34,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:34,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:35,616 INFO L124 PetriNetUnfolderBase]: 1819/3372 cut-off events. [2024-06-27 18:52:35,617 INFO L125 PetriNetUnfolderBase]: For 19137/19137 co-relation queries the response was YES. [2024-06-27 18:52:35,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12371 conditions, 3372 events. 1819/3372 cut-off events. For 19137/19137 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 22823 event pairs, 1024 based on Foata normal form. 10/3380 useless extension candidates. Maximal degree in co-relation 12306. Up to 2651 conditions per place. [2024-06-27 18:52:35,644 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 116 selfloop transitions, 45 changer transitions 0/166 dead transitions. [2024-06-27 18:52:35,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 166 transitions, 2099 flow [2024-06-27 18:52:35,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:52:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:52:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-06-27 18:52:35,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634920634920635 [2024-06-27 18:52:35,653 INFO L175 Difference]: Start difference. First operand has 144 places, 129 transitions, 1603 flow. Second operand 9 states and 146 transitions. [2024-06-27 18:52:35,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 166 transitions, 2099 flow [2024-06-27 18:52:35,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 166 transitions, 1874 flow, removed 30 selfloop flow, removed 10 redundant places. [2024-06-27 18:52:35,703 INFO L231 Difference]: Finished difference. Result has 143 places, 131 transitions, 1538 flow [2024-06-27 18:52:35,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1538, PETRI_PLACES=143, PETRI_TRANSITIONS=131} [2024-06-27 18:52:35,705 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 106 predicate places. [2024-06-27 18:52:35,705 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 131 transitions, 1538 flow [2024-06-27 18:52:35,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-27 18:52:35,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:35,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:35,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 18:52:35,705 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:35,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:35,707 INFO L85 PathProgramCache]: Analyzing trace with hash 755084744, now seen corresponding path program 2 times [2024-06-27 18:52:35,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:35,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267542452] [2024-06-27 18:52:35,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:35,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:38,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:38,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:38,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267542452] [2024-06-27 18:52:38,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267542452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:38,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:38,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:52:38,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266791377] [2024-06-27 18:52:38,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:38,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:52:38,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:38,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:52:38,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:52:38,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:38,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 131 transitions, 1538 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:38,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:38,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:38,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:39,923 INFO L124 PetriNetUnfolderBase]: 1869/3487 cut-off events. [2024-06-27 18:52:39,923 INFO L125 PetriNetUnfolderBase]: For 15268/15271 co-relation queries the response was YES. [2024-06-27 18:52:39,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12246 conditions, 3487 events. 1869/3487 cut-off events. For 15268/15271 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 23960 event pairs, 1012 based on Foata normal form. 8/3492 useless extension candidates. Maximal degree in co-relation 12182. Up to 2835 conditions per place. [2024-06-27 18:52:39,947 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 126 selfloop transitions, 46 changer transitions 0/177 dead transitions. [2024-06-27 18:52:39,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 177 transitions, 2066 flow [2024-06-27 18:52:39,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:52:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:52:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 176 transitions. [2024-06-27 18:52:39,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-27 18:52:39,949 INFO L175 Difference]: Start difference. First operand has 143 places, 131 transitions, 1538 flow. Second operand 11 states and 176 transitions. [2024-06-27 18:52:39,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 177 transitions, 2066 flow [2024-06-27 18:52:39,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 177 transitions, 1972 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-27 18:52:39,988 INFO L231 Difference]: Finished difference. Result has 147 places, 131 transitions, 1543 flow [2024-06-27 18:52:39,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1543, PETRI_PLACES=147, PETRI_TRANSITIONS=131} [2024-06-27 18:52:39,989 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 110 predicate places. [2024-06-27 18:52:39,989 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 131 transitions, 1543 flow [2024-06-27 18:52:39,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:39,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:39,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:39,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 18:52:39,989 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:39,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:39,990 INFO L85 PathProgramCache]: Analyzing trace with hash 755344214, now seen corresponding path program 3 times [2024-06-27 18:52:39,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:39,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877827506] [2024-06-27 18:52:39,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:39,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:43,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:43,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877827506] [2024-06-27 18:52:43,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877827506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:43,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:43,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:52:43,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301190383] [2024-06-27 18:52:43,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:43,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:52:43,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:43,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:52:43,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:52:43,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:43,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 131 transitions, 1543 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:43,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:43,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:43,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:44,368 INFO L124 PetriNetUnfolderBase]: 1935/3655 cut-off events. [2024-06-27 18:52:44,369 INFO L125 PetriNetUnfolderBase]: For 15579/15582 co-relation queries the response was YES. [2024-06-27 18:52:44,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12628 conditions, 3655 events. 1935/3655 cut-off events. For 15579/15582 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 25369 event pairs, 1041 based on Foata normal form. 8/3660 useless extension candidates. Maximal degree in co-relation 12563. Up to 1594 conditions per place. [2024-06-27 18:52:44,388 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 127 selfloop transitions, 47 changer transitions 0/179 dead transitions. [2024-06-27 18:52:44,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 179 transitions, 2076 flow [2024-06-27 18:52:44,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:52:44,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:52:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-27 18:52:44,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742857142857143 [2024-06-27 18:52:44,390 INFO L175 Difference]: Start difference. First operand has 147 places, 131 transitions, 1543 flow. Second operand 10 states and 166 transitions. [2024-06-27 18:52:44,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 179 transitions, 2076 flow [2024-06-27 18:52:44,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 179 transitions, 1983 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-27 18:52:44,429 INFO L231 Difference]: Finished difference. Result has 148 places, 131 transitions, 1547 flow [2024-06-27 18:52:44,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1547, PETRI_PLACES=148, PETRI_TRANSITIONS=131} [2024-06-27 18:52:44,430 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 111 predicate places. [2024-06-27 18:52:44,430 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 131 transitions, 1547 flow [2024-06-27 18:52:44,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:44,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:44,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:44,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 18:52:44,431 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:44,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:44,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1475434228, now seen corresponding path program 4 times [2024-06-27 18:52:44,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:44,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866295657] [2024-06-27 18:52:44,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:44,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:47,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:47,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:47,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866295657] [2024-06-27 18:52:47,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866295657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:47,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:47,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:52:47,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558130263] [2024-06-27 18:52:47,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:47,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:52:47,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:47,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:52:47,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:52:47,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:47,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 131 transitions, 1547 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:47,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:47,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:47,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:48,321 INFO L124 PetriNetUnfolderBase]: 1928/3659 cut-off events. [2024-06-27 18:52:48,322 INFO L125 PetriNetUnfolderBase]: For 12950/12950 co-relation queries the response was YES. [2024-06-27 18:52:48,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12450 conditions, 3659 events. 1928/3659 cut-off events. For 12950/12950 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 25586 event pairs, 1042 based on Foata normal form. 6/3663 useless extension candidates. Maximal degree in co-relation 12384. Up to 2220 conditions per place. [2024-06-27 18:52:48,345 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 113 selfloop transitions, 53 changer transitions 0/171 dead transitions. [2024-06-27 18:52:48,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 171 transitions, 1969 flow [2024-06-27 18:52:48,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:52:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:52:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-27 18:52:48,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-27 18:52:48,347 INFO L175 Difference]: Start difference. First operand has 148 places, 131 transitions, 1547 flow. Second operand 9 states and 150 transitions. [2024-06-27 18:52:48,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 171 transitions, 1969 flow [2024-06-27 18:52:48,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 171 transitions, 1749 flow, removed 7 selfloop flow, removed 29 redundant places. [2024-06-27 18:52:48,373 INFO L231 Difference]: Finished difference. Result has 127 places, 131 transitions, 1393 flow [2024-06-27 18:52:48,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1265, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1393, PETRI_PLACES=127, PETRI_TRANSITIONS=131} [2024-06-27 18:52:48,373 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 90 predicate places. [2024-06-27 18:52:48,374 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 131 transitions, 1393 flow [2024-06-27 18:52:48,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:48,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:48,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:48,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 18:52:48,374 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:48,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:48,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2142889795, now seen corresponding path program 1 times [2024-06-27 18:52:48,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:48,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753498979] [2024-06-27 18:52:48,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:48,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:48,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:48,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753498979] [2024-06-27 18:52:48,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753498979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:48,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:48,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:52:48,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943664457] [2024-06-27 18:52:48,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:48,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:52:48,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:48,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:52:48,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:52:48,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 18:52:48,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 131 transitions, 1393 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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) [2024-06-27 18:52:48,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:48,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 18:52:48,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:48,760 INFO L124 PetriNetUnfolderBase]: 1201/2470 cut-off events. [2024-06-27 18:52:48,760 INFO L125 PetriNetUnfolderBase]: For 5584/5612 co-relation queries the response was YES. [2024-06-27 18:52:48,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7789 conditions, 2470 events. 1201/2470 cut-off events. For 5584/5612 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 17071 event pairs, 176 based on Foata normal form. 224/2643 useless extension candidates. Maximal degree in co-relation 7744. Up to 835 conditions per place. [2024-06-27 18:52:48,772 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 67 selfloop transitions, 38 changer transitions 1/127 dead transitions. [2024-06-27 18:52:48,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 127 transitions, 1472 flow [2024-06-27 18:52:48,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:52:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:52:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-06-27 18:52:48,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-27 18:52:48,773 INFO L175 Difference]: Start difference. First operand has 127 places, 131 transitions, 1393 flow. Second operand 5 states and 95 transitions. [2024-06-27 18:52:48,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 127 transitions, 1472 flow [2024-06-27 18:52:48,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 127 transitions, 1070 flow, removed 31 selfloop flow, removed 26 redundant places. [2024-06-27 18:52:48,785 INFO L231 Difference]: Finished difference. Result has 107 places, 113 transitions, 936 flow [2024-06-27 18:52:48,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=936, PETRI_PLACES=107, PETRI_TRANSITIONS=113} [2024-06-27 18:52:48,786 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 70 predicate places. [2024-06-27 18:52:48,786 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 113 transitions, 936 flow [2024-06-27 18:52:48,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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) [2024-06-27 18:52:48,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:48,786 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-06-27 18:52:48,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 18:52:48,786 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:48,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:48,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1258093087, now seen corresponding path program 1 times [2024-06-27 18:52:48,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:48,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701415605] [2024-06-27 18:52:48,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:48,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 18:52:48,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 18:52:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 18:52:48,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 18:52:48,842 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 18:52:48,843 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-06-27 18:52:48,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-06-27 18:52:48,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-06-27 18:52:48,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-06-27 18:52:48,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-06-27 18:52:48,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 18:52:48,846 INFO L445 BasicCegarLoop]: Path program histogram: [11, 6, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:48,849 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 18:52:48,850 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 18:52:48,882 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:52:48,883 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:52:48,883 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:52:48,883 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:52:48,885 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:52:48,885 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:52:48,885 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:52:48,885 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:52:48,895 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-27 18:52:48,903 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 18:52:48,903 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 18:52:48,904 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 06:52:48 BasicIcfg [2024-06-27 18:52:48,904 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 18:52:48,904 INFO L158 Benchmark]: Toolchain (without parser) took 134260.43ms. Allocated memory was 197.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 112.2MB in the beginning and 945.9MB in the end (delta: -833.6MB). Peak memory consumption was 275.2MB. Max. memory is 16.1GB. [2024-06-27 18:52:48,905 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 197.1MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 18:52:48,905 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 197.1MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 18:52:48,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 633.81ms. Allocated memory was 197.1MB in the beginning and 285.2MB in the end (delta: 88.1MB). Free memory was 112.0MB in the beginning and 226.6MB in the end (delta: -114.7MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2024-06-27 18:52:48,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.92ms. Allocated memory is still 285.2MB. Free memory was 226.6MB in the beginning and 223.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 18:52:48,905 INFO L158 Benchmark]: Boogie Preprocessor took 42.64ms. Allocated memory is still 285.2MB. Free memory was 223.5MB in the beginning and 219.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 18:52:48,906 INFO L158 Benchmark]: RCFGBuilder took 834.04ms. Allocated memory is still 285.2MB. Free memory was 219.3MB in the beginning and 113.4MB in the end (delta: 105.9MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. [2024-06-27 18:52:48,906 INFO L158 Benchmark]: TraceAbstraction took 132703.22ms. Allocated memory was 285.2MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 113.4MB in the beginning and 945.9MB in the end (delta: -832.5MB). Peak memory consumption was 186.7MB. Max. memory is 16.1GB. [2024-06-27 18:52:48,907 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 197.1MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 197.1MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 633.81ms. Allocated memory was 197.1MB in the beginning and 285.2MB in the end (delta: 88.1MB). Free memory was 112.0MB in the beginning and 226.6MB in the end (delta: -114.7MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.92ms. Allocated memory is still 285.2MB. Free memory was 226.6MB in the beginning and 223.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.64ms. Allocated memory is still 285.2MB. Free memory was 223.5MB in the beginning and 219.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 834.04ms. Allocated memory is still 285.2MB. Free memory was 219.3MB in the beginning and 113.4MB in the end (delta: 105.9MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. * TraceAbstraction took 132703.22ms. Allocated memory was 285.2MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 113.4MB in the beginning and 945.9MB in the end (delta: -832.5MB). Peak memory consumption was 186.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1921; [L814] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L814] FCALL, FORK 0 pthread_create(&t1921, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] EXPR 1 \read(y) [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L764] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L768] EXPR 1 \read(y) [L768] 1 __unbuffered_p0_EAX = y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] 1 y = y$flush_delayed ? y$mem_tmp : y [L770] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] 0 pthread_t t1922; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L816] 0 //@ assert ((((((((((((((((((((((((((((((((!multithreaded || (y$r_buff1_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p0_EAX$w_buff1 == 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (y$w_buff1_used == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$mem_tmp == 0))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || (y$w_buff1 == 0))) && (!multithreaded || ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1)))))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (y$w_buff0 == 0))) && (!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))); [L816] 0 y [L816] 0 y [L816] 0 __unbuffered_p0_EAX$read_delayed_var [L816] 0 __unbuffered_p0_EAX$read_delayed_var VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L816] FCALL, FORK 0 pthread_create(&t1922, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-1, t1922=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L816] 0 y [L816] 0 y [L816] 0 __unbuffered_p0_EAX$read_delayed_var [L816] 0 __unbuffered_p0_EAX$read_delayed_var [L817] 0 //@ assert ((((((((((((((((((((((((((((((((!multithreaded || (y$r_buff1_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p0_EAX$w_buff1 == 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (y$w_buff1_used == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$mem_tmp == 0))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || (y$w_buff1 == 0))) && (!multithreaded || ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1)))))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (y$w_buff0 == 0))) && (!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))); [L817] 0 y [L817] 0 y [L817] 0 __unbuffered_p0_EAX$read_delayed_var [L817] 0 __unbuffered_p0_EAX$read_delayed_var VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-1, t1922=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L773] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L788] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 \read(y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L817] 0 y [L817] 0 y [L817] 0 __unbuffered_p0_EAX$read_delayed_var [L817] 0 __unbuffered_p0_EAX$read_delayed_var [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-1, t1922=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 \read(y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-1, t1922=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-1, t1922=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 816]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 132.6s, OverallIterations: 44, TraceHistogramMax: 1, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 39.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2341 SdHoareTripleChecker+Valid, 12.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2265 mSDsluCounter, 699 SdHoareTripleChecker+Invalid, 11.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 558 mSDsCounter, 680 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11289 IncrementalHoareTripleChecker+Invalid, 11969 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 680 mSolverCounterUnsat, 141 mSDtfsCounter, 11289 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 434 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 41.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1603occurred in iteration=38, InterpolantAutomatonStates: 358, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 91.9s InterpolantComputationTime, 676 NumberOfCodeBlocks, 676 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 70612 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-27 18:52:48,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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