./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/reorder_5.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_5.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread/reorder_5.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/reorder_5.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 16:29:39,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 16:29:39,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 16:29:39,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 16:29:39,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 16:29:39,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 16:29:39,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 16:29:39,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 16:29:39,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 16:29:39,509 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 16:29:39,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 16:29:39,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 16:29:39,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 16:29:39,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 16:29:39,512 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 16:29:39,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 16:29:39,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 16:29:39,512 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 16:29:39,513 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 16:29:39,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 16:29:39,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 16:29:39,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 16:29:39,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 16:29:39,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 16:29:39,515 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 16:29:39,515 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 16:29:39,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 16:29:39,515 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 16:29:39,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 16:29:39,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 16:29:39,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 16:29:39,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 16:29:39,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:29:39,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 16:29:39,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 16:29:39,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 16:29:39,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 16:29:39,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 16:29:39,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 16:29:39,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 16:29:39,520 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 16:29:39,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 16:29:39,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 16:29:39,521 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 16:29:39,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 16:29:39,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 16:29:39,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 16:29:39,816 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 16:29:39,816 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 16:29:39,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/reorder_5.i [2024-06-04 16:29:41,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 16:29:41,494 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 16:29:41,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/reorder_5.i [2024-06-04 16:29:41,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa2f87bd8/3f1fad0ee41148f98a354737c9cac06f/FLAG6386207fd [2024-06-04 16:29:41,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa2f87bd8/3f1fad0ee41148f98a354737c9cac06f [2024-06-04 16:29:41,579 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 16:29:41,588 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 16:29:41,591 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_5.yml/witness.yml [2024-06-04 16:29:41,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 16:29:41,776 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 16:29:41,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 16:29:41,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 16:29:41,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 16:29:41,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:29:41" (1/2) ... [2024-06-04 16:29:41,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534d7475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:29:41, skipping insertion in model container [2024-06-04 16:29:41,784 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:29:41" (1/2) ... [2024-06-04 16:29:41,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6ac1ee16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:29:41, skipping insertion in model container [2024-06-04 16:29:41,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:29:41" (2/2) ... [2024-06-04 16:29:41,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534d7475 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:41, skipping insertion in model container [2024-06-04 16:29:41,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:29:41" (2/2) ... [2024-06-04 16:29:41,786 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 16:29:41,856 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 16:29:41,858 INFO L97 edCorrectnessWitness]: Location invariant before [L1255-L1258] ((((((((((! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL)) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL)) [2024-06-04 16:29:41,858 INFO L97 edCorrectnessWitness]: Location invariant before [L1261-L1265] ((((((((((! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL)) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((1LL + (long long )a) + (long long )b >= 0LL && (2147483647LL + (long long )iCheck) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iSet >= 0LL) && (2147483648LL + (long long )a) + (long long )iCheck >= 0LL) && (2147483649LL + (long long )b) + (long long )iSet >= 0LL) && (2147483649LL + (long long )b) + (long long )iCheck >= 0LL) && (2LL - (long long )a) + (long long )b >= 0LL) && (2147483648LL - (long long )b) + (long long )iSet >= 0LL) && (2147483648LL - (long long )b) + (long long )iCheck >= 0LL) && (2147483649LL - (long long )a) + (long long )iSet >= 0LL) && (2147483649LL - (long long )a) + (long long )iCheck >= 0LL) && (2147583648LL - (long long )iCheck) + (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iSet >= 0LL) && (100000LL + (long long )a) - (long long )iCheck >= 0LL) && (100001LL + (long long )b) - (long long )iSet >= 0LL) && (100001LL + (long long )b) - (long long )iCheck >= 0LL) && (2147583648LL + (long long )iCheck) - (long long )iSet >= 0LL) && (1LL - (long long )a) - (long long )b >= 0LL) && (100000LL - (long long )b) - (long long )iSet >= 0LL) && (100000LL - (long long )b) - (long long )iCheck >= 0LL) && (100001LL - (long long )a) - (long long )iSet >= 0LL) && (100001LL - (long long )a) - (long long )iCheck >= 0LL) && (200000LL - (long long )iCheck) - (long long )iSet >= 0LL) && (long long )a - (long long )b >= 0LL)) [2024-06-04 16:29:41,858 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 16:29:41,859 INFO L106 edCorrectnessWitness]: ghost_update [L1261-L1262] multithreaded = 1; [2024-06-04 16:29:41,859 INFO L106 edCorrectnessWitness]: ghost_update [L1255-L1255] multithreaded = 1; [2024-06-04 16:29:41,917 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 16:29:42,374 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:29:42,382 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 16:29:42,661 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:29:42,727 INFO L206 MainTranslator]: Completed translation [2024-06-04 16:29:42,727 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:42 WrapperNode [2024-06-04 16:29:42,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 16:29:42,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 16:29:42,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 16:29:42,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 16:29:42,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:42" (1/1) ... [2024-06-04 16:29:42,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:42" (1/1) ... [2024-06-04 16:29:42,843 INFO L138 Inliner]: procedures = 371, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 144 [2024-06-04 16:29:42,844 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 16:29:42,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 16:29:42,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 16:29:42,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 16:29:42,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:42" (1/1) ... [2024-06-04 16:29:42,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:42" (1/1) ... [2024-06-04 16:29:42,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:42" (1/1) ... [2024-06-04 16:29:42,900 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-06-04 16:29:42,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:42" (1/1) ... [2024-06-04 16:29:42,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:42" (1/1) ... [2024-06-04 16:29:42,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:42" (1/1) ... [2024-06-04 16:29:42,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:42" (1/1) ... [2024-06-04 16:29:42,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:42" (1/1) ... [2024-06-04 16:29:42,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:42" (1/1) ... [2024-06-04 16:29:42,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 16:29:42,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 16:29:42,961 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 16:29:42,961 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 16:29:42,962 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:42" (1/1) ... [2024-06-04 16:29:42,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:29:42,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:29:42,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 16:29:43,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 16:29:43,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 16:29:43,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-06-04 16:29:43,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-06-04 16:29:43,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 16:29:43,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-04 16:29:43,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-04 16:29:43,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-04 16:29:43,039 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2024-06-04 16:29:43,039 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2024-06-04 16:29:43,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-04 16:29:43,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-04 16:29:43,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-04 16:29:43,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 16:29:43,041 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2024-06-04 16:29:43,042 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2024-06-04 16:29:43,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 16:29:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-04 16:29:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-04 16:29:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 16:29:43,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 16:29:43,046 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 16:29:43,208 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 16:29:43,210 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 16:29:43,556 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 16:29:43,557 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 16:29:43,719 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 16:29:43,719 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-04 16:29:43,720 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:29:43 BoogieIcfgContainer [2024-06-04 16:29:43,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 16:29:43,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 16:29:43,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 16:29:43,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 16:29:43,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 04:29:41" (1/4) ... [2024-06-04 16:29:43,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcd53ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:29:43, skipping insertion in model container [2024-06-04 16:29:43,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:29:41" (2/4) ... [2024-06-04 16:29:43,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcd53ba and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:29:43, skipping insertion in model container [2024-06-04 16:29:43,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:29:42" (3/4) ... [2024-06-04 16:29:43,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcd53ba and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:29:43, skipping insertion in model container [2024-06-04 16:29:43,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:29:43" (4/4) ... [2024-06-04 16:29:43,730 INFO L112 eAbstractionObserver]: Analyzing ICFG reorder_5.i [2024-06-04 16:29:43,746 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 16:29:43,747 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 16:29:43,747 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 16:29:43,792 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-04 16:29:43,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 37 transitions, 94 flow [2024-06-04 16:29:43,875 INFO L124 PetriNetUnfolderBase]: 8/88 cut-off events. [2024-06-04 16:29:43,875 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-06-04 16:29:43,878 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 338 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2024-06-04 16:29:43,879 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 37 transitions, 94 flow [2024-06-04 16:29:43,883 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 26 transitions, 60 flow [2024-06-04 16:29:43,897 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:29:43,908 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;@367ec7ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:29:43,908 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 16:29:43,913 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:29:43,914 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-04 16:29:43,914 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:29:43,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:43,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-04 16:29:43,915 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:43,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:43,921 INFO L85 PathProgramCache]: Analyzing trace with hash 380532, now seen corresponding path program 1 times [2024-06-04 16:29:43,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:43,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330374583] [2024-06-04 16:29:43,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:43,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:44,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:44,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:44,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330374583] [2024-06-04 16:29:44,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330374583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:29:44,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:29:44,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:29:44,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238842615] [2024-06-04 16:29:44,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:44,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:29:44,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:44,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:29:44,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:29:44,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-04 16:29:44,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:44,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:44,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-04 16:29:44,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:44,324 INFO L124 PetriNetUnfolderBase]: 30/128 cut-off events. [2024-06-04 16:29:44,324 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:29:44,325 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 579 event pairs, 30 based on Foata normal form. 2/121 useless extension candidates. Maximal degree in co-relation 159. Up to 83 conditions per place. [2024-06-04 16:29:44,326 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 14 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-04 16:29:44,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 100 flow [2024-06-04 16:29:44,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:29:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:29:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2024-06-04 16:29:44,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-06-04 16:29:44,339 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 60 flow. Second operand 3 states and 55 transitions. [2024-06-04 16:29:44,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 100 flow [2024-06-04 16:29:44,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-04 16:29:44,343 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 81 flow [2024-06-04 16:29:44,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2024-06-04 16:29:44,347 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2024-06-04 16:29:44,347 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 81 flow [2024-06-04 16:29:44,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:44,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:44,348 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:29:44,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 16:29:44,348 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:44,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:44,349 INFO L85 PathProgramCache]: Analyzing trace with hash 70222154, now seen corresponding path program 1 times [2024-06-04 16:29:44,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:44,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95206502] [2024-06-04 16:29:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:44,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:45,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:45,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95206502] [2024-06-04 16:29:45,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95206502] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:45,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926485831] [2024-06-04 16:29:45,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:45,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:45,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:29:45,122 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:29:45,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-04 16:29:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:45,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-04 16:29:45,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:29:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:45,523 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:29:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:46,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926485831] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:46,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-04 16:29:46,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 9 [2024-06-04 16:29:46,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311863347] [2024-06-04 16:29:46,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:46,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:29:46,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:46,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:29:46,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:29:46,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-04 16:29:46,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:46,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:46,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-04 16:29:46,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:46,261 INFO L124 PetriNetUnfolderBase]: 25/115 cut-off events. [2024-06-04 16:29:46,262 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-06-04 16:29:46,263 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 487 event pairs, 25 based on Foata normal form. 8/113 useless extension candidates. Maximal degree in co-relation 151. Up to 56 conditions per place. [2024-06-04 16:29:46,270 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 20 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2024-06-04 16:29:46,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 34 transitions, 142 flow [2024-06-04 16:29:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:29:46,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:29:46,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2024-06-04 16:29:46,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527027027027027 [2024-06-04 16:29:46,274 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 81 flow. Second operand 4 states and 67 transitions. [2024-06-04 16:29:46,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 34 transitions, 142 flow [2024-06-04 16:29:46,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 139 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:29:46,277 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 94 flow [2024-06-04 16:29:46,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-06-04 16:29:46,278 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2024-06-04 16:29:46,278 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 94 flow [2024-06-04 16:29:46,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:46,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:46,278 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:29:46,299 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-04 16:29:46,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:46,500 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:46,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:46,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1059925663, now seen corresponding path program 1 times [2024-06-04 16:29:46,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:46,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531189955] [2024-06-04 16:29:46,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:46,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:46,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:46,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531189955] [2024-06-04 16:29:46,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531189955] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:46,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980543152] [2024-06-04 16:29:46,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:46,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:46,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:29:46,867 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:29:46,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-04 16:29:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:46,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-04 16:29:46,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:29:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:47,139 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:29:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:47,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980543152] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:47,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-04 16:29:47,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 11 [2024-06-04 16:29:47,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830057200] [2024-06-04 16:29:47,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:47,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:29:47,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:47,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:29:47,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:29:47,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-04 16:29:47,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:47,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:47,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-04 16:29:47,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:47,959 INFO L124 PetriNetUnfolderBase]: 29/114 cut-off events. [2024-06-04 16:29:47,960 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-06-04 16:29:47,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 114 events. 29/114 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 487 event pairs, 14 based on Foata normal form. 2/114 useless extension candidates. Maximal degree in co-relation 169. Up to 33 conditions per place. [2024-06-04 16:29:47,961 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 18 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-04 16:29:47,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 150 flow [2024-06-04 16:29:47,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:29:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:29:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2024-06-04 16:29:47,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41081081081081083 [2024-06-04 16:29:47,963 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 94 flow. Second operand 5 states and 76 transitions. [2024-06-04 16:29:47,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 150 flow [2024-06-04 16:29:47,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 147 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 16:29:47,965 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 104 flow [2024-06-04 16:29:47,965 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2024-06-04 16:29:47,965 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2024-06-04 16:29:47,966 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 104 flow [2024-06-04 16:29:47,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:47,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:47,966 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1] [2024-06-04 16:29:47,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-04 16:29:48,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-06-04 16:29:48,184 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:48,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:48,185 INFO L85 PathProgramCache]: Analyzing trace with hash 339495046, now seen corresponding path program 1 times [2024-06-04 16:29:48,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:48,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028784141] [2024-06-04 16:29:48,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:48,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 16:29:48,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-04 16:29:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 16:29:48,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-04 16:29:48,251 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-04 16:29:48,252 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-04 16:29:48,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-04 16:29:48,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-06-04 16:29:48,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-04 16:29:48,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 16:29:48,255 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-06-04 16:29:48,257 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-04 16:29:48,257 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-06-04 16:29:48,275 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-06-04 16:29:48,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 51 transitions, 146 flow [2024-06-04 16:29:48,299 INFO L124 PetriNetUnfolderBase]: 57/283 cut-off events. [2024-06-04 16:29:48,299 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-06-04 16:29:48,300 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 18. Compared 1359 event pairs, 2 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 191. Up to 32 conditions per place. [2024-06-04 16:29:48,300 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 51 transitions, 146 flow [2024-06-04 16:29:48,301 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 92 flow [2024-06-04 16:29:48,302 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:29:48,303 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;@367ec7ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:29:48,303 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 16:29:48,304 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:29:48,304 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-04 16:29:48,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:29:48,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:48,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-04 16:29:48,305 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:48,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:48,306 INFO L85 PathProgramCache]: Analyzing trace with hash 429189, now seen corresponding path program 1 times [2024-06-04 16:29:48,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:48,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839120454] [2024-06-04 16:29:48,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:48,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:48,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:48,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839120454] [2024-06-04 16:29:48,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839120454] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:29:48,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:29:48,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:29:48,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61832517] [2024-06-04 16:29:48,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:48,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:29:48,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:48,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:29:48,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:29:48,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2024-06-04 16:29:48,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:48,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:48,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2024-06-04 16:29:48,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:48,439 INFO L124 PetriNetUnfolderBase]: 346/832 cut-off events. [2024-06-04 16:29:48,440 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-06-04 16:29:48,442 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 5559 event pairs, 346 based on Foata normal form. 2/783 useless extension candidates. Maximal degree in co-relation 612. Up to 615 conditions per place. [2024-06-04 16:29:48,446 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 18 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2024-06-04 16:29:48,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 140 flow [2024-06-04 16:29:48,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:29:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:29:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-06-04 16:29:48,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5032679738562091 [2024-06-04 16:29:48,448 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 92 flow. Second operand 3 states and 77 transitions. [2024-06-04 16:29:48,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 140 flow [2024-06-04 16:29:48,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-04 16:29:48,450 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 113 flow [2024-06-04 16:29:48,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-06-04 16:29:48,451 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2024-06-04 16:29:48,451 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 113 flow [2024-06-04 16:29:48,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:48,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:48,452 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:29:48,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 16:29:48,452 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:48,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:48,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1109505037, now seen corresponding path program 1 times [2024-06-04 16:29:48,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:48,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083412931] [2024-06-04 16:29:48,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:48,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:48,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:48,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083412931] [2024-06-04 16:29:48,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083412931] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:48,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706243723] [2024-06-04 16:29:48,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:48,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:48,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:29:48,817 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:29:48,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-04 16:29:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:48,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-04 16:29:48,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:29:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:49,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:29:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:49,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706243723] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:49,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-04 16:29:49,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 9 [2024-06-04 16:29:49,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465520110] [2024-06-04 16:29:49,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:49,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:29:49,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:49,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:29:49,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:29:49,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2024-06-04 16:29:49,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:49,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:49,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2024-06-04 16:29:49,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:49,683 INFO L124 PetriNetUnfolderBase]: 281/719 cut-off events. [2024-06-04 16:29:49,683 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2024-06-04 16:29:49,685 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 4623 event pairs, 281 based on Foata normal form. 48/727 useless extension candidates. Maximal degree in co-relation 1189. Up to 454 conditions per place. [2024-06-04 16:29:49,688 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 26 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2024-06-04 16:29:49,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 195 flow [2024-06-04 16:29:49,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:29:49,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:29:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-06-04 16:29:49,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47549019607843135 [2024-06-04 16:29:49,691 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 113 flow. Second operand 4 states and 97 transitions. [2024-06-04 16:29:49,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 195 flow [2024-06-04 16:29:49,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:29:49,693 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 126 flow [2024-06-04 16:29:49,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2024-06-04 16:29:49,694 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-06-04 16:29:49,694 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 126 flow [2024-06-04 16:29:49,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:49,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:49,695 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:29:49,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-04 16:29:49,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:49,909 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:49,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:49,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1016117080, now seen corresponding path program 1 times [2024-06-04 16:29:49,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:49,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879193325] [2024-06-04 16:29:49,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:49,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:50,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:50,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:50,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879193325] [2024-06-04 16:29:50,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879193325] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:50,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569939603] [2024-06-04 16:29:50,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:50,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:50,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:29:50,219 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:29:50,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-04 16:29:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:50,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2024-06-04 16:29:50,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:29:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:50,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:29:50,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:50,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569939603] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:50,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-04 16:29:50,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 12 [2024-06-04 16:29:50,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618414884] [2024-06-04 16:29:50,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:50,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:29:50,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:50,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:29:50,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-06-04 16:29:51,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 51 [2024-06-04 16:29:51,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:51,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:51,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 51 [2024-06-04 16:29:51,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:51,342 INFO L124 PetriNetUnfolderBase]: 346/776 cut-off events. [2024-06-04 16:29:51,342 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2024-06-04 16:29:51,345 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 4988 event pairs, 323 based on Foata normal form. 6/732 useless extension candidates. Maximal degree in co-relation 1375. Up to 507 conditions per place. [2024-06-04 16:29:51,349 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 33 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2024-06-04 16:29:51,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 246 flow [2024-06-04 16:29:51,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:29:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:29:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-06-04 16:29:51,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-04 16:29:51,351 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 126 flow. Second operand 6 states and 136 transitions. [2024-06-04 16:29:51,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 246 flow [2024-06-04 16:29:51,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 16:29:51,353 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 146 flow [2024-06-04 16:29:51,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2024-06-04 16:29:51,354 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2024-06-04 16:29:51,354 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 146 flow [2024-06-04 16:29:51,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:51,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:51,355 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1] [2024-06-04 16:29:51,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-04 16:29:51,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:51,570 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:51,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash 198362857, now seen corresponding path program 1 times [2024-06-04 16:29:51,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:51,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868890204] [2024-06-04 16:29:51,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:51,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 16:29:51,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-04 16:29:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 16:29:51,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-04 16:29:51,622 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-04 16:29:51,623 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-04 16:29:51,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-04 16:29:51,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-06-04 16:29:51,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-04 16:29:51,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 16:29:51,623 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-06-04 16:29:51,624 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-04 16:29:51,624 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-06-04 16:29:51,644 INFO L144 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-06-04 16:29:51,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 65 transitions, 202 flow [2024-06-04 16:29:51,745 INFO L124 PetriNetUnfolderBase]: 336/982 cut-off events. [2024-06-04 16:29:51,746 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2024-06-04 16:29:51,749 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 40. Compared 5466 event pairs, 32 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 705. Up to 192 conditions per place. [2024-06-04 16:29:51,749 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 65 transitions, 202 flow [2024-06-04 16:29:51,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 46 transitions, 128 flow [2024-06-04 16:29:51,753 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:29:51,754 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;@367ec7ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:29:51,754 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 16:29:51,755 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:29:51,755 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-04 16:29:51,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:29:51,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:51,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-04 16:29:51,756 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:51,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:51,756 INFO L85 PathProgramCache]: Analyzing trace with hash 491748, now seen corresponding path program 1 times [2024-06-04 16:29:51,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:51,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193123299] [2024-06-04 16:29:51,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:51,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:51,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:51,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193123299] [2024-06-04 16:29:51,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193123299] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:29:51,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:29:51,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:29:51,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504670659] [2024-06-04 16:29:51,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:51,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:29:51,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:51,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:29:51,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:29:51,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-06-04 16:29:51,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:51,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:51,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-06-04 16:29:51,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:52,314 INFO L124 PetriNetUnfolderBase]: 2506/4632 cut-off events. [2024-06-04 16:29:52,315 INFO L125 PetriNetUnfolderBase]: For 608/608 co-relation queries the response was YES. [2024-06-04 16:29:52,329 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 34488 event pairs, 2506 based on Foata normal form. 2/4403 useless extension candidates. Maximal degree in co-relation 3684. Up to 3687 conditions per place. [2024-06-04 16:29:52,354 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 22 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2024-06-04 16:29:52,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 184 flow [2024-06-04 16:29:52,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:29:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:29:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-06-04 16:29:52,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076923076923077 [2024-06-04 16:29:52,357 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 128 flow. Second operand 3 states and 99 transitions. [2024-06-04 16:29:52,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 184 flow [2024-06-04 16:29:52,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 49 transitions, 180 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-04 16:29:52,361 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 145 flow [2024-06-04 16:29:52,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2024-06-04 16:29:52,363 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2024-06-04 16:29:52,363 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 145 flow [2024-06-04 16:29:52,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:52,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:52,363 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:29:52,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 16:29:52,364 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:52,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1055035306, now seen corresponding path program 1 times [2024-06-04 16:29:52,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:52,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727874338] [2024-06-04 16:29:52,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:52,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:52,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:52,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727874338] [2024-06-04 16:29:52,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727874338] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:52,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307101263] [2024-06-04 16:29:52,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:52,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:52,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:29:52,685 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:29:52,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-06-04 16:29:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:52,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-04 16:29:52,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:29:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:52,936 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:29:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:53,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307101263] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:53,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-04 16:29:53,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 9 [2024-06-04 16:29:53,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162864600] [2024-06-04 16:29:53,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:53,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:29:53,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:53,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:29:53,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:29:53,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 65 [2024-06-04 16:29:53,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:53,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:53,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 65 [2024-06-04 16:29:53,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:53,927 INFO L124 PetriNetUnfolderBase]: 2013/3915 cut-off events. [2024-06-04 16:29:53,927 INFO L125 PetriNetUnfolderBase]: For 944/944 co-relation queries the response was YES. [2024-06-04 16:29:53,939 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 28833 event pairs, 2013 based on Foata normal form. 224/3991 useless extension candidates. Maximal degree in co-relation 7057. Up to 2834 conditions per place. [2024-06-04 16:29:53,958 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 32 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-06-04 16:29:53,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 248 flow [2024-06-04 16:29:53,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:29:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:29:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-06-04 16:29:53,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48846153846153845 [2024-06-04 16:29:53,960 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 145 flow. Second operand 4 states and 127 transitions. [2024-06-04 16:29:53,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 248 flow [2024-06-04 16:29:53,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 58 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:29:53,964 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 158 flow [2024-06-04 16:29:53,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2024-06-04 16:29:53,966 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 6 predicate places. [2024-06-04 16:29:53,967 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 158 flow [2024-06-04 16:29:53,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:53,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:53,967 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:29:53,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-06-04 16:29:54,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-06-04 16:29:54,180 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:54,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:54,181 INFO L85 PathProgramCache]: Analyzing trace with hash -609729009, now seen corresponding path program 1 times [2024-06-04 16:29:54,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:54,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344723916] [2024-06-04 16:29:54,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:54,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:54,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:54,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:54,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344723916] [2024-06-04 16:29:54,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344723916] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:54,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918144731] [2024-06-04 16:29:54,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:54,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:54,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:29:54,440 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:29:54,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-06-04 16:29:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:54,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-04 16:29:54,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:29:54,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:54,703 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:29:55,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:55,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918144731] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-04 16:29:55,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-04 16:29:55,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 11 [2024-06-04 16:29:55,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900921943] [2024-06-04 16:29:55,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:55,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:29:55,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:55,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:29:55,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:29:55,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 65 [2024-06-04 16:29:55,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 49 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:55,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:55,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 65 [2024-06-04 16:29:55,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:55,839 INFO L124 PetriNetUnfolderBase]: 2489/4346 cut-off events. [2024-06-04 16:29:55,840 INFO L125 PetriNetUnfolderBase]: For 740/740 co-relation queries the response was YES. [2024-06-04 16:29:55,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8610 conditions, 4346 events. 2489/4346 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 30585 event pairs, 1253 based on Foata normal form. 14/4168 useless extension candidates. Maximal degree in co-relation 8207. Up to 3267 conditions per place. [2024-06-04 16:29:55,872 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 32 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2024-06-04 16:29:55,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 61 transitions, 254 flow [2024-06-04 16:29:55,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:29:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:29:55,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-06-04 16:29:55,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-06-04 16:29:55,874 INFO L175 Difference]: Start difference. First operand has 65 places, 49 transitions, 158 flow. Second operand 5 states and 150 transitions. [2024-06-04 16:29:55,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 61 transitions, 254 flow [2024-06-04 16:29:55,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 16:29:55,877 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 175 flow [2024-06-04 16:29:55,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2024-06-04 16:29:55,877 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 9 predicate places. [2024-06-04 16:29:55,877 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 175 flow [2024-06-04 16:29:55,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:55,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:55,878 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2024-06-04 16:29:55,896 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-04 16:29:56,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:29:56,093 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:56,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:56,094 INFO L85 PathProgramCache]: Analyzing trace with hash -725726691, now seen corresponding path program 1 times [2024-06-04 16:29:56,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:56,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033741784] [2024-06-04 16:29:56,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:56,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 16:29:56,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-04 16:29:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 16:29:56,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-04 16:29:56,143 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-04 16:29:56,144 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-04 16:29:56,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-04 16:29:56,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-06-04 16:29:56,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-04 16:29:56,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 16:29:56,145 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-06-04 16:29:56,145 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-04 16:29:56,146 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-06-04 16:29:56,178 INFO L144 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2024-06-04 16:29:56,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 79 transitions, 262 flow [2024-06-04 16:29:56,510 INFO L124 PetriNetUnfolderBase]: 1817/3913 cut-off events. [2024-06-04 16:29:56,510 INFO L125 PetriNetUnfolderBase]: For 2144/2144 co-relation queries the response was YES. [2024-06-04 16:29:56,526 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 118. Compared 24919 event pairs, 313 based on Foata normal form. 0/3341 useless extension candidates. Maximal degree in co-relation 2890. Up to 1024 conditions per place. [2024-06-04 16:29:56,526 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 79 transitions, 262 flow [2024-06-04 16:29:56,535 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 56 transitions, 168 flow [2024-06-04 16:29:56,536 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:29:56,536 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;@367ec7ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:29:56,536 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 16:29:56,537 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:29:56,537 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-04 16:29:56,538 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:29:56,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:56,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-04 16:29:56,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:56,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:56,538 INFO L85 PathProgramCache]: Analyzing trace with hash 568209, now seen corresponding path program 1 times [2024-06-04 16:29:56,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:56,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801868325] [2024-06-04 16:29:56,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:56,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:29:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:29:56,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:29:56,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801868325] [2024-06-04 16:29:56,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801868325] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:29:56,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:29:56,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:29:56,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784484893] [2024-06-04 16:29:56,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:29:56,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:29:56,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:29:56,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:29:56,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:29:56,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 79 [2024-06-04 16:29:56,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:56,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:29:56,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 79 [2024-06-04 16:29:56,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:29:59,556 INFO L124 PetriNetUnfolderBase]: 14906/23768 cut-off events. [2024-06-04 16:29:59,556 INFO L125 PetriNetUnfolderBase]: For 5056/5056 co-relation queries the response was YES. [2024-06-04 16:29:59,637 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 184609 event pairs, 14906 based on Foata normal form. 2/22795 useless extension candidates. Maximal degree in co-relation 19955. Up to 19831 conditions per place. [2024-06-04 16:29:59,747 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 26 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2024-06-04 16:29:59,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 59 transitions, 232 flow [2024-06-04 16:29:59,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:29:59,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:29:59,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2024-06-04 16:29:59,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510548523206751 [2024-06-04 16:29:59,749 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 168 flow. Second operand 3 states and 121 transitions. [2024-06-04 16:29:59,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 59 transitions, 232 flow [2024-06-04 16:29:59,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 59 transitions, 220 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-04 16:29:59,759 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 177 flow [2024-06-04 16:29:59,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2024-06-04 16:29:59,760 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2024-06-04 16:29:59,760 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 177 flow [2024-06-04 16:29:59,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:29:59,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:29:59,761 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:29:59,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 16:29:59,761 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:29:59,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:29:59,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2026091409, now seen corresponding path program 1 times [2024-06-04 16:29:59,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:29:59,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905996995] [2024-06-04 16:29:59,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:29:59,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:29:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:00,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:00,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905996995] [2024-06-04 16:30:00,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905996995] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:30:00,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237645157] [2024-06-04 16:30:00,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:00,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:30:00,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:30:00,135 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:30:00,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-06-04 16:30:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:00,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-04 16:30:00,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:30:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:00,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:30:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:00,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237645157] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-04 16:30:00,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-04 16:30:00,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 9 [2024-06-04 16:30:00,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309632049] [2024-06-04 16:30:00,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:00,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:30:00,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:00,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:30:00,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:30:00,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2024-06-04 16:30:00,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 58 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:00,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:00,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2024-06-04 16:30:00,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:03,090 INFO L124 PetriNetUnfolderBase]: 11917/19819 cut-off events. [2024-06-04 16:30:03,090 INFO L125 PetriNetUnfolderBase]: For 5472/5472 co-relation queries the response was YES. [2024-06-04 16:30:03,148 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 156678 event pairs, 11917 based on Foata normal form. 960/20223 useless extension candidates. Maximal degree in co-relation 37161. Up to 15530 conditions per place. [2024-06-04 16:30:03,237 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 38 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2024-06-04 16:30:03,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 70 transitions, 301 flow [2024-06-04 16:30:03,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:30:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:30:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2024-06-04 16:30:03,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49683544303797467 [2024-06-04 16:30:03,239 INFO L175 Difference]: Start difference. First operand has 76 places, 58 transitions, 177 flow. Second operand 4 states and 157 transitions. [2024-06-04 16:30:03,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 70 transitions, 301 flow [2024-06-04 16:30:03,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 70 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:30:03,245 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 190 flow [2024-06-04 16:30:03,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=79, PETRI_TRANSITIONS=59} [2024-06-04 16:30:03,246 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2024-06-04 16:30:03,246 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 190 flow [2024-06-04 16:30:03,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:03,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:03,247 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:03,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-06-04 16:30:03,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:30:03,462 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:30:03,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:03,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1642496634, now seen corresponding path program 1 times [2024-06-04 16:30:03,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:03,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170629738] [2024-06-04 16:30:03,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:03,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:03,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:03,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170629738] [2024-06-04 16:30:03,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170629738] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:30:03,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545906405] [2024-06-04 16:30:03,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:03,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:30:03,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:30:03,751 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:30:03,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-06-04 16:30:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:03,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-04 16:30:03,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:30:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:04,043 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:30:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:04,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545906405] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-04 16:30:04,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-04 16:30:04,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 11 [2024-06-04 16:30:04,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940158367] [2024-06-04 16:30:04,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:04,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:30:04,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:04,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:30:04,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:30:04,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2024-06-04 16:30:04,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:04,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:04,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2024-06-04 16:30:04,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:06,934 INFO L124 PetriNetUnfolderBase]: 14857/22610 cut-off events. [2024-06-04 16:30:06,935 INFO L125 PetriNetUnfolderBase]: For 4566/4566 co-relation queries the response was YES. [2024-06-04 16:30:07,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44844 conditions, 22610 events. 14857/22610 cut-off events. For 4566/4566 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 165923 event pairs, 7517 based on Foata normal form. 30/21753 useless extension candidates. Maximal degree in co-relation 43887. Up to 18779 conditions per place. [2024-06-04 16:30:07,180 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 38 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2024-06-04 16:30:07,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 73 transitions, 302 flow [2024-06-04 16:30:07,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:30:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:30:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 186 transitions. [2024-06-04 16:30:07,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4708860759493671 [2024-06-04 16:30:07,197 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 190 flow. Second operand 5 states and 186 transitions. [2024-06-04 16:30:07,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 73 transitions, 302 flow [2024-06-04 16:30:07,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 73 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 16:30:07,205 INFO L231 Difference]: Finished difference. Result has 82 places, 60 transitions, 207 flow [2024-06-04 16:30:07,205 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=82, PETRI_TRANSITIONS=60} [2024-06-04 16:30:07,206 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 9 predicate places. [2024-06-04 16:30:07,206 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 60 transitions, 207 flow [2024-06-04 16:30:07,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:07,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:07,207 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:07,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-06-04 16:30:07,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-06-04 16:30:07,443 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:30:07,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:07,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1121837858, now seen corresponding path program 1 times [2024-06-04 16:30:07,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:07,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742216406] [2024-06-04 16:30:07,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:07,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 16:30:07,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-04 16:30:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 16:30:07,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-04 16:30:07,493 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-04 16:30:07,493 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-04 16:30:07,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-04 16:30:07,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-06-04 16:30:07,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-04 16:30:07,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 16:30:07,495 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-06-04 16:30:07,495 WARN L234 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-04 16:30:07,495 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-06-04 16:30:07,529 INFO L144 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2024-06-04 16:30:07,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 93 transitions, 326 flow [2024-06-04 16:30:09,189 INFO L124 PetriNetUnfolderBase]: 9252/16852 cut-off events. [2024-06-04 16:30:09,189 INFO L125 PetriNetUnfolderBase]: For 10450/10450 co-relation queries the response was YES. [2024-06-04 16:30:09,233 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 435. Compared 120116 event pairs, 2148 based on Foata normal form. 0/14720 useless extension candidates. Maximal degree in co-relation 12795. Up to 5120 conditions per place. [2024-06-04 16:30:09,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 93 transitions, 326 flow [2024-06-04 16:30:09,240 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 66 transitions, 212 flow [2024-06-04 16:30:09,241 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:30:09,241 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;@367ec7ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:30:09,242 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 16:30:09,243 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:30:09,243 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-06-04 16:30:09,243 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:30:09,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:09,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-04 16:30:09,243 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:30:09,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:09,244 INFO L85 PathProgramCache]: Analyzing trace with hash 658572, now seen corresponding path program 1 times [2024-06-04 16:30:09,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:09,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984523252] [2024-06-04 16:30:09,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:09,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:09,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:09,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:09,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984523252] [2024-06-04 16:30:09,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984523252] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:09,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:09,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:30:09,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348539289] [2024-06-04 16:30:09,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:09,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:30:09,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:09,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:30:09,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:30:09,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 93 [2024-06-04 16:30:09,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 66 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:09,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:09,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 93 [2024-06-04 16:30:09,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:22,814 INFO L124 PetriNetUnfolderBase]: 79802/115960 cut-off events. [2024-06-04 16:30:22,815 INFO L125 PetriNetUnfolderBase]: For 34688/34688 co-relation queries the response was YES. [2024-06-04 16:30:23,588 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 915222 event pairs, 79802 based on Foata normal form. 2/111963 useless extension candidates. Maximal degree in co-relation 102019. Up to 99895 conditions per place. [2024-06-04 16:30:24,413 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 30 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2024-06-04 16:30:24,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 69 transitions, 284 flow [2024-06-04 16:30:24,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:30:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:30:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2024-06-04 16:30:24,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125448028673835 [2024-06-04 16:30:24,415 INFO L175 Difference]: Start difference. First operand has 87 places, 66 transitions, 212 flow. Second operand 3 states and 143 transitions. [2024-06-04 16:30:24,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 69 transitions, 284 flow [2024-06-04 16:30:24,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 69 transitions, 260 flow, removed 12 selfloop flow, removed 0 redundant places. [2024-06-04 16:30:24,439 INFO L231 Difference]: Finished difference. Result has 90 places, 68 transitions, 209 flow [2024-06-04 16:30:24,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=90, PETRI_TRANSITIONS=68} [2024-06-04 16:30:24,440 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 3 predicate places. [2024-06-04 16:30:24,440 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 68 transitions, 209 flow [2024-06-04 16:30:24,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:24,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:24,440 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:24,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 16:30:24,441 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:30:24,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:24,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1762950590, now seen corresponding path program 1 times [2024-06-04 16:30:24,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:24,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312541710] [2024-06-04 16:30:24,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:24,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:24,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:24,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312541710] [2024-06-04 16:30:24,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312541710] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:30:24,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239925589] [2024-06-04 16:30:24,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:24,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:30:24,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:30:24,709 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:30:24,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-06-04 16:30:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:24,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-04 16:30:24,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:30:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:24,969 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-04 16:30:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:25,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239925589] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-04 16:30:25,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-04 16:30:25,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 9 [2024-06-04 16:30:25,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761975984] [2024-06-04 16:30:25,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:25,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:30:25,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:25,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:30:25,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:30:25,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 93 [2024-06-04 16:30:25,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 68 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:25,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:25,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 93 [2024-06-04 16:30:25,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:36,533 INFO L124 PetriNetUnfolderBase]: 63677/95867 cut-off events. [2024-06-04 16:30:36,533 INFO L125 PetriNetUnfolderBase]: For 30400/30400 co-relation queries the response was YES. [2024-06-04 16:30:37,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185732 conditions, 95867 events. 63677/95867 cut-off events. For 30400/30400 co-relation queries the response was YES. Maximal size of possible extension queue 2617. Compared 777562 event pairs, 63677 based on Foata normal form. 3968/97695 useless extension candidates. Maximal degree in co-relation 183385. Up to 78938 conditions per place. [2024-06-04 16:30:37,722 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 44 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2024-06-04 16:30:37,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 82 transitions, 354 flow [2024-06-04 16:30:37,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:30:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:30:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2024-06-04 16:30:37,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026881720430108 [2024-06-04 16:30:37,724 INFO L175 Difference]: Start difference. First operand has 90 places, 68 transitions, 209 flow. Second operand 4 states and 187 transitions. [2024-06-04 16:30:37,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 82 transitions, 354 flow [2024-06-04 16:30:37,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 82 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:30:37,753 INFO L231 Difference]: Finished difference. Result has 93 places, 69 transitions, 222 flow [2024-06-04 16:30:37,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=93, PETRI_TRANSITIONS=69} [2024-06-04 16:30:37,753 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 6 predicate places. [2024-06-04 16:30:37,754 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 69 transitions, 222 flow [2024-06-04 16:30:37,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:37,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:37,754 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:37,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-06-04 16:30:37,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-06-04 16:30:37,968 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:30:37,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:37,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2082185795, now seen corresponding path program 1 times [2024-06-04 16:30:37,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:37,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002842530] [2024-06-04 16:30:37,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:37,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:38,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:38,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002842530] [2024-06-04 16:30:38,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002842530] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 16:30:38,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415745873] [2024-06-04 16:30:38,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:38,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 16:30:38,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:30:38,212 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 16:30:38,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-06-04 16:30:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:38,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-04 16:30:38,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 16:30:38,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:38,472 INFO L327 TraceCheckSpWp]: Computing backward predicates...