./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 cde23df1 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-cde23df-m [2024-06-14 14:22:02,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 14:22:02,825 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 14:22:02,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 14:22:02,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 14:22:02,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 14:22:02,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 14:22:02,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 14:22:02,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 14:22:02,859 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 14:22:02,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 14:22:02,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 14:22:02,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 14:22:02,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 14:22:02,860 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 14:22:02,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 14:22:02,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 14:22:02,861 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 14:22:02,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 14:22:02,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 14:22:02,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 14:22:02,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 14:22:02,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 14:22:02,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 14:22:02,879 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 14:22:02,879 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 14:22:02,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 14:22:02,880 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 14:22:02,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 14:22:02,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 14:22:02,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 14:22:02,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 14:22:02,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:22:02,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 14:22:02,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 14:22:02,881 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 14:22:02,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 14:22:02,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 14:22:02,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 14:22:02,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 14:22:02,882 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 14:22:02,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 14:22:02,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 14:22:02,882 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-14 14:22:03,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 14:22:03,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 14:22:03,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 14:22:03,268 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 14:22:03,280 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 14:22:03,281 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-14 14:22:04,392 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 14:22:04,678 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 14:22:04,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/reorder_2.i [2024-06-14 14:22:04,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2b3c19de/7df899ffa5fe4c9cacbe3a985a48f6b9/FLAGc03bcb55d [2024-06-14 14:22:04,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2b3c19de/7df899ffa5fe4c9cacbe3a985a48f6b9 [2024-06-14 14:22:04,719 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 14:22:04,719 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 14:22:04,720 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-14 14:22:04,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 14:22:04,859 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 14:22:04,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 14:22:04,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 14:22:04,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 14:22:04,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:22:04" (1/2) ... [2024-06-14 14:22:04,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72515f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:04, skipping insertion in model container [2024-06-14 14:22:04,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:22:04" (1/2) ... [2024-06-14 14:22:04,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@60595be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:04, skipping insertion in model container [2024-06-14 14:22:04,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:22:04" (2/2) ... [2024-06-14 14:22:04,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72515f65 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:04, skipping insertion in model container [2024-06-14 14:22:04,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:22:04" (2/2) ... [2024-06-14 14:22:04,869 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 14:22:04,932 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 14:22:04,934 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-14 14:22:04,934 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-14 14:22:04,934 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 14:22:04,935 INFO L106 edCorrectnessWitness]: ghost_update [L1269-L1270] multithreaded = 1; [2024-06-14 14:22:04,935 INFO L106 edCorrectnessWitness]: ghost_update [L1263-L1263] multithreaded = 1; [2024-06-14 14:22:04,973 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 14:22:05,362 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:22:05,377 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 14:22:05,671 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:22:05,732 INFO L206 MainTranslator]: Completed translation [2024-06-14 14:22:05,733 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05 WrapperNode [2024-06-14 14:22:05,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 14:22:05,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 14:22:05,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 14:22:05,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 14:22:05,739 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 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,762 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 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,805 INFO L138 Inliner]: procedures = 372, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 144 [2024-06-14 14:22:05,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 14:22:05,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 14:22:05,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 14:22:05,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 14:22:05,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,850 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-14 14:22:05,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 14:22:05,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 14:22:05,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 14:22:05,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 14:22:05,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (1/1) ... [2024-06-14 14:22:05,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:22:05,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:05,966 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-14 14:22:05,970 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-14 14:22:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 14:22:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-06-14 14:22:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-06-14 14:22:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 14:22:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-14 14:22:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-14 14:22:06,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-14 14:22:06,009 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2024-06-14 14:22:06,009 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2024-06-14 14:22:06,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-14 14:22:06,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-14 14:22:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-14 14:22:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 14:22:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2024-06-14 14:22:06,010 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2024-06-14 14:22:06,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 14:22:06,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-14 14:22:06,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-14 14:22:06,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 14:22:06,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 14:22:06,014 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 14:22:06,137 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 14:22:06,139 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 14:22:06,453 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 14:22:06,453 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 14:22:06,551 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 14:22:06,552 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-14 14:22:06,552 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:22:06 BoogieIcfgContainer [2024-06-14 14:22:06,552 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 14:22:06,554 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 14:22:06,554 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 14:22:06,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 14:22:06,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:22:04" (1/4) ... [2024-06-14 14:22:06,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a354cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:22:06, skipping insertion in model container [2024-06-14 14:22:06,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:22:04" (2/4) ... [2024-06-14 14:22:06,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a354cd4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:22:06, skipping insertion in model container [2024-06-14 14:22:06,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:05" (3/4) ... [2024-06-14 14:22:06,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a354cd4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:22:06, skipping insertion in model container [2024-06-14 14:22:06,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:22:06" (4/4) ... [2024-06-14 14:22:06,559 INFO L112 eAbstractionObserver]: Analyzing ICFG reorder_2.i [2024-06-14 14:22:06,571 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 14:22:06,572 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 14:22:06,572 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 14:22:06,598 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-14 14:22:06,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 37 transitions, 94 flow [2024-06-14 14:22:06,649 INFO L124 PetriNetUnfolderBase]: 8/88 cut-off events. [2024-06-14 14:22:06,649 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-06-14 14:22:06,652 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-14 14:22:06,652 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 37 transitions, 94 flow [2024-06-14 14:22:06,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 26 transitions, 60 flow [2024-06-14 14:22:06,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:22:06,676 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;@1917b973, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:22:06,676 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 14:22:06,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:22:06,679 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-14 14:22:06,679 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:06,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:06,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-14 14:22:06,680 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-14 14:22:06,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash 394596, now seen corresponding path program 1 times [2024-06-14 14:22:06,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:06,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135588962] [2024-06-14 14:22:06,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:06,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:06,879 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-14 14:22:06,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:06,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135588962] [2024-06-14 14:22:06,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135588962] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:06,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:06,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:22:06,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884640253] [2024-06-14 14:22:06,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:06,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:22:06,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:06,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:22:06,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:22:06,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-14 14:22:06,949 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-14 14:22:06,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:06,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-14 14:22:06,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:07,009 INFO L124 PetriNetUnfolderBase]: 30/128 cut-off events. [2024-06-14 14:22:07,009 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:07,010 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-14 14:22:07,011 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 14 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-14 14:22:07,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 100 flow [2024-06-14 14:22:07,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:22:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:22:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2024-06-14 14:22:07,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-06-14 14:22:07,023 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 60 flow. Second operand 3 states and 55 transitions. [2024-06-14 14:22:07,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 100 flow [2024-06-14 14:22:07,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-14 14:22:07,027 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 81 flow [2024-06-14 14:22:07,028 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-14 14:22:07,031 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2024-06-14 14:22:07,031 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 81 flow [2024-06-14 14:22:07,031 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-14 14:22:07,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:07,032 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:07,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 14:22:07,032 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-14 14:22:07,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:07,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1065913997, now seen corresponding path program 1 times [2024-06-14 14:22:07,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:07,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34098344] [2024-06-14 14:22:07,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:07,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:07,507 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-14 14:22:07,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:07,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34098344] [2024-06-14 14:22:07,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34098344] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:07,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370646959] [2024-06-14 14:22:07,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:07,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:07,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:07,513 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-14 14:22:07,560 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-14 14:22:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:07,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-14 14:22:07,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:22:07,828 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-14 14:22:07,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:22:08,229 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-14 14:22:08,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370646959] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:08,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-14 14:22:08,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2024-06-14 14:22:08,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587306430] [2024-06-14 14:22:08,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:08,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:22:08,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:08,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:22:08,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:22:08,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-14 14:22:08,277 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-14 14:22:08,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:08,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-14 14:22:08,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:08,340 INFO L124 PetriNetUnfolderBase]: 25/115 cut-off events. [2024-06-14 14:22:08,340 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-06-14 14:22:08,341 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-14 14:22:08,346 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 20 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2024-06-14 14:22:08,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 34 transitions, 142 flow [2024-06-14 14:22:08,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:22:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:22:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2024-06-14 14:22:08,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527027027027027 [2024-06-14 14:22:08,350 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 81 flow. Second operand 4 states and 67 transitions. [2024-06-14 14:22:08,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 34 transitions, 142 flow [2024-06-14 14:22:08,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 139 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:22:08,353 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 94 flow [2024-06-14 14:22:08,354 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-14 14:22:08,354 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2024-06-14 14:22:08,354 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 94 flow [2024-06-14 14:22:08,354 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-14 14:22:08,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:08,354 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:08,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-14 14:22:08,566 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-14 14:22:08,567 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-14 14:22:08,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:08,568 INFO L85 PathProgramCache]: Analyzing trace with hash 788457449, now seen corresponding path program 1 times [2024-06-14 14:22:08,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:08,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043066663] [2024-06-14 14:22:08,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:08,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:08,873 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-14 14:22:08,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:08,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043066663] [2024-06-14 14:22:08,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043066663] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:08,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998380131] [2024-06-14 14:22:08,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:08,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:08,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:08,875 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-14 14:22:08,901 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-14 14:22:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:08,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2024-06-14 14:22:08,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:22:09,174 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-14 14:22:09,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:22:09,614 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-14 14:22:09,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998380131] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:09,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-14 14:22:09,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 13 [2024-06-14 14:22:09,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451123158] [2024-06-14 14:22:09,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:09,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:22:09,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:09,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:22:09,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-06-14 14:22:09,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-14 14:22:09,677 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-14 14:22:09,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:09,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-14 14:22:09,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:09,873 INFO L124 PetriNetUnfolderBase]: 30/117 cut-off events. [2024-06-14 14:22:09,873 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-06-14 14:22:09,874 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-14 14:22:09,874 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 23 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2024-06-14 14:22:09,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 177 flow [2024-06-14 14:22:09,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:22:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:22:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2024-06-14 14:22:09,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40540540540540543 [2024-06-14 14:22:09,877 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 94 flow. Second operand 6 states and 90 transitions. [2024-06-14 14:22:09,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 177 flow [2024-06-14 14:22:09,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 14:22:09,879 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 114 flow [2024-06-14 14:22:09,880 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-14 14:22:09,880 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2024-06-14 14:22:09,881 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 114 flow [2024-06-14 14:22:09,881 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-14 14:22:09,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:09,881 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1] [2024-06-14 14:22:09,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-14 14:22:10,092 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-14 14:22:10,095 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-14 14:22:10,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:10,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1951054387, now seen corresponding path program 1 times [2024-06-14 14:22:10,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:10,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595819458] [2024-06-14 14:22:10,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:10,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-14 14:22:10,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-14 14:22:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-14 14:22:10,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-14 14:22:10,149 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-14 14:22:10,150 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-14 14:22:10,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 14:22:10,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-06-14 14:22:10,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 14:22:10,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 14:22:10,153 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-06-14 14:22:10,156 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-14 14:22:10,156 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-06-14 14:22:10,173 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-06-14 14:22:10,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 51 transitions, 146 flow [2024-06-14 14:22:10,190 INFO L124 PetriNetUnfolderBase]: 57/283 cut-off events. [2024-06-14 14:22:10,190 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-06-14 14:22:10,192 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-14 14:22:10,192 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 51 transitions, 146 flow [2024-06-14 14:22:10,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 92 flow [2024-06-14 14:22:10,194 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:22:10,195 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;@1917b973, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:22:10,195 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 14:22:10,196 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:22:10,196 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-14 14:22:10,197 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:10,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:10,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-14 14:22:10,197 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-14 14:22:10,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:10,197 INFO L85 PathProgramCache]: Analyzing trace with hash 443253, now seen corresponding path program 1 times [2024-06-14 14:22:10,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:10,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358635882] [2024-06-14 14:22:10,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:10,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:10,212 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-14 14:22:10,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:10,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358635882] [2024-06-14 14:22:10,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358635882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:10,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:10,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:22:10,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314833164] [2024-06-14 14:22:10,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:10,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:22:10,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:10,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:22:10,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:22:10,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2024-06-14 14:22:10,220 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-14 14:22:10,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:10,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2024-06-14 14:22:10,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:10,357 INFO L124 PetriNetUnfolderBase]: 346/832 cut-off events. [2024-06-14 14:22:10,358 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-06-14 14:22:10,361 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-14 14:22:10,365 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 18 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2024-06-14 14:22:10,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 140 flow [2024-06-14 14:22:10,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:22:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:22:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-06-14 14:22:10,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5032679738562091 [2024-06-14 14:22:10,366 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 92 flow. Second operand 3 states and 77 transitions. [2024-06-14 14:22:10,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 140 flow [2024-06-14 14:22:10,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-14 14:22:10,368 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 113 flow [2024-06-14 14:22:10,368 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-14 14:22:10,368 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2024-06-14 14:22:10,369 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 113 flow [2024-06-14 14:22:10,369 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-14 14:22:10,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:10,369 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:10,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 14:22:10,370 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-14 14:22:10,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:10,370 INFO L85 PathProgramCache]: Analyzing trace with hash -113813194, now seen corresponding path program 1 times [2024-06-14 14:22:10,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:10,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081354981] [2024-06-14 14:22:10,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:10,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:10,647 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-14 14:22:10,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:10,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081354981] [2024-06-14 14:22:10,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081354981] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:10,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495151554] [2024-06-14 14:22:10,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:10,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:10,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:10,649 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-14 14:22:10,655 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-14 14:22:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:10,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-14 14:22:10,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:22:10,837 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-14 14:22:10,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:22:11,175 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-14 14:22:11,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495151554] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:11,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-14 14:22:11,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 9 [2024-06-14 14:22:11,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94845683] [2024-06-14 14:22:11,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:11,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:22:11,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:11,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:22:11,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:22:11,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2024-06-14 14:22:11,248 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-14 14:22:11,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:11,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2024-06-14 14:22:11,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:11,326 INFO L124 PetriNetUnfolderBase]: 281/719 cut-off events. [2024-06-14 14:22:11,326 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2024-06-14 14:22:11,327 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-14 14:22:11,330 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 26 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2024-06-14 14:22:11,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 195 flow [2024-06-14 14:22:11,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:22:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:22:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-06-14 14:22:11,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47549019607843135 [2024-06-14 14:22:11,331 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 113 flow. Second operand 4 states and 97 transitions. [2024-06-14 14:22:11,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 195 flow [2024-06-14 14:22:11,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:22:11,333 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 126 flow [2024-06-14 14:22:11,333 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-14 14:22:11,333 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-06-14 14:22:11,334 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 126 flow [2024-06-14 14:22:11,334 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-14 14:22:11,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:11,334 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:11,347 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-14 14:22:11,547 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-14 14:22:11,547 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-14 14:22:11,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:11,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1430467104, now seen corresponding path program 1 times [2024-06-14 14:22:11,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:11,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480178201] [2024-06-14 14:22:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:11,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:11,805 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-14 14:22:11,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:11,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480178201] [2024-06-14 14:22:11,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480178201] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:11,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343036967] [2024-06-14 14:22:11,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:11,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:11,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:11,807 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-14 14:22:11,832 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-14 14:22:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:11,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjunts are in the unsatisfiable core [2024-06-14 14:22:11,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:22:12,011 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-14 14:22:12,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:22:12,416 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-14 14:22:12,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343036967] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:12,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-14 14:22:12,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 12 [2024-06-14 14:22:12,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772612015] [2024-06-14 14:22:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:12,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:22:12,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:12,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:22:12,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-06-14 14:22:12,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 51 [2024-06-14 14:22:12,506 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-14 14:22:12,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:12,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 51 [2024-06-14 14:22:12,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:12,716 INFO L124 PetriNetUnfolderBase]: 346/776 cut-off events. [2024-06-14 14:22:12,717 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2024-06-14 14:22:12,718 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-14 14:22:12,720 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 33 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2024-06-14 14:22:12,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 246 flow [2024-06-14 14:22:12,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:22:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:22:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-06-14 14:22:12,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-14 14:22:12,721 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 126 flow. Second operand 6 states and 136 transitions. [2024-06-14 14:22:12,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 246 flow [2024-06-14 14:22:12,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 14:22:12,723 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 146 flow [2024-06-14 14:22:12,724 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-14 14:22:12,724 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2024-06-14 14:22:12,724 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 146 flow [2024-06-14 14:22:12,724 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-14 14:22:12,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:12,725 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1] [2024-06-14 14:22:12,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-06-14 14:22:12,936 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-14 14:22:12,936 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-14 14:22:12,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:12,937 INFO L85 PathProgramCache]: Analyzing trace with hash 199806883, now seen corresponding path program 1 times [2024-06-14 14:22:12,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:12,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115855406] [2024-06-14 14:22:12,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:12,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-14 14:22:12,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-14 14:22:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-14 14:22:12,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-14 14:22:12,960 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-14 14:22:12,960 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-14 14:22:12,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 14:22:12,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-06-14 14:22:12,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 14:22:12,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 14:22:12,961 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-06-14 14:22:12,962 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-14 14:22:12,962 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-06-14 14:22:12,978 INFO L144 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-06-14 14:22:12,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 65 transitions, 202 flow [2024-06-14 14:22:13,066 INFO L124 PetriNetUnfolderBase]: 336/982 cut-off events. [2024-06-14 14:22:13,066 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2024-06-14 14:22:13,068 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-14 14:22:13,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 65 transitions, 202 flow [2024-06-14 14:22:13,069 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 46 transitions, 128 flow [2024-06-14 14:22:13,070 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:22:13,070 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;@1917b973, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:22:13,071 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 14:22:13,071 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:22:13,072 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-14 14:22:13,072 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:13,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:13,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-14 14:22:13,072 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-14 14:22:13,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:13,072 INFO L85 PathProgramCache]: Analyzing trace with hash 505812, now seen corresponding path program 1 times [2024-06-14 14:22:13,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:13,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909430277] [2024-06-14 14:22:13,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:13,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:13,086 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-14 14:22:13,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:13,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909430277] [2024-06-14 14:22:13,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909430277] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:13,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:13,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:22:13,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230727542] [2024-06-14 14:22:13,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:13,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:22:13,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:13,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:22:13,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:22:13,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-06-14 14:22:13,094 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-14 14:22:13,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:13,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-06-14 14:22:13,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:13,467 INFO L124 PetriNetUnfolderBase]: 2506/4632 cut-off events. [2024-06-14 14:22:13,467 INFO L125 PetriNetUnfolderBase]: For 608/608 co-relation queries the response was YES. [2024-06-14 14:22:13,477 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-14 14:22:13,494 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 22 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2024-06-14 14:22:13,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 184 flow [2024-06-14 14:22:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:22:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:22:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-06-14 14:22:13,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076923076923077 [2024-06-14 14:22:13,496 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 128 flow. Second operand 3 states and 99 transitions. [2024-06-14 14:22:13,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 184 flow [2024-06-14 14:22:13,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 49 transitions, 180 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-14 14:22:13,498 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 145 flow [2024-06-14 14:22:13,498 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-14 14:22:13,498 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2024-06-14 14:22:13,499 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 145 flow [2024-06-14 14:22:13,499 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-14 14:22:13,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:13,499 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:13,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 14:22:13,499 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-14 14:22:13,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:13,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2050727149, now seen corresponding path program 1 times [2024-06-14 14:22:13,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:13,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412993159] [2024-06-14 14:22:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:13,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:13,758 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-14 14:22:13,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:13,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412993159] [2024-06-14 14:22:13,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412993159] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:13,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492391036] [2024-06-14 14:22:13,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:13,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:13,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:13,760 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-14 14:22:13,786 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-14 14:22:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:13,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-14 14:22:13,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:22:13,946 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-14 14:22:13,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:22:14,277 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-14 14:22:14,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492391036] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:14,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-14 14:22:14,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2024-06-14 14:22:14,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197977483] [2024-06-14 14:22:14,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:14,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:22:14,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:14,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:22:14,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:22:14,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 65 [2024-06-14 14:22:14,362 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-14 14:22:14,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:14,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 65 [2024-06-14 14:22:14,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:14,727 INFO L124 PetriNetUnfolderBase]: 2013/3915 cut-off events. [2024-06-14 14:22:14,727 INFO L125 PetriNetUnfolderBase]: For 944/944 co-relation queries the response was YES. [2024-06-14 14:22:14,738 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-14 14:22:14,753 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 32 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-06-14 14:22:14,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 248 flow [2024-06-14 14:22:14,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:22:14,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:22:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-06-14 14:22:14,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48846153846153845 [2024-06-14 14:22:14,754 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 145 flow. Second operand 4 states and 127 transitions. [2024-06-14 14:22:14,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 248 flow [2024-06-14 14:22:14,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 58 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:22:14,756 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 158 flow [2024-06-14 14:22:14,756 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-14 14:22:14,757 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 6 predicate places. [2024-06-14 14:22:14,757 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 158 flow [2024-06-14 14:22:14,757 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-14 14:22:14,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:14,757 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:14,782 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-14 14:22:14,969 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-14 14:22:14,970 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-14 14:22:14,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:14,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1238654103, now seen corresponding path program 1 times [2024-06-14 14:22:14,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:14,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407657908] [2024-06-14 14:22:14,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:14,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:15,159 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-14 14:22:15,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:15,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407657908] [2024-06-14 14:22:15,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407657908] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:15,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870203580] [2024-06-14 14:22:15,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:15,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:15,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:15,176 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-14 14:22:15,214 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-14 14:22:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:15,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-14 14:22:15,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:22:15,464 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-14 14:22:15,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:22:15,849 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-14 14:22:15,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870203580] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:15,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-14 14:22:15,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 12 [2024-06-14 14:22:15,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178850760] [2024-06-14 14:22:15,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:15,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:22:15,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:15,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:22:15,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-06-14 14:22:15,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 65 [2024-06-14 14:22:15,938 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-14 14:22:15,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:15,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 65 [2024-06-14 14:22:15,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:16,397 INFO L124 PetriNetUnfolderBase]: 2489/4362 cut-off events. [2024-06-14 14:22:16,398 INFO L125 PetriNetUnfolderBase]: For 736/736 co-relation queries the response was YES. [2024-06-14 14:22:16,410 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-14 14:22:16,425 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 32 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2024-06-14 14:22:16,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 61 transitions, 254 flow [2024-06-14 14:22:16,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:22:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:22:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-06-14 14:22:16,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-06-14 14:22:16,427 INFO L175 Difference]: Start difference. First operand has 65 places, 49 transitions, 158 flow. Second operand 5 states and 150 transitions. [2024-06-14 14:22:16,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 61 transitions, 254 flow [2024-06-14 14:22:16,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 14:22:16,429 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 175 flow [2024-06-14 14:22:16,429 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-14 14:22:16,430 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 9 predicate places. [2024-06-14 14:22:16,430 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 175 flow [2024-06-14 14:22:16,430 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-14 14:22:16,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:16,431 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2024-06-14 14:22:16,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-06-14 14:22:16,643 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-14 14:22:16,643 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-14 14:22:16,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:16,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1874875356, now seen corresponding path program 1 times [2024-06-14 14:22:16,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:16,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645943484] [2024-06-14 14:22:16,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:16,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-14 14:22:16,678 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-14 14:22:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-14 14:22:16,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-14 14:22:16,697 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-14 14:22:16,697 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-14 14:22:16,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 14:22:16,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-06-14 14:22:16,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 14:22:16,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 14:22:16,698 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-06-14 14:22:16,699 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-14 14:22:16,699 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-06-14 14:22:16,727 INFO L144 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2024-06-14 14:22:16,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 79 transitions, 262 flow [2024-06-14 14:22:16,977 INFO L124 PetriNetUnfolderBase]: 1817/3913 cut-off events. [2024-06-14 14:22:16,977 INFO L125 PetriNetUnfolderBase]: For 2144/2144 co-relation queries the response was YES. [2024-06-14 14:22:16,990 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-14 14:22:16,990 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 79 transitions, 262 flow [2024-06-14 14:22:16,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 56 transitions, 168 flow [2024-06-14 14:22:16,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:22:16,998 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;@1917b973, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:22:16,999 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 14:22:17,000 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:22:17,000 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-14 14:22:17,000 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:17,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:17,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-14 14:22:17,000 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-14 14:22:17,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:17,000 INFO L85 PathProgramCache]: Analyzing trace with hash 582273, now seen corresponding path program 1 times [2024-06-14 14:22:17,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:17,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950845316] [2024-06-14 14:22:17,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:17,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:17,016 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-14 14:22:17,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:17,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950845316] [2024-06-14 14:22:17,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950845316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:17,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:17,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:22:17,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579001763] [2024-06-14 14:22:17,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:17,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:22:17,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:17,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:22:17,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:22:17,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 79 [2024-06-14 14:22:17,024 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-14 14:22:17,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:17,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 79 [2024-06-14 14:22:17,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:19,601 INFO L124 PetriNetUnfolderBase]: 14906/23768 cut-off events. [2024-06-14 14:22:19,601 INFO L125 PetriNetUnfolderBase]: For 5056/5056 co-relation queries the response was YES. [2024-06-14 14:22:19,686 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-14 14:22:19,867 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 26 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2024-06-14 14:22:19,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 59 transitions, 232 flow [2024-06-14 14:22:19,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:22:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:22:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2024-06-14 14:22:19,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510548523206751 [2024-06-14 14:22:19,868 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 168 flow. Second operand 3 states and 121 transitions. [2024-06-14 14:22:19,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 59 transitions, 232 flow [2024-06-14 14:22:19,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 59 transitions, 220 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-14 14:22:19,873 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 177 flow [2024-06-14 14:22:19,874 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-14 14:22:19,874 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2024-06-14 14:22:19,875 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 177 flow [2024-06-14 14:22:19,875 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-14 14:22:19,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:19,875 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:19,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 14:22:19,875 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-14 14:22:19,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:19,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1030399566, now seen corresponding path program 1 times [2024-06-14 14:22:19,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:19,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124161238] [2024-06-14 14:22:19,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:19,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:20,083 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-14 14:22:20,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:20,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124161238] [2024-06-14 14:22:20,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124161238] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:20,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467139874] [2024-06-14 14:22:20,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:20,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:20,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:20,090 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-14 14:22:20,106 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-14 14:22:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:20,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-14 14:22:20,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:22:20,312 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-14 14:22:20,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:22:20,645 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-14 14:22:20,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467139874] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:20,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-14 14:22:20,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 9 [2024-06-14 14:22:20,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8238290] [2024-06-14 14:22:20,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:20,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:22:20,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:20,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:22:20,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:22:20,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2024-06-14 14:22:20,744 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-14 14:22:20,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:20,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2024-06-14 14:22:20,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:22,677 INFO L124 PetriNetUnfolderBase]: 11917/19819 cut-off events. [2024-06-14 14:22:22,677 INFO L125 PetriNetUnfolderBase]: For 5472/5472 co-relation queries the response was YES. [2024-06-14 14:22:22,733 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-14 14:22:22,801 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 38 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2024-06-14 14:22:22,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 70 transitions, 301 flow [2024-06-14 14:22:22,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:22:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:22:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2024-06-14 14:22:22,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49683544303797467 [2024-06-14 14:22:22,803 INFO L175 Difference]: Start difference. First operand has 76 places, 58 transitions, 177 flow. Second operand 4 states and 157 transitions. [2024-06-14 14:22:22,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 70 transitions, 301 flow [2024-06-14 14:22:22,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 70 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:22:22,810 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 190 flow [2024-06-14 14:22:22,811 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-14 14:22:22,811 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2024-06-14 14:22:22,811 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 190 flow [2024-06-14 14:22:22,811 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-14 14:22:22,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:22,812 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:22,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-06-14 14:22:23,023 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-14 14:22:23,023 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-14 14:22:23,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:23,023 INFO L85 PathProgramCache]: Analyzing trace with hash 205886478, now seen corresponding path program 1 times [2024-06-14 14:22:23,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:23,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009274203] [2024-06-14 14:22:23,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:23,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:23,211 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-14 14:22:23,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:23,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009274203] [2024-06-14 14:22:23,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009274203] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:23,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544932248] [2024-06-14 14:22:23,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:23,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:23,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:23,213 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-14 14:22:23,215 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-14 14:22:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:23,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2024-06-14 14:22:23,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:22:23,518 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-14 14:22:23,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:22:24,135 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-14 14:22:24,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544932248] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:24,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-14 14:22:24,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 13 [2024-06-14 14:22:24,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231412213] [2024-06-14 14:22:24,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:24,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:22:24,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:24,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:22:24,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-06-14 14:22:24,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2024-06-14 14:22:24,291 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-14 14:22:24,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:24,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2024-06-14 14:22:24,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:26,420 INFO L124 PetriNetUnfolderBase]: 14906/22778 cut-off events. [2024-06-14 14:22:26,420 INFO L125 PetriNetUnfolderBase]: For 4557/4557 co-relation queries the response was YES. [2024-06-14 14:22:26,480 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-14 14:22:26,555 INFO L140 encePairwiseOnDemand]: 72/79 looper letters, 49 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2024-06-14 14:22:26,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 84 transitions, 368 flow [2024-06-14 14:22:26,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:22:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:22:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2024-06-14 14:22:26,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47257383966244726 [2024-06-14 14:22:26,557 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 190 flow. Second operand 6 states and 224 transitions. [2024-06-14 14:22:26,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 84 transitions, 368 flow [2024-06-14 14:22:26,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 84 transitions, 365 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 14:22:26,561 INFO L231 Difference]: Finished difference. Result has 83 places, 60 transitions, 210 flow [2024-06-14 14:22:26,562 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-14 14:22:26,562 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2024-06-14 14:22:26,562 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 60 transitions, 210 flow [2024-06-14 14:22:26,562 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-14 14:22:26,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:26,563 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:26,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-06-14 14:22:26,775 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-14 14:22:26,775 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-14 14:22:26,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:26,775 INFO L85 PathProgramCache]: Analyzing trace with hash 828616886, now seen corresponding path program 1 times [2024-06-14 14:22:26,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:26,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857664540] [2024-06-14 14:22:26,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:26,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-14 14:22:26,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-14 14:22:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-14 14:22:26,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-14 14:22:26,799 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-14 14:22:26,799 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-14 14:22:26,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 14:22:26,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-06-14 14:22:26,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 14:22:26,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 14:22:26,804 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-06-14 14:22:26,804 WARN L234 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-14 14:22:26,804 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-06-14 14:22:26,824 INFO L144 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2024-06-14 14:22:26,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 93 transitions, 326 flow [2024-06-14 14:22:28,907 INFO L124 PetriNetUnfolderBase]: 9252/16852 cut-off events. [2024-06-14 14:22:28,907 INFO L125 PetriNetUnfolderBase]: For 10450/10450 co-relation queries the response was YES. [2024-06-14 14:22:28,962 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-14 14:22:28,962 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 93 transitions, 326 flow [2024-06-14 14:22:28,970 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 66 transitions, 212 flow [2024-06-14 14:22:28,971 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:22:28,972 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;@1917b973, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:22:28,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 14:22:28,973 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:22:28,973 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-14 14:22:28,973 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:28,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:28,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-14 14:22:28,974 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-14 14:22:28,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:28,974 INFO L85 PathProgramCache]: Analyzing trace with hash 672636, now seen corresponding path program 1 times [2024-06-14 14:22:28,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:28,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203216492] [2024-06-14 14:22:28,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:28,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:28,993 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-14 14:22:28,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:28,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203216492] [2024-06-14 14:22:28,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203216492] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:28,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:28,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:22:28,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554176694] [2024-06-14 14:22:28,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:28,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:22:28,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:28,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:22:28,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:22:29,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 93 [2024-06-14 14:22:29,002 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-14 14:22:29,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:29,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 93 [2024-06-14 14:22:29,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:43,793 INFO L124 PetriNetUnfolderBase]: 79802/115960 cut-off events. [2024-06-14 14:22:43,793 INFO L125 PetriNetUnfolderBase]: For 34688/34688 co-relation queries the response was YES. [2024-06-14 14:22:44,703 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-14 14:22:45,550 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 30 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2024-06-14 14:22:45,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 69 transitions, 284 flow [2024-06-14 14:22:45,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:22:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:22:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2024-06-14 14:22:45,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125448028673835 [2024-06-14 14:22:45,552 INFO L175 Difference]: Start difference. First operand has 87 places, 66 transitions, 212 flow. Second operand 3 states and 143 transitions. [2024-06-14 14:22:45,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 69 transitions, 284 flow [2024-06-14 14:22:45,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 69 transitions, 260 flow, removed 12 selfloop flow, removed 0 redundant places. [2024-06-14 14:22:45,580 INFO L231 Difference]: Finished difference. Result has 90 places, 68 transitions, 209 flow [2024-06-14 14:22:45,580 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-14 14:22:45,581 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 3 predicate places. [2024-06-14 14:22:45,581 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 68 transitions, 209 flow [2024-06-14 14:22:45,581 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-14 14:22:45,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:45,581 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:45,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 14:22:45,582 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-14 14:22:45,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:45,582 INFO L85 PathProgramCache]: Analyzing trace with hash -767258747, now seen corresponding path program 1 times [2024-06-14 14:22:45,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:45,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035314337] [2024-06-14 14:22:45,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:45,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:45,847 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-14 14:22:45,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:45,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035314337] [2024-06-14 14:22:45,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035314337] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:45,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629189228] [2024-06-14 14:22:45,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:45,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:22:45,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:45,849 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-14 14:22:45,850 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-14 14:22:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:45,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-14 14:22:45,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:22:46,108 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-14 14:22:46,108 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:22:46,415 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-14 14:22:46,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629189228] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-14 14:22:46,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-14 14:22:46,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 9 [2024-06-14 14:22:46,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184781987] [2024-06-14 14:22:46,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:46,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:22:46,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:46,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:22:46,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:22:46,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 93 [2024-06-14 14:22:46,615 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-14 14:22:46,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:46,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 93 [2024-06-14 14:22:46,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand