./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/reorder_2.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/reorder_2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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/reorder_2.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/reorder_2.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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 16:29:39,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 16:29:39,154 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 16:29:39,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 16:29:39,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 16:29:39,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 16:29:39,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 16:29:39,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 16:29:39,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 16:29:39,174 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 16:29:39,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 16:29:39,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 16:29:39,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 16:29:39,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 16:29:39,175 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 16:29:39,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 16:29:39,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 16:29:39,176 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 16:29:39,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 16:29:39,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 16:29:39,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 16:29:39,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 16:29:39,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 16:29:39,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 16:29:39,178 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 16:29:39,179 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 16:29:39,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 16:29:39,179 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 16:29:39,179 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 16:29:39,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 16:29:39,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 16:29:39,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 16:29:39,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:29:39,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 16:29:39,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 16:29:39,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 16:29:39,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 16:29:39,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 16:29:39,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 16:29:39,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 16:29:39,182 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 16:29:39,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 16:29:39,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 16:29:39,182 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 16:29:39,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 16:29:39,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 16:29:39,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 16:29:39,361 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 16:29:39,361 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 16:29:39,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/reorder_2.i [2024-06-04 16:29:40,447 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 16:29:40,735 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 16:29:40,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/reorder_2.i [2024-06-04 16:29:40,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db6b13db8/deb5bde5eaae4fc5a223f52c2830fd10/FLAG6bedae1c8 [2024-06-04 16:29:40,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db6b13db8/deb5bde5eaae4fc5a223f52c2830fd10 [2024-06-04 16:29:40,772 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 16:29:40,773 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 16:29:40,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/reorder_2.yml/witness.yml [2024-06-04 16:29:40,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 16:29:40,875 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 16:29:40,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 16:29:40,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 16:29:40,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 16:29:40,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:29:40" (1/2) ... [2024-06-04 16:29:40,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2c48aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:29:40, skipping insertion in model container [2024-06-04 16:29:40,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:29:40" (1/2) ... [2024-06-04 16:29:40,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@57a964ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:29:40, skipping insertion in model container [2024-06-04 16:29:40,883 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:29:40" (2/2) ... [2024-06-04 16:29:40,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2c48aa and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:40, skipping insertion in model container [2024-06-04 16:29:40,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:29:40" (2/2) ... [2024-06-04 16:29:40,884 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 16:29:40,999 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 16:29:41,000 INFO L97 edCorrectnessWitness]: Location invariant before [L1269-L1273] ((((((((((! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL)) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL)) [2024-06-04 16:29:41,000 INFO L97 edCorrectnessWitness]: Location invariant before [L1263-L1266] ((((((((((! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL)) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL)) [2024-06-04 16:29:41,000 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 16:29:41,000 INFO L106 edCorrectnessWitness]: ghost_update [L1269-L1270] multithreaded = 1; [2024-06-04 16:29:41,001 INFO L106 edCorrectnessWitness]: ghost_update [L1263-L1263] multithreaded = 1; [2024-06-04 16:29:41,086 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 16:29:41,482 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:29:41,492 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 16:29:41,666 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:29:41,717 INFO L206 MainTranslator]: Completed translation [2024-06-04 16:29:41,717 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:41 WrapperNode [2024-06-04 16:29:41,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 16:29:41,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 16:29:41,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 16:29:41,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 16:29:41,724 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 04.06 04:29:41" (1/1) ... [2024-06-04 16:29:41,741 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 04.06 04:29:41" (1/1) ... [2024-06-04 16:29:41,772 INFO L138 Inliner]: procedures = 372, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 144 [2024-06-04 16:29:41,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 16:29:41,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 16:29:41,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 16:29:41,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 16:29:41,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:41" (1/1) ... [2024-06-04 16:29:41,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:41" (1/1) ... [2024-06-04 16:29:41,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:41" (1/1) ... [2024-06-04 16:29:41,809 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-06-04 16:29:41,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:41" (1/1) ... [2024-06-04 16:29:41,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:41" (1/1) ... [2024-06-04 16:29:41,821 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:41" (1/1) ... [2024-06-04 16:29:41,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:41" (1/1) ... [2024-06-04 16:29:41,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:41" (1/1) ... [2024-06-04 16:29:41,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:41" (1/1) ... [2024-06-04 16:29:41,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 16:29:41,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 16:29:41,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 16:29:41,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 16:29:41,849 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:41" (1/1) ... [2024-06-04 16:29:41,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:29:41,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:29:41,890 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-04 16:29:41,943 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-04 16:29:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 16:29:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-06-04 16:29:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-06-04 16:29:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 16:29:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-04 16:29:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-04 16:29:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-04 16:29:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2024-06-04 16:29:41,958 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2024-06-04 16:29:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-04 16:29:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-04 16:29:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-04 16:29:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 16:29:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2024-06-04 16:29:41,960 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2024-06-04 16:29:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 16:29:41,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-04 16:29:41,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-04 16:29:41,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 16:29:41,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 16:29:41,963 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 16:29:42,114 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 16:29:42,115 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 16:29:42,380 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 16:29:42,381 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 16:29:42,530 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 16:29:42,530 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-04 16:29:42,531 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:29:42 BoogieIcfgContainer [2024-06-04 16:29:42,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 16:29:42,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 16:29:42,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 16:29:42,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 16:29:42,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 04:29:40" (1/4) ... [2024-06-04 16:29:42,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22692aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:29:42, skipping insertion in model container [2024-06-04 16:29:42,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:29:40" (2/4) ... [2024-06-04 16:29:42,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22692aaa and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:29:42, skipping insertion in model container [2024-06-04 16:29:42,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:41" (3/4) ... [2024-06-04 16:29:42,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22692aaa and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:29:42, skipping insertion in model container [2024-06-04 16:29:42,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:29:42" (4/4) ... [2024-06-04 16:29:42,545 INFO L112 eAbstractionObserver]: Analyzing ICFG reorder_2.i [2024-06-04 16:29:42,566 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 16:29:42,567 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 16:29:42,567 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 16:29:42,610 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-04 16:29:42,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 37 transitions, 94 flow [2024-06-04 16:29:42,680 INFO L124 PetriNetUnfolderBase]: 8/88 cut-off events. [2024-06-04 16:29:42,680 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-06-04 16:29:42,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 88 events. 8/88 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 326 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2024-06-04 16:29:42,683 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 37 transitions, 94 flow [2024-06-04 16:29:42,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 26 transitions, 60 flow [2024-06-04 16:29:42,698 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:29:42,706 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;@576f30ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:29:42,706 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 16:29:42,716 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:29:42,719 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-04 16:29:42,719 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:29:42,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:42,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-04 16:29:42,721 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:42,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:42,726 INFO L85 PathProgramCache]: Analyzing trace with hash 394596, now seen corresponding path program 1 times [2024-06-04 16:29:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:42,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546402680] [2024-06-04 16:29:42,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:42,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:42,950 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-04 16:29:42,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:42,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546402680] [2024-06-04 16:29:42,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546402680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:29:42,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:29:42,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:29:42,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355949482] [2024-06-04 16:29:42,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:42,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:29:42,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:42,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:29:42,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:29:43,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-04 16:29:43,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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-04 16:29:43,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:43,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-04 16:29:43,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:43,075 INFO L124 PetriNetUnfolderBase]: 30/128 cut-off events. [2024-06-04 16:29:43,076 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:29:43,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 128 events. 30/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 569 event pairs, 30 based on Foata normal form. 2/121 useless extension candidates. Maximal degree in co-relation 159. Up to 83 conditions per place. [2024-06-04 16:29:43,078 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 14 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-04 16:29:43,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 100 flow [2024-06-04 16:29:43,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:29:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:29:43,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2024-06-04 16:29:43,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-06-04 16:29:43,088 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 60 flow. Second operand 3 states and 55 transitions. [2024-06-04 16:29:43,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 100 flow [2024-06-04 16:29:43,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-04 16:29:43,092 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 81 flow [2024-06-04 16:29:43,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2024-06-04 16:29:43,096 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2024-06-04 16:29:43,096 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 81 flow [2024-06-04 16:29:43,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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-04 16:29:43,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:43,097 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:29:43,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 16:29:43,097 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:43,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:43,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1065913997, now seen corresponding path program 1 times [2024-06-04 16:29:43,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:43,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616633658] [2024-06-04 16:29:43,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:43,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:43,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:43,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616633658] [2024-06-04 16:29:43,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616633658] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:43,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902566508] [2024-06-04 16:29:43,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:43,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:43,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:29:43,645 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:29:43,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-04 16:29:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:43,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-04 16:29:43,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:29:43,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:43,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:29:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:44,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902566508] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:44,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-04 16:29:44,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2024-06-04 16:29:44,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610881495] [2024-06-04 16:29:44,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:44,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:29:44,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:44,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:29:44,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:29:44,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-04 16:29:44,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:44,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:44,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-04 16:29:44,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:44,527 INFO L124 PetriNetUnfolderBase]: 25/115 cut-off events. [2024-06-04 16:29:44,527 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-06-04 16:29:44,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 115 events. 25/115 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 477 event pairs, 25 based on Foata normal form. 8/113 useless extension candidates. Maximal degree in co-relation 151. Up to 56 conditions per place. [2024-06-04 16:29:44,528 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 20 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2024-06-04 16:29:44,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 34 transitions, 142 flow [2024-06-04 16:29:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:29:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:29:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2024-06-04 16:29:44,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527027027027027 [2024-06-04 16:29:44,529 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 81 flow. Second operand 4 states and 67 transitions. [2024-06-04 16:29:44,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 34 transitions, 142 flow [2024-06-04 16:29:44,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 139 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:29:44,531 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 94 flow [2024-06-04 16:29:44,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-06-04 16:29:44,531 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2024-06-04 16:29:44,531 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 94 flow [2024-06-04 16:29:44,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:44,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:44,532 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:29:44,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-04 16:29:44,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:44,733 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:44,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:44,733 INFO L85 PathProgramCache]: Analyzing trace with hash 788457449, now seen corresponding path program 1 times [2024-06-04 16:29:44,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:44,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998228478] [2024-06-04 16:29:44,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:44,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:45,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:45,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998228478] [2024-06-04 16:29:45,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998228478] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:45,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664454799] [2024-06-04 16:29:45,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:45,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:45,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:29:45,194 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:29:45,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-04 16:29:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:45,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2024-06-04 16:29:45,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:29:45,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:45,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:29:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:45,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664454799] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:45,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-04 16:29:45,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 13 [2024-06-04 16:29:45,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810459504] [2024-06-04 16:29:45,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:45,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:29:45,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:45,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:29:45,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-06-04 16:29:45,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-04 16:29:45,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-04 16:29:45,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:45,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-04 16:29:45,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:46,087 INFO L124 PetriNetUnfolderBase]: 30/117 cut-off events. [2024-06-04 16:29:46,090 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-06-04 16:29:46,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 117 events. 30/117 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 489 event pairs, 13 based on Foata normal form. 2/112 useless extension candidates. Maximal degree in co-relation 175. Up to 51 conditions per place. [2024-06-04 16:29:46,092 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 23 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2024-06-04 16:29:46,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 177 flow [2024-06-04 16:29:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:29:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:29:46,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2024-06-04 16:29:46,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40540540540540543 [2024-06-04 16:29:46,095 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 94 flow. Second operand 6 states and 90 transitions. [2024-06-04 16:29:46,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 177 flow [2024-06-04 16:29:46,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 16:29:46,099 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 114 flow [2024-06-04 16:29:46,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2024-06-04 16:29:46,099 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2024-06-04 16:29:46,099 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 114 flow [2024-06-04 16:29:46,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-04 16:29:46,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:46,100 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1] [2024-06-04 16:29:46,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-04 16:29:46,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-06-04 16:29:46,324 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:46,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:46,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1951054387, now seen corresponding path program 1 times [2024-06-04 16:29:46,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:46,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398328889] [2024-06-04 16:29:46,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 16:29:46,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-04 16:29:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 16:29:46,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-04 16:29:46,361 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-04 16:29:46,362 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-04 16:29:46,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-04 16:29:46,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-06-04 16:29:46,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-04 16:29:46,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 16:29:46,364 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-06-04 16:29:46,365 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-04 16:29:46,366 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-06-04 16:29:46,382 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-06-04 16:29:46,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 51 transitions, 146 flow [2024-06-04 16:29:46,400 INFO L124 PetriNetUnfolderBase]: 57/283 cut-off events. [2024-06-04 16:29:46,400 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-06-04 16:29:46,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 283 events. 57/283 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1348 event pairs, 1 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 191. Up to 32 conditions per place. [2024-06-04 16:29:46,401 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 51 transitions, 146 flow [2024-06-04 16:29:46,418 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 92 flow [2024-06-04 16:29:46,419 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:29:46,419 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;@576f30ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:29:46,419 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 16:29:46,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:29:46,421 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-04 16:29:46,421 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:29:46,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:46,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-04 16:29:46,421 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:46,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:46,422 INFO L85 PathProgramCache]: Analyzing trace with hash 443253, now seen corresponding path program 1 times [2024-06-04 16:29:46,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:46,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267903775] [2024-06-04 16:29:46,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:46,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:46,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:46,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267903775] [2024-06-04 16:29:46,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267903775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:29:46,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:29:46,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:29:46,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358343079] [2024-06-04 16:29:46,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:46,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:29:46,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:46,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:29:46,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:29:46,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2024-06-04 16:29:46,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-04 16:29:46,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:46,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2024-06-04 16:29:46,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:46,532 INFO L124 PetriNetUnfolderBase]: 346/832 cut-off events. [2024-06-04 16:29:46,533 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-06-04 16:29:46,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1518 conditions, 832 events. 346/832 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5552 event pairs, 346 based on Foata normal form. 2/783 useless extension candidates. Maximal degree in co-relation 612. Up to 615 conditions per place. [2024-06-04 16:29:46,538 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 18 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2024-06-04 16:29:46,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 140 flow [2024-06-04 16:29:46,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:29:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:29:46,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-06-04 16:29:46,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5032679738562091 [2024-06-04 16:29:46,540 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 92 flow. Second operand 3 states and 77 transitions. [2024-06-04 16:29:46,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 140 flow [2024-06-04 16:29:46,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-04 16:29:46,541 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 113 flow [2024-06-04 16:29:46,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-06-04 16:29:46,542 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2024-06-04 16:29:46,542 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 113 flow [2024-06-04 16:29:46,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-04 16:29:46,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:46,542 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:29:46,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 16:29:46,543 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:46,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:46,543 INFO L85 PathProgramCache]: Analyzing trace with hash -113813194, now seen corresponding path program 1 times [2024-06-04 16:29:46,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:46,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498951915] [2024-06-04 16:29:46,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:46,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:46,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:46,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498951915] [2024-06-04 16:29:46,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498951915] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:46,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175923571] [2024-06-04 16:29:46,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:46,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:46,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:29:46,789 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:29:46,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-04 16:29:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:46,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-04 16:29:46,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:29:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:46,991 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:29:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:47,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175923571] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:47,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-04 16:29:47,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 9 [2024-06-04 16:29:47,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124800445] [2024-06-04 16:29:47,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:47,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:29:47,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:47,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:29:47,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:29:47,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2024-06-04 16:29:47,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 113 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-04 16:29:47,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:47,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2024-06-04 16:29:47,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:47,505 INFO L124 PetriNetUnfolderBase]: 281/719 cut-off events. [2024-06-04 16:29:47,505 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2024-06-04 16:29:47,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1366 conditions, 719 events. 281/719 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4627 event pairs, 281 based on Foata normal form. 48/727 useless extension candidates. Maximal degree in co-relation 1189. Up to 454 conditions per place. [2024-06-04 16:29:47,509 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 26 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2024-06-04 16:29:47,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 195 flow [2024-06-04 16:29:47,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:29:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:29:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-06-04 16:29:47,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47549019607843135 [2024-06-04 16:29:47,510 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 113 flow. Second operand 4 states and 97 transitions. [2024-06-04 16:29:47,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 195 flow [2024-06-04 16:29:47,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:29:47,512 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 126 flow [2024-06-04 16:29:47,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2024-06-04 16:29:47,513 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-06-04 16:29:47,513 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 126 flow [2024-06-04 16:29:47,513 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-04 16:29:47,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:47,513 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:29:47,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-04 16:29:47,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:47,725 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:47,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:47,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1430467104, now seen corresponding path program 1 times [2024-06-04 16:29:47,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:47,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683069233] [2024-06-04 16:29:47,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:47,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:47,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:47,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683069233] [2024-06-04 16:29:47,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683069233] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:47,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41481023] [2024-06-04 16:29:47,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:47,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:47,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:29:47,997 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:29:48,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-04 16:29:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:48,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjunts are in the unsatisfiable core [2024-06-04 16:29:48,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:29:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:48,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:29:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:48,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41481023] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:48,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-04 16:29:48,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 12 [2024-06-04 16:29:48,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599764435] [2024-06-04 16:29:48,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:48,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:29:48,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:48,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:29:48,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-06-04 16:29:48,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 51 [2024-06-04 16:29:48,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:48,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:48,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 51 [2024-06-04 16:29:48,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:49,031 INFO L124 PetriNetUnfolderBase]: 346/776 cut-off events. [2024-06-04 16:29:49,031 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2024-06-04 16:29:49,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1542 conditions, 776 events. 346/776 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5039 event pairs, 323 based on Foata normal form. 6/731 useless extension candidates. Maximal degree in co-relation 1375. Up to 507 conditions per place. [2024-06-04 16:29:49,035 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 33 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2024-06-04 16:29:49,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 246 flow [2024-06-04 16:29:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:29:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:29:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-06-04 16:29:49,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-04 16:29:49,036 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 126 flow. Second operand 6 states and 136 transitions. [2024-06-04 16:29:49,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 246 flow [2024-06-04 16:29:49,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 16:29:49,038 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 146 flow [2024-06-04 16:29:49,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2024-06-04 16:29:49,039 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2024-06-04 16:29:49,039 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 146 flow [2024-06-04 16:29:49,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:49,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:49,039 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1] [2024-06-04 16:29:49,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-04 16:29:49,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:49,250 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:49,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:49,251 INFO L85 PathProgramCache]: Analyzing trace with hash 199806883, now seen corresponding path program 1 times [2024-06-04 16:29:49,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:49,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154914111] [2024-06-04 16:29:49,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:49,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 16:29:49,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-04 16:29:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 16:29:49,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-04 16:29:49,274 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-04 16:29:49,274 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-04 16:29:49,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-04 16:29:49,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-06-04 16:29:49,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-04 16:29:49,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 16:29:49,275 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-06-04 16:29:49,276 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-04 16:29:49,276 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-06-04 16:29:49,294 INFO L144 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-06-04 16:29:49,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 65 transitions, 202 flow [2024-06-04 16:29:49,353 INFO L124 PetriNetUnfolderBase]: 336/982 cut-off events. [2024-06-04 16:29:49,353 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2024-06-04 16:29:49,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 982 events. 336/982 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5521 event pairs, 32 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 705. Up to 192 conditions per place. [2024-06-04 16:29:49,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 65 transitions, 202 flow [2024-06-04 16:29:49,357 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 46 transitions, 128 flow [2024-06-04 16:29:49,358 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:29:49,358 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;@576f30ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:29:49,358 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 16:29:49,359 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:29:49,359 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-04 16:29:49,359 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:29:49,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:49,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-04 16:29:49,360 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:49,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:49,360 INFO L85 PathProgramCache]: Analyzing trace with hash 505812, now seen corresponding path program 1 times [2024-06-04 16:29:49,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:49,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666362160] [2024-06-04 16:29:49,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:49,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:49,373 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-04 16:29:49,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:49,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666362160] [2024-06-04 16:29:49,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666362160] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:29:49,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:29:49,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:29:49,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751946591] [2024-06-04 16:29:49,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:49,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:29:49,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:49,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:29:49,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:29:49,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-06-04 16:29:49,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 16:29:49,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:49,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-06-04 16:29:49,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:49,814 INFO L124 PetriNetUnfolderBase]: 2506/4632 cut-off events. [2024-06-04 16:29:49,814 INFO L125 PetriNetUnfolderBase]: For 608/608 co-relation queries the response was YES. [2024-06-04 16:29:49,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8712 conditions, 4632 events. 2506/4632 cut-off events. For 608/608 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 34508 event pairs, 2506 based on Foata normal form. 2/4403 useless extension candidates. Maximal degree in co-relation 3684. Up to 3687 conditions per place. [2024-06-04 16:29:49,838 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 22 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2024-06-04 16:29:49,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 184 flow [2024-06-04 16:29:49,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:29:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:29:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-06-04 16:29:49,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076923076923077 [2024-06-04 16:29:49,839 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 128 flow. Second operand 3 states and 99 transitions. [2024-06-04 16:29:49,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 184 flow [2024-06-04 16:29:49,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 49 transitions, 180 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-04 16:29:49,841 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 145 flow [2024-06-04 16:29:49,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2024-06-04 16:29:49,842 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2024-06-04 16:29:49,842 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 145 flow [2024-06-04 16:29:49,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 16:29:49,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:49,843 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:29:49,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 16:29:49,843 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:49,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:49,843 INFO L85 PathProgramCache]: Analyzing trace with hash 2050727149, now seen corresponding path program 1 times [2024-06-04 16:29:49,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:49,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470111801] [2024-06-04 16:29:49,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:49,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:50,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:50,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470111801] [2024-06-04 16:29:50,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470111801] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:50,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241229983] [2024-06-04 16:29:50,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:50,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:50,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:29:50,033 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:29:50,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-06-04 16:29:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:50,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-04 16:29:50,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:29:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:50,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:29:50,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:50,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241229983] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:50,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-04 16:29:50,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2024-06-04 16:29:50,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490465239] [2024-06-04 16:29:50,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:50,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:29:50,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:50,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:29:50,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:29:50,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 65 [2024-06-04 16:29:50,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 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-04 16:29:50,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:50,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 65 [2024-06-04 16:29:50,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:51,111 INFO L124 PetriNetUnfolderBase]: 2013/3915 cut-off events. [2024-06-04 16:29:51,111 INFO L125 PetriNetUnfolderBase]: For 944/944 co-relation queries the response was YES. [2024-06-04 16:29:51,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7488 conditions, 3915 events. 2013/3915 cut-off events. For 944/944 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 29134 event pairs, 2013 based on Foata normal form. 224/3991 useless extension candidates. Maximal degree in co-relation 7057. Up to 2834 conditions per place. [2024-06-04 16:29:51,134 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 32 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-06-04 16:29:51,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 248 flow [2024-06-04 16:29:51,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:29:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:29:51,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-06-04 16:29:51,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48846153846153845 [2024-06-04 16:29:51,136 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 145 flow. Second operand 4 states and 127 transitions. [2024-06-04 16:29:51,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 248 flow [2024-06-04 16:29:51,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 58 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:29:51,138 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 158 flow [2024-06-04 16:29:51,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2024-06-04 16:29:51,138 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 6 predicate places. [2024-06-04 16:29:51,139 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 158 flow [2024-06-04 16:29:51,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 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-04 16:29:51,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:51,139 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:29:51,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-06-04 16:29:51,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-06-04 16:29:51,351 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:51,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:51,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1238654103, now seen corresponding path program 1 times [2024-06-04 16:29:51,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:51,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951616112] [2024-06-04 16:29:51,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:51,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:51,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:51,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:51,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951616112] [2024-06-04 16:29:51,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951616112] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:51,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740509174] [2024-06-04 16:29:51,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:51,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:51,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:29:51,544 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:29:51,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-06-04 16:29:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:51,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-04 16:29:51,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:29:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:51,781 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:29:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:52,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740509174] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:52,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-04 16:29:52,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 12 [2024-06-04 16:29:52,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956400451] [2024-06-04 16:29:52,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:52,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:29:52,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:52,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:29:52,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-06-04 16:29:52,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 65 [2024-06-04 16:29:52,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 49 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 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-04 16:29:52,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:52,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 65 [2024-06-04 16:29:52,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:52,774 INFO L124 PetriNetUnfolderBase]: 2489/4362 cut-off events. [2024-06-04 16:29:52,774 INFO L125 PetriNetUnfolderBase]: For 736/736 co-relation queries the response was YES. [2024-06-04 16:29:52,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8626 conditions, 4362 events. 2489/4362 cut-off events. For 736/736 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 31107 event pairs, 1247 based on Foata normal form. 14/4182 useless extension candidates. Maximal degree in co-relation 8223. Up to 3267 conditions per place. [2024-06-04 16:29:52,795 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 32 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2024-06-04 16:29:52,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 61 transitions, 254 flow [2024-06-04 16:29:52,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:29:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:29:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-06-04 16:29:52,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-06-04 16:29:52,797 INFO L175 Difference]: Start difference. First operand has 65 places, 49 transitions, 158 flow. Second operand 5 states and 150 transitions. [2024-06-04 16:29:52,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 61 transitions, 254 flow [2024-06-04 16:29:52,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 16:29:52,799 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 175 flow [2024-06-04 16:29:52,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2024-06-04 16:29:52,799 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 9 predicate places. [2024-06-04 16:29:52,799 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 175 flow [2024-06-04 16:29:52,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 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-04 16:29:52,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:52,800 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2024-06-04 16:29:52,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-06-04 16:29:53,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:53,011 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:53,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:53,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1874875356, now seen corresponding path program 1 times [2024-06-04 16:29:53,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:53,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883488910] [2024-06-04 16:29:53,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:53,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 16:29:53,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-04 16:29:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 16:29:53,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-04 16:29:53,041 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-04 16:29:53,041 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-04 16:29:53,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-04 16:29:53,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-06-04 16:29:53,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-04 16:29:53,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 16:29:53,041 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-06-04 16:29:53,042 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-04 16:29:53,042 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-06-04 16:29:53,060 INFO L144 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2024-06-04 16:29:53,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 79 transitions, 262 flow [2024-06-04 16:29:53,388 INFO L124 PetriNetUnfolderBase]: 1817/3913 cut-off events. [2024-06-04 16:29:53,388 INFO L125 PetriNetUnfolderBase]: For 2144/2144 co-relation queries the response was YES. [2024-06-04 16:29:53,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6054 conditions, 3913 events. 1817/3913 cut-off events. For 2144/2144 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 24913 event pairs, 313 based on Foata normal form. 0/3341 useless extension candidates. Maximal degree in co-relation 2890. Up to 1024 conditions per place. [2024-06-04 16:29:53,396 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 79 transitions, 262 flow [2024-06-04 16:29:53,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 56 transitions, 168 flow [2024-06-04 16:29:53,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:29:53,400 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;@576f30ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:29:53,400 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 16:29:53,402 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:29:53,402 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-04 16:29:53,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:29:53,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:53,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-04 16:29:53,402 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:53,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:53,402 INFO L85 PathProgramCache]: Analyzing trace with hash 582273, now seen corresponding path program 1 times [2024-06-04 16:29:53,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:53,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33992181] [2024-06-04 16:29:53,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:53,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:53,417 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-04 16:29:53,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:53,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33992181] [2024-06-04 16:29:53,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33992181] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:29:53,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:29:53,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:29:53,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242349587] [2024-06-04 16:29:53,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:53,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:29:53,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:53,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:29:53,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:29:53,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 79 [2024-06-04 16:29:53,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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-04 16:29:53,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:53,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 79 [2024-06-04 16:29:53,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:55,836 INFO L124 PetriNetUnfolderBase]: 14906/23768 cut-off events. [2024-06-04 16:29:55,836 INFO L125 PetriNetUnfolderBase]: For 5056/5056 co-relation queries the response was YES. [2024-06-04 16:29:55,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45658 conditions, 23768 events. 14906/23768 cut-off events. For 5056/5056 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 184104 event pairs, 14906 based on Foata normal form. 2/22795 useless extension candidates. Maximal degree in co-relation 19955. Up to 19831 conditions per place. [2024-06-04 16:29:56,059 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 26 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2024-06-04 16:29:56,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 59 transitions, 232 flow [2024-06-04 16:29:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:29:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:29:56,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2024-06-04 16:29:56,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510548523206751 [2024-06-04 16:29:56,066 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 168 flow. Second operand 3 states and 121 transitions. [2024-06-04 16:29:56,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 59 transitions, 232 flow [2024-06-04 16:29:56,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 59 transitions, 220 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-04 16:29:56,072 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 177 flow [2024-06-04 16:29:56,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2024-06-04 16:29:56,073 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2024-06-04 16:29:56,073 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 177 flow [2024-06-04 16:29:56,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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-04 16:29:56,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:56,073 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:29:56,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 16:29:56,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:56,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:56,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1030399566, now seen corresponding path program 1 times [2024-06-04 16:29:56,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:56,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060428043] [2024-06-04 16:29:56,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:56,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:56,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:56,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060428043] [2024-06-04 16:29:56,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060428043] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:56,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510306616] [2024-06-04 16:29:56,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:56,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:56,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:29:56,322 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:29:56,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-06-04 16:29:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:56,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-04 16:29:56,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:29:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:56,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:29:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:56,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510306616] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:56,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-04 16:29:56,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 9 [2024-06-04 16:29:56,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748740367] [2024-06-04 16:29:56,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:57,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:29:57,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:57,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:29:57,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:29:57,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2024-06-04 16:29:57,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 58 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 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-04 16:29:57,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:57,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2024-06-04 16:29:57,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:59,023 INFO L124 PetriNetUnfolderBase]: 11917/19819 cut-off events. [2024-06-04 16:29:59,023 INFO L125 PetriNetUnfolderBase]: For 5472/5472 co-relation queries the response was YES. [2024-06-04 16:29:59,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38178 conditions, 19819 events. 11917/19819 cut-off events. For 5472/5472 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 155984 event pairs, 11917 based on Foata normal form. 960/20223 useless extension candidates. Maximal degree in co-relation 37161. Up to 15530 conditions per place. [2024-06-04 16:29:59,172 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 38 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2024-06-04 16:29:59,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 70 transitions, 301 flow [2024-06-04 16:29:59,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:29:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:29:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2024-06-04 16:29:59,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49683544303797467 [2024-06-04 16:29:59,173 INFO L175 Difference]: Start difference. First operand has 76 places, 58 transitions, 177 flow. Second operand 4 states and 157 transitions. [2024-06-04 16:29:59,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 70 transitions, 301 flow [2024-06-04 16:29:59,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 70 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:29:59,181 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 190 flow [2024-06-04 16:29:59,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=79, PETRI_TRANSITIONS=59} [2024-06-04 16:29:59,181 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2024-06-04 16:29:59,182 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 190 flow [2024-06-04 16:29:59,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 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-04 16:29:59,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:59,182 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:29:59,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-06-04 16:29:59,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:59,394 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:59,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:59,395 INFO L85 PathProgramCache]: Analyzing trace with hash 205886478, now seen corresponding path program 1 times [2024-06-04 16:29:59,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:59,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949067200] [2024-06-04 16:29:59,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:59,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:59,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:59,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:59,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949067200] [2024-06-04 16:29:59,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949067200] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:59,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888606574] [2024-06-04 16:29:59,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:59,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:59,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:29:59,722 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:29:59,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-06-04 16:29:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:59,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2024-06-04 16:29:59,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:29:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:59,991 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:30:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:00,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888606574] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-04 16:30:00,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-04 16:30:00,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 13 [2024-06-04 16:30:00,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750277571] [2024-06-04 16:30:00,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:00,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:30:00,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:00,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:30:00,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-06-04 16:30:00,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2024-06-04 16:30:00,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 6 states have internal predecessors, (177), 0 states have call successors, (0), 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-04 16:30:00,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:00,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2024-06-04 16:30:00,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:02,966 INFO L124 PetriNetUnfolderBase]: 14906/22778 cut-off events. [2024-06-04 16:30:02,966 INFO L125 PetriNetUnfolderBase]: For 4557/4557 co-relation queries the response was YES. [2024-06-04 16:30:03,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45092 conditions, 22778 events. 14906/22778 cut-off events. For 4557/4557 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 168696 event pairs, 7090 based on Foata normal form. 30/21820 useless extension candidates. Maximal degree in co-relation 44133. Up to 19067 conditions per place. [2024-06-04 16:30:03,120 INFO L140 encePairwiseOnDemand]: 72/79 looper letters, 49 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2024-06-04 16:30:03,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 84 transitions, 368 flow [2024-06-04 16:30:03,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:30:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:30:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2024-06-04 16:30:03,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47257383966244726 [2024-06-04 16:30:03,122 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 190 flow. Second operand 6 states and 224 transitions. [2024-06-04 16:30:03,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 84 transitions, 368 flow [2024-06-04 16:30:03,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 84 transitions, 365 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 16:30:03,129 INFO L231 Difference]: Finished difference. Result has 83 places, 60 transitions, 210 flow [2024-06-04 16:30:03,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=83, PETRI_TRANSITIONS=60} [2024-06-04 16:30:03,130 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2024-06-04 16:30:03,131 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 60 transitions, 210 flow [2024-06-04 16:30:03,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 6 states have internal predecessors, (177), 0 states have call successors, (0), 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-04 16:30:03,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:03,131 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:03,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-06-04 16:30:03,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-06-04 16:30:03,342 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:30:03,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:03,343 INFO L85 PathProgramCache]: Analyzing trace with hash 828616886, now seen corresponding path program 1 times [2024-06-04 16:30:03,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:03,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659864594] [2024-06-04 16:30:03,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:03,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 16:30:03,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-04 16:30:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 16:30:03,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-04 16:30:03,386 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-04 16:30:03,386 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-04 16:30:03,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-04 16:30:03,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-06-04 16:30:03,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-04 16:30:03,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 16:30:03,387 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-06-04 16:30:03,387 WARN L234 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-04 16:30:03,387 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-06-04 16:30:03,415 INFO L144 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2024-06-04 16:30:03,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 93 transitions, 326 flow [2024-06-04 16:30:04,781 INFO L124 PetriNetUnfolderBase]: 9252/16852 cut-off events. [2024-06-04 16:30:04,781 INFO L125 PetriNetUnfolderBase]: For 10450/10450 co-relation queries the response was YES. [2024-06-04 16:30:04,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27243 conditions, 16852 events. 9252/16852 cut-off events. For 10450/10450 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 120076 event pairs, 2148 based on Foata normal form. 0/14720 useless extension candidates. Maximal degree in co-relation 12795. Up to 5120 conditions per place. [2024-06-04 16:30:04,836 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 93 transitions, 326 flow [2024-06-04 16:30:04,845 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 66 transitions, 212 flow [2024-06-04 16:30:04,846 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:30:04,846 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;@576f30ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:30:04,846 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 16:30:04,848 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:30:04,848 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-04 16:30:04,848 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:30:04,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:04,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-04 16:30:04,848 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:30:04,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:04,849 INFO L85 PathProgramCache]: Analyzing trace with hash 672636, now seen corresponding path program 1 times [2024-06-04 16:30:04,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:04,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364699310] [2024-06-04 16:30:04,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:04,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:04,863 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-04 16:30:04,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:04,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364699310] [2024-06-04 16:30:04,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364699310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:04,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:04,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:30:04,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942193265] [2024-06-04 16:30:04,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:04,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:30:04,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:04,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:30:04,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:30:04,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 93 [2024-06-04 16:30:04,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 66 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-04 16:30:04,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:04,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 93 [2024-06-04 16:30:04,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:18,361 INFO L124 PetriNetUnfolderBase]: 79802/115960 cut-off events. [2024-06-04 16:30:18,361 INFO L125 PetriNetUnfolderBase]: For 34688/34688 co-relation queries the response was YES. [2024-06-04 16:30:19,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226108 conditions, 115960 events. 79802/115960 cut-off events. For 34688/34688 co-relation queries the response was YES. Maximal size of possible extension queue 3208. Compared 914072 event pairs, 79802 based on Foata normal form. 2/111963 useless extension candidates. Maximal degree in co-relation 102019. Up to 99895 conditions per place. [2024-06-04 16:30:19,617 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 30 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2024-06-04 16:30:19,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 69 transitions, 284 flow [2024-06-04 16:30:19,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:30:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:30:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2024-06-04 16:30:19,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125448028673835 [2024-06-04 16:30:19,620 INFO L175 Difference]: Start difference. First operand has 87 places, 66 transitions, 212 flow. Second operand 3 states and 143 transitions. [2024-06-04 16:30:19,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 69 transitions, 284 flow [2024-06-04 16:30:19,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 69 transitions, 260 flow, removed 12 selfloop flow, removed 0 redundant places. [2024-06-04 16:30:19,642 INFO L231 Difference]: Finished difference. Result has 90 places, 68 transitions, 209 flow [2024-06-04 16:30:19,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=90, PETRI_TRANSITIONS=68} [2024-06-04 16:30:19,642 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 3 predicate places. [2024-06-04 16:30:19,643 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 68 transitions, 209 flow [2024-06-04 16:30:19,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-04 16:30:19,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:19,643 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:19,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 16:30:19,643 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:30:19,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash -767258747, now seen corresponding path program 1 times [2024-06-04 16:30:19,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:19,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291354253] [2024-06-04 16:30:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:19,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:19,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:19,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291354253] [2024-06-04 16:30:19,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291354253] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:30:19,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425610651] [2024-06-04 16:30:19,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:19,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:30:19,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:30:19,823 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:30:19,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-06-04 16:30:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:19,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-04 16:30:19,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:30:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:20,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:30:20,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:20,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425610651] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-04 16:30:20,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-04 16:30:20,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 9 [2024-06-04 16:30:20,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961133836] [2024-06-04 16:30:20,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:20,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:30:20,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:20,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:30:20,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:30:20,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 93 [2024-06-04 16:30:20,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 68 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 0 states have call successors, (0), 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-04 16:30:20,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:20,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 93 [2024-06-04 16:30:20,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand