./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/rfi000_power.opt_pso.opt_rmo.opt.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/rfi000_power.opt_pso.opt_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/rfi000_power.opt_pso.opt_rmo.opt.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 22:31:39,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:31:39,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:31:39,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:31:39,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:31:39,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:31:39,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:31:39,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:31:39,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:31:39,203 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:31:39,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:31:39,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:31:39,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:31:39,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:31:39,204 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:31:39,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:31:39,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:31:39,205 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:31:39,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:31:39,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:31:39,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:31:39,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:31:39,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:31:39,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:31:39,207 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:31:39,207 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:31:39,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:31:39,208 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:31:39,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:31:39,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:31:39,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:31:39,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:31:39,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:31:39,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:31:39,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:31:39,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:31:39,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:31:39,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:31:39,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:31:39,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:31:39,210 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:31:39,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:31:39,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:31:39,211 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 22:31:39,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:31:39,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:31:39,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:31:39,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:31:39,404 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:31:39,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2024-06-27 22:31:40,419 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:31:40,594 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:31:40,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2024-06-27 22:31:40,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4c03243/c78c90d7d39240ffb7eb2babdd8e5370/FLAG49fb86950 [2024-06-27 22:31:40,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4c03243/c78c90d7d39240ffb7eb2babdd8e5370 [2024-06-27 22:31:40,634 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:31:40,635 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:31:40,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/rfi000_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-06-27 22:31:40,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:31:40,712 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:31:40,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:31:40,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:31:40,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:31:40,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:31:40" (1/2) ... [2024-06-27 22:31:40,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da447b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:31:40, skipping insertion in model container [2024-06-27 22:31:40,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:31:40" (1/2) ... [2024-06-27 22:31:40,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5c9aeb00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:31:40, skipping insertion in model container [2024-06-27 22:31:40,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:31:40" (2/2) ... [2024-06-27 22:31:40,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da447b7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:31:40, skipping insertion in model container [2024-06-27 22:31:40,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:31:40" (2/2) ... [2024-06-27 22:31:40,723 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:31:40,752 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:31:40,753 INFO L97 edCorrectnessWitness]: Location invariant before [L804-L804] ! multithreaded || ((((((((((((((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:31:40,754 INFO L97 edCorrectnessWitness]: Location invariant before [L803-L803] ! multithreaded || ((((((((((((((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:31:40,754 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:31:40,754 INFO L106 edCorrectnessWitness]: ghost_update [L801-L801] multithreaded = 1; [2024-06-27 22:31:40,792 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:31:40,943 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/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2024-06-27 22:31:41,103 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:31:41,111 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:31:41,148 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/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:31:41,226 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:31:41,254 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:31:41,254 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:31:41 WrapperNode [2024-06-27 22:31:41,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:31:41,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:31:41,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:31:41,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:31:41,263 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 10:31:41" (1/1) ... [2024-06-27 22:31:41,287 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 10:31:41" (1/1) ... [2024-06-27 22:31:41,313 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2024-06-27 22:31:41,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:31:41,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:31:41,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:31:41,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:31:41,322 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 10:31:41" (1/1) ... [2024-06-27 22:31:41,322 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 10:31:41" (1/1) ... [2024-06-27 22:31:41,325 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 10:31:41" (1/1) ... [2024-06-27 22:31:41,336 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 22:31:41,336 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 10:31:41" (1/1) ... [2024-06-27 22:31:41,337 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 10:31:41" (1/1) ... [2024-06-27 22:31:41,347 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 10:31:41" (1/1) ... [2024-06-27 22:31:41,348 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 10:31:41" (1/1) ... [2024-06-27 22:31:41,350 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 10:31:41" (1/1) ... [2024-06-27 22:31:41,351 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 10:31:41" (1/1) ... [2024-06-27 22:31:41,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:31:41,353 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:31:41,354 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:31:41,354 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:31:41,354 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 10:31:41" (1/1) ... [2024-06-27 22:31:41,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:31:41,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:31:41,403 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 22:31:41,432 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 22:31:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:31:41,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:31:41,447 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:31:41,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:31:41,447 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:31:41,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:31:41,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:31:41,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:31:41,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:31:41,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:31:41,450 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 22:31:41,563 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:31:41,565 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:31:41,791 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:31:41,792 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:31:41,918 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:31:41,918 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:31:41,918 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:31:41 BoogieIcfgContainer [2024-06-27 22:31:41,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:31:41,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:31:41,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:31:41,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:31:41,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:31:40" (1/4) ... [2024-06-27 22:31:41,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9f64aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:31:41, skipping insertion in model container [2024-06-27 22:31:41,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:31:40" (2/4) ... [2024-06-27 22:31:41,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9f64aa and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:31:41, skipping insertion in model container [2024-06-27 22:31:41,928 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 10:31:41" (3/4) ... [2024-06-27 22:31:41,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9f64aa and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:31:41, skipping insertion in model container [2024-06-27 22:31:41,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:31:41" (4/4) ... [2024-06-27 22:31:41,930 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt_pso.opt_rmo.opt.i [2024-06-27 22:31:41,943 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:31:41,943 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 22:31:41,943 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:31:41,980 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:31:42,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 82 flow [2024-06-27 22:31:42,057 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2024-06-27 22:31:42,057 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:31:42,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-06-27 22:31:42,060 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 37 transitions, 82 flow [2024-06-27 22:31:42,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 76 flow [2024-06-27 22:31:42,074 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:31:42,081 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;@2ba70ee8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:31:42,081 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 22:31:42,084 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:31:42,084 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-27 22:31:42,084 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:31:42,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:42,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:31:42,085 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:42,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:42,089 INFO L85 PathProgramCache]: Analyzing trace with hash 311271475, now seen corresponding path program 1 times [2024-06-27 22:31:42,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:42,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886194279] [2024-06-27 22:31:42,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:42,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:42,473 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 22:31:42,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:42,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886194279] [2024-06-27 22:31:42,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886194279] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:42,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:42,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:31:42,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851060525] [2024-06-27 22:31:42,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:42,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:31:42,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:42,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:31:42,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:31:42,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-06-27 22:31:42,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:42,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:42,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-06-27 22:31:42,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:42,701 INFO L124 PetriNetUnfolderBase]: 223/503 cut-off events. [2024-06-27 22:31:42,704 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 22:31:42,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 907 conditions, 503 events. 223/503 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2798 event pairs, 162 based on Foata normal form. 20/455 useless extension candidates. Maximal degree in co-relation 896. Up to 380 conditions per place. [2024-06-27 22:31:42,711 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 28 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2024-06-27 22:31:42,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 161 flow [2024-06-27 22:31:42,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:31:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:31:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-06-27 22:31:42,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7567567567567568 [2024-06-27 22:31:42,722 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 76 flow. Second operand 3 states and 84 transitions. [2024-06-27 22:31:42,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 161 flow [2024-06-27 22:31:42,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:31:42,726 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 95 flow [2024-06-27 22:31:42,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2024-06-27 22:31:42,731 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-06-27 22:31:42,732 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 95 flow [2024-06-27 22:31:42,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:42,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:42,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:42,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:31:42,733 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:42,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash 262155584, now seen corresponding path program 1 times [2024-06-27 22:31:42,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:42,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861498077] [2024-06-27 22:31:42,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:42,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:42,935 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 22:31:42,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:42,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861498077] [2024-06-27 22:31:42,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861498077] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:42,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:42,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:31:42,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733526103] [2024-06-27 22:31:42,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:42,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:31:42,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:42,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:31:42,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:31:42,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-06-27 22:31:42,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:42,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:42,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-06-27 22:31:42,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:43,065 INFO L124 PetriNetUnfolderBase]: 179/403 cut-off events. [2024-06-27 22:31:43,066 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-06-27 22:31:43,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 403 events. 179/403 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2047 event pairs, 48 based on Foata normal form. 6/381 useless extension candidates. Maximal degree in co-relation 813. Up to 249 conditions per place. [2024-06-27 22:31:43,068 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 30 selfloop transitions, 4 changer transitions 3/51 dead transitions. [2024-06-27 22:31:43,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 197 flow [2024-06-27 22:31:43,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:31:43,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:31:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-06-27 22:31:43,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7027027027027027 [2024-06-27 22:31:43,072 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 95 flow. Second operand 4 states and 104 transitions. [2024-06-27 22:31:43,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 197 flow [2024-06-27 22:31:43,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:31:43,073 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 94 flow [2024-06-27 22:31:43,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-06-27 22:31:43,074 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2024-06-27 22:31:43,074 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 94 flow [2024-06-27 22:31:43,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:43,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:43,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:43,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:31:43,075 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:43,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:43,075 INFO L85 PathProgramCache]: Analyzing trace with hash -273098082, now seen corresponding path program 1 times [2024-06-27 22:31:43,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:43,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949726736] [2024-06-27 22:31:43,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:43,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:43,371 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 22:31:43,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:43,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949726736] [2024-06-27 22:31:43,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949726736] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:43,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:43,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:31:43,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896001723] [2024-06-27 22:31:43,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:43,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:31:43,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:43,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:31:43,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:31:43,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-06-27 22:31:43,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 22:31:43,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:43,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-06-27 22:31:43,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:43,466 INFO L124 PetriNetUnfolderBase]: 153/381 cut-off events. [2024-06-27 22:31:43,467 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2024-06-27 22:31:43,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 381 events. 153/381 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2030 event pairs, 85 based on Foata normal form. 1/349 useless extension candidates. Maximal degree in co-relation 783. Up to 262 conditions per place. [2024-06-27 22:31:43,469 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 25 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2024-06-27 22:31:43,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 197 flow [2024-06-27 22:31:43,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:31:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:31:43,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-06-27 22:31:43,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6418918918918919 [2024-06-27 22:31:43,474 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 94 flow. Second operand 4 states and 95 transitions. [2024-06-27 22:31:43,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 197 flow [2024-06-27 22:31:43,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 186 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 22:31:43,476 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 140 flow [2024-06-27 22:31:43,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2024-06-27 22:31:43,477 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2024-06-27 22:31:43,478 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 140 flow [2024-06-27 22:31:43,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 22:31:43,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:43,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:43,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:31:43,479 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:43,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:43,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1300380557, now seen corresponding path program 1 times [2024-06-27 22:31:43,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:43,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200041388] [2024-06-27 22:31:43,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:43,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:43,685 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 22:31:43,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:43,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200041388] [2024-06-27 22:31:43,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200041388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:43,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:43,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:31:43,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001131734] [2024-06-27 22:31:43,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:43,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:31:43,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:43,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:31:43,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:31:43,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-06-27 22:31:43,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:43,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:43,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-06-27 22:31:43,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:43,819 INFO L124 PetriNetUnfolderBase]: 169/403 cut-off events. [2024-06-27 22:31:43,819 INFO L125 PetriNetUnfolderBase]: For 210/221 co-relation queries the response was YES. [2024-06-27 22:31:43,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 403 events. 169/403 cut-off events. For 210/221 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2130 event pairs, 45 based on Foata normal form. 1/372 useless extension candidates. Maximal degree in co-relation 904. Up to 224 conditions per place. [2024-06-27 22:31:43,821 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 35 selfloop transitions, 14 changer transitions 0/63 dead transitions. [2024-06-27 22:31:43,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 298 flow [2024-06-27 22:31:43,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:31:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:31:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-06-27 22:31:43,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6648648648648648 [2024-06-27 22:31:43,823 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 140 flow. Second operand 5 states and 123 transitions. [2024-06-27 22:31:43,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 298 flow [2024-06-27 22:31:43,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 296 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-27 22:31:43,824 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 217 flow [2024-06-27 22:31:43,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2024-06-27 22:31:43,825 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2024-06-27 22:31:43,825 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 217 flow [2024-06-27 22:31:43,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:43,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:43,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:43,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:31:43,826 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:43,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:43,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1195798985, now seen corresponding path program 2 times [2024-06-27 22:31:43,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:43,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456435773] [2024-06-27 22:31:43,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:43,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:43,984 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 22:31:43,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:43,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456435773] [2024-06-27 22:31:43,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456435773] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:43,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:43,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:31:43,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926491013] [2024-06-27 22:31:43,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:43,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:31:43,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:43,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:31:43,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:31:43,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-06-27 22:31:43,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 217 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:43,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:43,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-06-27 22:31:43,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:44,094 INFO L124 PetriNetUnfolderBase]: 201/511 cut-off events. [2024-06-27 22:31:44,094 INFO L125 PetriNetUnfolderBase]: For 683/758 co-relation queries the response was YES. [2024-06-27 22:31:44,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 511 events. 201/511 cut-off events. For 683/758 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3047 event pairs, 29 based on Foata normal form. 14/496 useless extension candidates. Maximal degree in co-relation 1376. Up to 229 conditions per place. [2024-06-27 22:31:44,097 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 36 selfloop transitions, 21 changer transitions 0/71 dead transitions. [2024-06-27 22:31:44,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 71 transitions, 441 flow [2024-06-27 22:31:44,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:31:44,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:31:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-06-27 22:31:44,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6648648648648648 [2024-06-27 22:31:44,098 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 217 flow. Second operand 5 states and 123 transitions. [2024-06-27 22:31:44,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 71 transitions, 441 flow [2024-06-27 22:31:44,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 71 transitions, 427 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 22:31:44,101 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 343 flow [2024-06-27 22:31:44,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=343, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2024-06-27 22:31:44,101 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2024-06-27 22:31:44,102 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 56 transitions, 343 flow [2024-06-27 22:31:44,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:44,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:44,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:44,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:31:44,102 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:44,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:44,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1457029518, now seen corresponding path program 1 times [2024-06-27 22:31:44,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:44,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728060413] [2024-06-27 22:31:44,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:44,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:44,394 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 22:31:44,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:44,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728060413] [2024-06-27 22:31:44,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728060413] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:44,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:44,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:31:44,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782848343] [2024-06-27 22:31:44,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:44,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:31:44,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:44,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:31:44,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:31:44,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-06-27 22:31:44,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 343 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 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 22:31:44,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:44,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-06-27 22:31:44,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:44,617 INFO L124 PetriNetUnfolderBase]: 264/653 cut-off events. [2024-06-27 22:31:44,618 INFO L125 PetriNetUnfolderBase]: For 1628/1767 co-relation queries the response was YES. [2024-06-27 22:31:44,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2081 conditions, 653 events. 264/653 cut-off events. For 1628/1767 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4071 event pairs, 30 based on Foata normal form. 22/645 useless extension candidates. Maximal degree in co-relation 2057. Up to 327 conditions per place. [2024-06-27 22:31:44,621 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 56 selfloop transitions, 24 changer transitions 0/92 dead transitions. [2024-06-27 22:31:44,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 654 flow [2024-06-27 22:31:44,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:31:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:31:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2024-06-27 22:31:44,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2024-06-27 22:31:44,623 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 343 flow. Second operand 7 states and 161 transitions. [2024-06-27 22:31:44,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 654 flow [2024-06-27 22:31:44,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 92 transitions, 621 flow, removed 13 selfloop flow, removed 1 redundant places. [2024-06-27 22:31:44,631 INFO L231 Difference]: Finished difference. Result has 64 places, 65 transitions, 457 flow [2024-06-27 22:31:44,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=457, PETRI_PLACES=64, PETRI_TRANSITIONS=65} [2024-06-27 22:31:44,633 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2024-06-27 22:31:44,633 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 457 flow [2024-06-27 22:31:44,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 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 22:31:44,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:44,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:44,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:31:44,634 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:44,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:44,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1539133532, now seen corresponding path program 2 times [2024-06-27 22:31:44,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:44,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529479701] [2024-06-27 22:31:44,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:44,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:44,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 22:31:44,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:44,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529479701] [2024-06-27 22:31:44,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529479701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:44,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:44,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:31:44,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70123748] [2024-06-27 22:31:44,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:44,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:31:44,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:44,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:31:44,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:31:44,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-06-27 22:31:44,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 457 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:44,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:44,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-06-27 22:31:44,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:44,995 INFO L124 PetriNetUnfolderBase]: 301/759 cut-off events. [2024-06-27 22:31:44,995 INFO L125 PetriNetUnfolderBase]: For 2331/2484 co-relation queries the response was YES. [2024-06-27 22:31:44,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2604 conditions, 759 events. 301/759 cut-off events. For 2331/2484 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5013 event pairs, 21 based on Foata normal form. 34/763 useless extension candidates. Maximal degree in co-relation 2574. Up to 347 conditions per place. [2024-06-27 22:31:45,000 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 49 selfloop transitions, 35 changer transitions 0/96 dead transitions. [2024-06-27 22:31:45,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 96 transitions, 821 flow [2024-06-27 22:31:45,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:31:45,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:31:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-06-27 22:31:45,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6594594594594595 [2024-06-27 22:31:45,002 INFO L175 Difference]: Start difference. First operand has 64 places, 65 transitions, 457 flow. Second operand 5 states and 122 transitions. [2024-06-27 22:31:45,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 96 transitions, 821 flow [2024-06-27 22:31:45,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 96 transitions, 759 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-27 22:31:45,010 INFO L231 Difference]: Finished difference. Result has 68 places, 77 transitions, 664 flow [2024-06-27 22:31:45,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=664, PETRI_PLACES=68, PETRI_TRANSITIONS=77} [2024-06-27 22:31:45,012 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2024-06-27 22:31:45,012 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 77 transitions, 664 flow [2024-06-27 22:31:45,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:45,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:45,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:45,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:31:45,013 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:45,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:45,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1357073642, now seen corresponding path program 3 times [2024-06-27 22:31:45,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:45,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90730653] [2024-06-27 22:31:45,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:45,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:45,236 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 22:31:45,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:45,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90730653] [2024-06-27 22:31:45,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90730653] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:45,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:45,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:31:45,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469416742] [2024-06-27 22:31:45,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:45,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:31:45,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:45,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:31:45,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:31:45,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-06-27 22:31:45,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 77 transitions, 664 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 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 22:31:45,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:45,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-06-27 22:31:45,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:45,400 INFO L124 PetriNetUnfolderBase]: 290/767 cut-off events. [2024-06-27 22:31:45,401 INFO L125 PetriNetUnfolderBase]: For 2937/3130 co-relation queries the response was YES. [2024-06-27 22:31:45,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2785 conditions, 767 events. 290/767 cut-off events. For 2937/3130 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5103 event pairs, 33 based on Foata normal form. 41/779 useless extension candidates. Maximal degree in co-relation 2751. Up to 302 conditions per place. [2024-06-27 22:31:45,405 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 49 selfloop transitions, 34 changer transitions 0/99 dead transitions. [2024-06-27 22:31:45,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 99 transitions, 944 flow [2024-06-27 22:31:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:31:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:31:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-06-27 22:31:45,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2024-06-27 22:31:45,406 INFO L175 Difference]: Start difference. First operand has 68 places, 77 transitions, 664 flow. Second operand 5 states and 125 transitions. [2024-06-27 22:31:45,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 99 transitions, 944 flow [2024-06-27 22:31:45,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 99 transitions, 912 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-06-27 22:31:45,413 INFO L231 Difference]: Finished difference. Result has 73 places, 82 transitions, 804 flow [2024-06-27 22:31:45,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=804, PETRI_PLACES=73, PETRI_TRANSITIONS=82} [2024-06-27 22:31:45,414 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2024-06-27 22:31:45,414 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 82 transitions, 804 flow [2024-06-27 22:31:45,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 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 22:31:45,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:45,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:45,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:31:45,415 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:45,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:45,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1356864202, now seen corresponding path program 4 times [2024-06-27 22:31:45,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:45,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336112266] [2024-06-27 22:31:45,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:45,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:45,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 22:31:45,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:45,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336112266] [2024-06-27 22:31:45,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336112266] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:45,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:45,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:31:45,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990833107] [2024-06-27 22:31:45,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:45,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:31:45,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:45,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:31:45,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:31:45,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-06-27 22:31:45,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 82 transitions, 804 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 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 22:31:45,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:45,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-06-27 22:31:45,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:45,855 INFO L124 PetriNetUnfolderBase]: 308/812 cut-off events. [2024-06-27 22:31:45,855 INFO L125 PetriNetUnfolderBase]: For 4508/4732 co-relation queries the response was YES. [2024-06-27 22:31:45,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3151 conditions, 812 events. 308/812 cut-off events. For 4508/4732 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5524 event pairs, 44 based on Foata normal form. 44/817 useless extension candidates. Maximal degree in co-relation 3114. Up to 375 conditions per place. [2024-06-27 22:31:45,861 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 62 selfloop transitions, 26 changer transitions 0/104 dead transitions. [2024-06-27 22:31:45,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 104 transitions, 1111 flow [2024-06-27 22:31:45,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:31:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:31:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-06-27 22:31:45,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6702702702702703 [2024-06-27 22:31:45,862 INFO L175 Difference]: Start difference. First operand has 73 places, 82 transitions, 804 flow. Second operand 5 states and 124 transitions. [2024-06-27 22:31:45,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 104 transitions, 1111 flow [2024-06-27 22:31:45,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 104 transitions, 1059 flow, removed 17 selfloop flow, removed 1 redundant places. [2024-06-27 22:31:45,875 INFO L231 Difference]: Finished difference. Result has 78 places, 88 transitions, 911 flow [2024-06-27 22:31:45,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=911, PETRI_PLACES=78, PETRI_TRANSITIONS=88} [2024-06-27 22:31:45,876 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places. [2024-06-27 22:31:45,876 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 88 transitions, 911 flow [2024-06-27 22:31:45,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 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 22:31:45,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:45,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:45,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:31:45,877 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:45,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash -217845106, now seen corresponding path program 5 times [2024-06-27 22:31:45,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:45,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144689073] [2024-06-27 22:31:45,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:45,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:46,190 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 22:31:46,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:46,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144689073] [2024-06-27 22:31:46,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144689073] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:46,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:46,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:31:46,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522472271] [2024-06-27 22:31:46,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:46,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:31:46,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:46,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:31:46,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:31:46,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-06-27 22:31:46,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 88 transitions, 911 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 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 22:31:46,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:46,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-06-27 22:31:46,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:46,349 INFO L124 PetriNetUnfolderBase]: 318/815 cut-off events. [2024-06-27 22:31:46,349 INFO L125 PetriNetUnfolderBase]: For 5511/5645 co-relation queries the response was YES. [2024-06-27 22:31:46,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3346 conditions, 815 events. 318/815 cut-off events. For 5511/5645 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5353 event pairs, 53 based on Foata normal form. 37/805 useless extension candidates. Maximal degree in co-relation 3306. Up to 274 conditions per place. [2024-06-27 22:31:46,355 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 49 selfloop transitions, 42 changer transitions 0/107 dead transitions. [2024-06-27 22:31:46,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 107 transitions, 1211 flow [2024-06-27 22:31:46,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:31:46,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:31:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-06-27 22:31:46,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6648648648648648 [2024-06-27 22:31:46,356 INFO L175 Difference]: Start difference. First operand has 78 places, 88 transitions, 911 flow. Second operand 5 states and 123 transitions. [2024-06-27 22:31:46,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 107 transitions, 1211 flow [2024-06-27 22:31:46,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 107 transitions, 1168 flow, removed 14 selfloop flow, removed 1 redundant places. [2024-06-27 22:31:46,364 INFO L231 Difference]: Finished difference. Result has 83 places, 93 transitions, 1073 flow [2024-06-27 22:31:46,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1073, PETRI_PLACES=83, PETRI_TRANSITIONS=93} [2024-06-27 22:31:46,365 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places. [2024-06-27 22:31:46,365 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 93 transitions, 1073 flow [2024-06-27 22:31:46,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 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 22:31:46,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:46,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:46,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:31:46,365 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:46,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:46,366 INFO L85 PathProgramCache]: Analyzing trace with hash -209256370, now seen corresponding path program 1 times [2024-06-27 22:31:46,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:46,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241069814] [2024-06-27 22:31:46,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:46,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:46,686 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 22:31:46,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:46,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241069814] [2024-06-27 22:31:46,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241069814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:46,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:46,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:31:46,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034679872] [2024-06-27 22:31:46,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:46,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:31:46,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:46,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:31:46,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:31:46,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-06-27 22:31:46,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 93 transitions, 1073 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:46,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:46,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-06-27 22:31:46,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:46,877 INFO L124 PetriNetUnfolderBase]: 358/950 cut-off events. [2024-06-27 22:31:46,877 INFO L125 PetriNetUnfolderBase]: For 7941/8285 co-relation queries the response was YES. [2024-06-27 22:31:46,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4000 conditions, 950 events. 358/950 cut-off events. For 7941/8285 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6663 event pairs, 70 based on Foata normal form. 118/1019 useless extension candidates. Maximal degree in co-relation 3956. Up to 245 conditions per place. [2024-06-27 22:31:46,884 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 59 selfloop transitions, 38 changer transitions 0/112 dead transitions. [2024-06-27 22:31:46,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 112 transitions, 1383 flow [2024-06-27 22:31:46,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:31:46,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:31:46,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2024-06-27 22:31:46,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081 [2024-06-27 22:31:46,887 INFO L175 Difference]: Start difference. First operand has 83 places, 93 transitions, 1073 flow. Second operand 6 states and 135 transitions. [2024-06-27 22:31:46,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 112 transitions, 1383 flow [2024-06-27 22:31:46,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 112 transitions, 1332 flow, removed 20 selfloop flow, removed 1 redundant places. [2024-06-27 22:31:46,899 INFO L231 Difference]: Finished difference. Result has 88 places, 94 transitions, 1121 flow [2024-06-27 22:31:46,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1121, PETRI_PLACES=88, PETRI_TRANSITIONS=94} [2024-06-27 22:31:46,900 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places. [2024-06-27 22:31:46,900 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 94 transitions, 1121 flow [2024-06-27 22:31:46,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:46,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:46,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:46,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:31:46,901 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:46,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:46,901 INFO L85 PathProgramCache]: Analyzing trace with hash 692270958, now seen corresponding path program 1 times [2024-06-27 22:31:46,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:46,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776162673] [2024-06-27 22:31:46,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:46,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:46,981 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 22:31:46,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:46,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776162673] [2024-06-27 22:31:46,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776162673] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:46,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:46,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:31:46,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910811209] [2024-06-27 22:31:46,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:46,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:31:46,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:46,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:31:46,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:31:46,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-06-27 22:31:46,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 94 transitions, 1121 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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 22:31:46,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:46,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-06-27 22:31:46,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:47,213 INFO L124 PetriNetUnfolderBase]: 1005/2090 cut-off events. [2024-06-27 22:31:47,214 INFO L125 PetriNetUnfolderBase]: For 15044/15190 co-relation queries the response was YES. [2024-06-27 22:31:47,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8235 conditions, 2090 events. 1005/2090 cut-off events. For 15044/15190 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 14314 event pairs, 249 based on Foata normal form. 114/2088 useless extension candidates. Maximal degree in co-relation 8189. Up to 1166 conditions per place. [2024-06-27 22:31:47,227 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 105 selfloop transitions, 4 changer transitions 1/129 dead transitions. [2024-06-27 22:31:47,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 129 transitions, 1760 flow [2024-06-27 22:31:47,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:31:47,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:31:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-06-27 22:31:47,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6418918918918919 [2024-06-27 22:31:47,229 INFO L175 Difference]: Start difference. First operand has 88 places, 94 transitions, 1121 flow. Second operand 4 states and 95 transitions. [2024-06-27 22:31:47,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 129 transitions, 1760 flow [2024-06-27 22:31:47,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 129 transitions, 1664 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 22:31:47,257 INFO L231 Difference]: Finished difference. Result has 89 places, 96 transitions, 1078 flow [2024-06-27 22:31:47,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1078, PETRI_PLACES=89, PETRI_TRANSITIONS=96} [2024-06-27 22:31:47,258 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 48 predicate places. [2024-06-27 22:31:47,258 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 96 transitions, 1078 flow [2024-06-27 22:31:47,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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 22:31:47,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:47,259 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 22:31:47,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:31:47,259 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:47,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:47,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1699159925, now seen corresponding path program 1 times [2024-06-27 22:31:47,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:47,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655012555] [2024-06-27 22:31:47,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:47,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:47,656 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 22:31:47,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:47,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655012555] [2024-06-27 22:31:47,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655012555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:47,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:47,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:31:47,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888741845] [2024-06-27 22:31:47,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:47,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:31:47,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:47,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:31:47,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:31:47,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-06-27 22:31:47,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 96 transitions, 1078 flow. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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 22:31:47,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:47,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-06-27 22:31:47,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:47,918 INFO L124 PetriNetUnfolderBase]: 442/1172 cut-off events. [2024-06-27 22:31:47,918 INFO L125 PetriNetUnfolderBase]: For 8884/9332 co-relation queries the response was YES. [2024-06-27 22:31:47,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4973 conditions, 1172 events. 442/1172 cut-off events. For 8884/9332 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8638 event pairs, 106 based on Foata normal form. 144/1244 useless extension candidates. Maximal degree in co-relation 4925. Up to 263 conditions per place. [2024-06-27 22:31:47,928 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 64 selfloop transitions, 41 changer transitions 0/122 dead transitions. [2024-06-27 22:31:47,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 122 transitions, 1494 flow [2024-06-27 22:31:47,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:31:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:31:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2024-06-27 22:31:47,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.61003861003861 [2024-06-27 22:31:47,929 INFO L175 Difference]: Start difference. First operand has 89 places, 96 transitions, 1078 flow. Second operand 7 states and 158 transitions. [2024-06-27 22:31:47,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 122 transitions, 1494 flow [2024-06-27 22:31:47,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 122 transitions, 1479 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-27 22:31:47,944 INFO L231 Difference]: Finished difference. Result has 94 places, 99 transitions, 1217 flow [2024-06-27 22:31:47,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1217, PETRI_PLACES=94, PETRI_TRANSITIONS=99} [2024-06-27 22:31:47,945 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places. [2024-06-27 22:31:47,945 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 99 transitions, 1217 flow [2024-06-27 22:31:47,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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 22:31:47,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:47,946 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 22:31:47,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:31:47,946 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:47,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:47,946 INFO L85 PathProgramCache]: Analyzing trace with hash 127414959, now seen corresponding path program 1 times [2024-06-27 22:31:47,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:47,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729054332] [2024-06-27 22:31:47,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:47,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:48,006 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 22:31:48,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:48,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729054332] [2024-06-27 22:31:48,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729054332] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:48,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:48,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:31:48,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477108863] [2024-06-27 22:31:48,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:48,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:31:48,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:48,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:31:48,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:31:48,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-06-27 22:31:48,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 99 transitions, 1217 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:48,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:48,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-06-27 22:31:48,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:48,216 INFO L124 PetriNetUnfolderBase]: 562/1271 cut-off events. [2024-06-27 22:31:48,217 INFO L125 PetriNetUnfolderBase]: For 11134/11447 co-relation queries the response was YES. [2024-06-27 22:31:48,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5384 conditions, 1271 events. 562/1271 cut-off events. For 11134/11447 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8089 event pairs, 99 based on Foata normal form. 138/1317 useless extension candidates. Maximal degree in co-relation 5335. Up to 532 conditions per place. [2024-06-27 22:31:48,227 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 85 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2024-06-27 22:31:48,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 109 transitions, 1511 flow [2024-06-27 22:31:48,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:31:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:31:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-06-27 22:31:48,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6824324324324325 [2024-06-27 22:31:48,228 INFO L175 Difference]: Start difference. First operand has 94 places, 99 transitions, 1217 flow. Second operand 4 states and 101 transitions. [2024-06-27 22:31:48,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 109 transitions, 1511 flow [2024-06-27 22:31:48,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 109 transitions, 1264 flow, removed 39 selfloop flow, removed 11 redundant places. [2024-06-27 22:31:48,243 INFO L231 Difference]: Finished difference. Result has 88 places, 77 transitions, 754 flow [2024-06-27 22:31:48,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=754, PETRI_PLACES=88, PETRI_TRANSITIONS=77} [2024-06-27 22:31:48,243 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places. [2024-06-27 22:31:48,244 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 77 transitions, 754 flow [2024-06-27 22:31:48,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:48,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:48,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:48,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:31:48,244 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:48,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:48,245 INFO L85 PathProgramCache]: Analyzing trace with hash 636377332, now seen corresponding path program 1 times [2024-06-27 22:31:48,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:48,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637604180] [2024-06-27 22:31:48,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:48,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:48,679 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 22:31:48,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:48,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637604180] [2024-06-27 22:31:48,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637604180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:48,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:48,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:31:48,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431576279] [2024-06-27 22:31:48,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:48,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:31:48,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:48,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:31:48,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:31:48,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-06-27 22:31:48,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 77 transitions, 754 flow. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 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 22:31:48,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:48,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-06-27 22:31:48,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:48,890 INFO L124 PetriNetUnfolderBase]: 410/1140 cut-off events. [2024-06-27 22:31:48,890 INFO L125 PetriNetUnfolderBase]: For 6445/6597 co-relation queries the response was YES. [2024-06-27 22:31:48,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4342 conditions, 1140 events. 410/1140 cut-off events. For 6445/6597 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8334 event pairs, 147 based on Foata normal form. 24/1061 useless extension candidates. Maximal degree in co-relation 4296. Up to 456 conditions per place. [2024-06-27 22:31:48,898 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 59 selfloop transitions, 16 changer transitions 0/96 dead transitions. [2024-06-27 22:31:48,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 96 transitions, 1020 flow [2024-06-27 22:31:48,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:31:48,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:31:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-06-27 22:31:48,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6351351351351351 [2024-06-27 22:31:48,899 INFO L175 Difference]: Start difference. First operand has 88 places, 77 transitions, 754 flow. Second operand 6 states and 141 transitions. [2024-06-27 22:31:48,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 96 transitions, 1020 flow [2024-06-27 22:31:48,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 96 transitions, 1014 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:31:48,910 INFO L231 Difference]: Finished difference. Result has 92 places, 77 transitions, 784 flow [2024-06-27 22:31:48,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=784, PETRI_PLACES=92, PETRI_TRANSITIONS=77} [2024-06-27 22:31:48,911 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 51 predicate places. [2024-06-27 22:31:48,911 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 77 transitions, 784 flow [2024-06-27 22:31:48,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 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 22:31:48,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:48,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:48,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:31:48,912 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:48,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:48,912 INFO L85 PathProgramCache]: Analyzing trace with hash 876878204, now seen corresponding path program 2 times [2024-06-27 22:31:48,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:48,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980982002] [2024-06-27 22:31:48,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:48,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:49,336 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 22:31:49,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:49,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980982002] [2024-06-27 22:31:49,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980982002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:49,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:49,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:31:49,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845913187] [2024-06-27 22:31:49,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:49,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:31:49,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:49,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:31:49,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:31:49,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-06-27 22:31:49,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 77 transitions, 784 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 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 22:31:49,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:49,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-06-27 22:31:49,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:49,568 INFO L124 PetriNetUnfolderBase]: 454/1257 cut-off events. [2024-06-27 22:31:49,569 INFO L125 PetriNetUnfolderBase]: For 7558/7722 co-relation queries the response was YES. [2024-06-27 22:31:49,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4789 conditions, 1257 events. 454/1257 cut-off events. For 7558/7722 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9378 event pairs, 138 based on Foata normal form. 29/1172 useless extension candidates. Maximal degree in co-relation 4741. Up to 437 conditions per place. [2024-06-27 22:31:49,580 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 46 selfloop transitions, 28 changer transitions 0/94 dead transitions. [2024-06-27 22:31:49,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 94 transitions, 1042 flow [2024-06-27 22:31:49,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:31:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:31:49,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-06-27 22:31:49,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6036036036036037 [2024-06-27 22:31:49,581 INFO L175 Difference]: Start difference. First operand has 92 places, 77 transitions, 784 flow. Second operand 6 states and 134 transitions. [2024-06-27 22:31:49,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 94 transitions, 1042 flow [2024-06-27 22:31:49,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 1012 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 22:31:49,594 INFO L231 Difference]: Finished difference. Result has 94 places, 77 transitions, 823 flow [2024-06-27 22:31:49,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=823, PETRI_PLACES=94, PETRI_TRANSITIONS=77} [2024-06-27 22:31:49,594 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places. [2024-06-27 22:31:49,595 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 77 transitions, 823 flow [2024-06-27 22:31:49,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 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 22:31:49,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:49,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:49,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:31:49,595 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:49,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1141481178, now seen corresponding path program 3 times [2024-06-27 22:31:49,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:49,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085418947] [2024-06-27 22:31:49,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:49,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:50,151 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 22:31:50,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:50,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085418947] [2024-06-27 22:31:50,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085418947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:50,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:50,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:31:50,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406568172] [2024-06-27 22:31:50,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:50,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:31:50,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:50,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:31:50,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:31:50,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-06-27 22:31:50,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 77 transitions, 823 flow. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 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 22:31:50,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:50,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-06-27 22:31:50,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:50,425 INFO L124 PetriNetUnfolderBase]: 461/1277 cut-off events. [2024-06-27 22:31:50,426 INFO L125 PetriNetUnfolderBase]: For 8107/8271 co-relation queries the response was YES. [2024-06-27 22:31:50,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4884 conditions, 1277 events. 461/1277 cut-off events. For 8107/8271 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9557 event pairs, 143 based on Foata normal form. 37/1202 useless extension candidates. Maximal degree in co-relation 4835. Up to 531 conditions per place. [2024-06-27 22:31:50,433 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 42 selfloop transitions, 32 changer transitions 0/95 dead transitions. [2024-06-27 22:31:50,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 95 transitions, 1053 flow [2024-06-27 22:31:50,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:31:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:31:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2024-06-27 22:31:50,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6177606177606177 [2024-06-27 22:31:50,435 INFO L175 Difference]: Start difference. First operand has 94 places, 77 transitions, 823 flow. Second operand 7 states and 160 transitions. [2024-06-27 22:31:50,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 95 transitions, 1053 flow [2024-06-27 22:31:50,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 95 transitions, 960 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-27 22:31:50,449 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 813 flow [2024-06-27 22:31:50,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=813, PETRI_PLACES=90, PETRI_TRANSITIONS=78} [2024-06-27 22:31:50,450 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 49 predicate places. [2024-06-27 22:31:50,450 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 813 flow [2024-06-27 22:31:50,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 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 22:31:50,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:50,451 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] [2024-06-27 22:31:50,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:31:50,451 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:50,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:50,451 INFO L85 PathProgramCache]: Analyzing trace with hash -65379422, now seen corresponding path program 1 times [2024-06-27 22:31:50,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:50,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454139437] [2024-06-27 22:31:50,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:50,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:50,534 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 22:31:50,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:50,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454139437] [2024-06-27 22:31:50,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454139437] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:50,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:50,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:31:50,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873616962] [2024-06-27 22:31:50,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:50,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:31:50,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:50,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:31:50,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:31:50,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-06-27 22:31:50,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 78 transitions, 813 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:50,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:50,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-06-27 22:31:50,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:50,683 INFO L124 PetriNetUnfolderBase]: 464/1091 cut-off events. [2024-06-27 22:31:50,684 INFO L125 PetriNetUnfolderBase]: For 6839/7025 co-relation queries the response was YES. [2024-06-27 22:31:50,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4361 conditions, 1091 events. 464/1091 cut-off events. For 6839/7025 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6813 event pairs, 94 based on Foata normal form. 113/1140 useless extension candidates. Maximal degree in co-relation 4317. Up to 416 conditions per place. [2024-06-27 22:31:50,689 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 58 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2024-06-27 22:31:50,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 83 transitions, 929 flow [2024-06-27 22:31:50,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:31:50,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:31:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-06-27 22:31:50,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6270270270270271 [2024-06-27 22:31:50,690 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 813 flow. Second operand 5 states and 116 transitions. [2024-06-27 22:31:50,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 83 transitions, 929 flow [2024-06-27 22:31:50,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 83 transitions, 670 flow, removed 28 selfloop flow, removed 17 redundant places. [2024-06-27 22:31:50,696 INFO L231 Difference]: Finished difference. Result has 79 places, 62 transitions, 429 flow [2024-06-27 22:31:50,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=429, PETRI_PLACES=79, PETRI_TRANSITIONS=62} [2024-06-27 22:31:50,697 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 38 predicate places. [2024-06-27 22:31:50,697 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 62 transitions, 429 flow [2024-06-27 22:31:50,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:50,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:50,698 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, 1] [2024-06-27 22:31:50,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:31:50,698 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:50,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:50,698 INFO L85 PathProgramCache]: Analyzing trace with hash -22154011, now seen corresponding path program 1 times [2024-06-27 22:31:50,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:50,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234881956] [2024-06-27 22:31:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:50,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:50,919 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 22:31:50,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:50,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234881956] [2024-06-27 22:31:50,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234881956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:50,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:50,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:31:50,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411182875] [2024-06-27 22:31:50,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:50,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:31:50,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:50,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:31:50,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:31:50,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-06-27 22:31:50,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 62 transitions, 429 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 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 22:31:50,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:50,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-06-27 22:31:50,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:51,120 INFO L124 PetriNetUnfolderBase]: 518/1271 cut-off events. [2024-06-27 22:31:51,120 INFO L125 PetriNetUnfolderBase]: For 2347/2471 co-relation queries the response was YES. [2024-06-27 22:31:51,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3842 conditions, 1271 events. 518/1271 cut-off events. For 2347/2471 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 9040 event pairs, 133 based on Foata normal form. 59/1229 useless extension candidates. Maximal degree in co-relation 3808. Up to 494 conditions per place. [2024-06-27 22:31:51,125 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 27 selfloop transitions, 10 changer transitions 43/95 dead transitions. [2024-06-27 22:31:51,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 95 transitions, 739 flow [2024-06-27 22:31:51,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:31:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:31:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-06-27 22:31:51,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5900900900900901 [2024-06-27 22:31:51,126 INFO L175 Difference]: Start difference. First operand has 79 places, 62 transitions, 429 flow. Second operand 6 states and 131 transitions. [2024-06-27 22:31:51,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 95 transitions, 739 flow [2024-06-27 22:31:51,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 95 transitions, 730 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 22:31:51,130 INFO L231 Difference]: Finished difference. Result has 87 places, 46 transitions, 299 flow [2024-06-27 22:31:51,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=299, PETRI_PLACES=87, PETRI_TRANSITIONS=46} [2024-06-27 22:31:51,131 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places. [2024-06-27 22:31:51,131 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 46 transitions, 299 flow [2024-06-27 22:31:51,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 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 22:31:51,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:51,131 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, 1] [2024-06-27 22:31:51,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:31:51,132 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:51,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash -409275379, now seen corresponding path program 2 times [2024-06-27 22:31:51,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:51,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311577140] [2024-06-27 22:31:51,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:51,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:31:51,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:31:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:31:51,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:31:51,194 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:31:51,194 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 22:31:51,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 22:31:51,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-27 22:31:51,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-27 22:31:51,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-27 22:31:51,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-27 22:31:51,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 22:31:51,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:31:51,196 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:51,200 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:31:51,200 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:31:51,251 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 22:31:51,251 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 22:31:51,260 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:31:51 BasicIcfg [2024-06-27 22:31:51,260 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:31:51,261 INFO L158 Benchmark]: Toolchain (without parser) took 10548.70ms. Allocated memory was 159.4MB in the beginning and 539.0MB in the end (delta: 379.6MB). Free memory was 84.7MB in the beginning and 261.6MB in the end (delta: -176.9MB). Peak memory consumption was 203.9MB. Max. memory is 16.1GB. [2024-06-27 22:31:51,261 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 113.2MB. Free memory was 74.3MB in the beginning and 74.2MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:31:51,261 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:31:51,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.81ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 116.7MB in the end (delta: -32.2MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-06-27 22:31:51,261 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.07ms. Allocated memory is still 159.4MB. Free memory was 116.7MB in the beginning and 113.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 22:31:51,262 INFO L158 Benchmark]: Boogie Preprocessor took 39.29ms. Allocated memory is still 159.4MB. Free memory was 113.6MB in the beginning and 110.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:31:51,262 INFO L158 Benchmark]: RCFGBuilder took 564.97ms. Allocated memory is still 159.4MB. Free memory was 110.4MB in the beginning and 64.8MB in the end (delta: 45.6MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-06-27 22:31:51,262 INFO L158 Benchmark]: TraceAbstraction took 9336.95ms. Allocated memory was 159.4MB in the beginning and 539.0MB in the end (delta: 379.6MB). Free memory was 64.3MB in the beginning and 261.6MB in the end (delta: -197.4MB). Peak memory consumption was 181.7MB. Max. memory is 16.1GB. [2024-06-27 22:31:51,263 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.09ms. Allocated memory is still 113.2MB. Free memory was 74.3MB in the beginning and 74.2MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 542.81ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 116.7MB in the end (delta: -32.2MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.07ms. Allocated memory is still 159.4MB. Free memory was 116.7MB in the beginning and 113.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.29ms. Allocated memory is still 159.4MB. Free memory was 113.6MB in the beginning and 110.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 564.97ms. Allocated memory is still 159.4MB. Free memory was 110.4MB in the beginning and 64.8MB in the end (delta: 45.6MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9336.95ms. Allocated memory was 159.4MB in the beginning and 539.0MB in the end (delta: 379.6MB). Free memory was 64.3MB in the beginning and 261.6MB in the end (delta: -197.4MB). Peak memory consumption was 181.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1587; [L801] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1587=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L801] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1587=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L802] 0 pthread_t t1588; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1587=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L803] 0 //@ assert (!multithreaded || ((((((((((((((((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL))); [L803] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1587=-1, t1588=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L769] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L738] 1 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L741] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L804] 0 //@ assert (!multithreaded || ((((((((((((((((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL))); VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1587=-1, t1588=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1587=-1, t1588=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L807] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L807] RET 0 assume_abort_if_not(main$tmp_guard0) [L809] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1587=-1, t1588=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1587=-1, t1588=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 804]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 803]: 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: 801]: 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, 56 locations, 7 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: 9.2s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 580 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 486 mSDsluCounter, 143 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2144 IncrementalHoareTripleChecker+Invalid, 2249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 36 mSDtfsCounter, 2144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1217occurred in iteration=13, InterpolantAutomatonStates: 99, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 3553 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 22:31:51,291 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