./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/test-easy6.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/test-easy6.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fced0e87 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/weaver/test-easy6.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/test-easy6.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.extract-columns-fced0e8-m [2024-01-31 16:11:53,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 16:11:53,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 16:11:53,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 16:11:53,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 16:11:53,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 16:11:53,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 16:11:53,480 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 16:11:53,481 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 16:11:53,484 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 16:11:53,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 16:11:53,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 16:11:53,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 16:11:53,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 16:11:53,486 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 16:11:53,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 16:11:53,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 16:11:53,487 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 16:11:53,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 16:11:53,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 16:11:53,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 16:11:53,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 16:11:53,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 16:11:53,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 16:11:53,489 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 16:11:53,490 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 16:11:53,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 16:11:53,490 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 16:11:53,490 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 16:11:53,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 16:11:53,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 16:11:53,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 16:11:53,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:11:53,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 16:11:53,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 16:11:53,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 16:11:53,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 16:11:53,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 16:11:53,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 16:11:53,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 16:11:53,493 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 16:11:53,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 16:11:53,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 16:11:53,494 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-31 16:11:53,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 16:11:53,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 16:11:53,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 16:11:53,705 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 16:11:53,706 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 16:11:53,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/test-easy6.wvr.yml/witness.yml [2024-01-31 16:11:53,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 16:11:53,909 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 16:11:53,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy6.wvr.c [2024-01-31 16:11:54,903 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 16:11:55,133 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 16:11:55,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy6.wvr.c [2024-01-31 16:11:55,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3e7d29b9/b384326675cc43f094e21b2ad1ec7663/FLAG009597849 [2024-01-31 16:11:55,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3e7d29b9/b384326675cc43f094e21b2ad1ec7663 [2024-01-31 16:11:55,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 16:11:55,152 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 16:11:55,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 16:11:55,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 16:11:55,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 16:11:55,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:11:53" (1/2) ... [2024-01-31 16:11:55,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4350e96d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:11:55, skipping insertion in model container [2024-01-31 16:11:55,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:11:53" (1/2) ... [2024-01-31 16:11:55,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@32ca4a73 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:11:55, skipping insertion in model container [2024-01-31 16:11:55,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:11:55" (2/2) ... [2024-01-31 16:11:55,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4350e96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:55, skipping insertion in model container [2024-01-31 16:11:55,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:11:55" (2/2) ... [2024-01-31 16:11:55,162 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 16:11:55,221 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 16:11:55,223 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,223 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,223 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (e2 == (_Bool)0)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-31 16:11:55,223 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (e1 == (_Bool)0)) && ((unsigned long )_argptr == 0UL)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,223 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (((((((((0 <= n2) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (1 <= n1)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,223 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,224 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] (((((((((0 <= n1) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (n2 == 0)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,224 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,224 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,224 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,224 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (e2 == (_Bool)1)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-31 16:11:55,224 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,224 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,225 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,225 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,225 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,225 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,225 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,225 INFO L98 nessWitnessExtractor]: Location invariant before [L99-L99] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,225 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] (((((((((0 <= n1) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (1 <= n2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,225 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,226 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i1)) && (0 <= i2)) && (1 <= i)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,226 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,226 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,226 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((((((((((0 <= n2) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (1 <= n1)) && ((unsigned long )_argptr == 0UL)) && (n1 != 0)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,226 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,227 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,227 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,227 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,227 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,227 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,227 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L49] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,227 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,228 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (e1 == (_Bool)1)) && ((unsigned long )_argptr == 0UL)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,228 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,228 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,229 INFO L98 nessWitnessExtractor]: Location invariant before [L110-L110] ((((((((e1 == (_Bool)0) && (e2 == (_Bool)0)) && (n1 == 0)) && (n2 == 0)) && (tmp1 == 0)) && (tmp2 == 0)) && (i == 0)) && (i1 == 0)) && (i2 == 0) [2024-01-31 16:11:55,229 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,230 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,230 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,230 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,230 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,230 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i1)) && (0 <= i2)) && (1 <= i)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,230 INFO L98 nessWitnessExtractor]: Location invariant before [L46-L46] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,230 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,231 INFO L98 nessWitnessExtractor]: Location invariant before [L95-L95] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,231 INFO L98 nessWitnessExtractor]: Location invariant before [L100-L100] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,231 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,231 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,231 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L43] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,231 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,232 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] ((((((((((0 <= n1) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (1 <= n2)) && ((unsigned long )_argptr == 0UL)) && (n2 != 0)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,232 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,232 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (((((((((0 <= n2) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && (n1 == 0)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,232 INFO L98 nessWitnessExtractor]: Location invariant before [L103-L103] (unsigned long )_argptr == 0UL [2024-01-31 16:11:55,233 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,233 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (((((((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-31 16:11:55,252 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 16:11:55,391 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy6.wvr.c[3072,3085] [2024-01-31 16:11:55,396 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:11:55,407 INFO L204 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-31 16:11:55,561 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy6.wvr.c[3072,3085] [2024-01-31 16:11:55,576 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:11:55,588 INFO L208 MainTranslator]: Completed translation [2024-01-31 16:11:55,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:55 WrapperNode [2024-01-31 16:11:55,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 16:11:55,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 16:11:55,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 16:11:55,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 16:11:55,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:55" (1/1) ... [2024-01-31 16:11:55,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:55" (1/1) ... [2024-01-31 16:11:55,648 INFO L138 Inliner]: procedures = 21, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 181 [2024-01-31 16:11:55,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 16:11:55,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 16:11:55,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 16:11:55,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 16:11:55,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:55" (1/1) ... [2024-01-31 16:11:55,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:55" (1/1) ... [2024-01-31 16:11:55,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:55" (1/1) ... [2024-01-31 16:11:55,694 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-01-31 16:11:55,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:55" (1/1) ... [2024-01-31 16:11:55,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:55" (1/1) ... [2024-01-31 16:11:55,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:55" (1/1) ... [2024-01-31 16:11:55,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:55" (1/1) ... [2024-01-31 16:11:55,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:55" (1/1) ... [2024-01-31 16:11:55,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:55" (1/1) ... [2024-01-31 16:11:55,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 16:11:55,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 16:11:55,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 16:11:55,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 16:11:55,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:55" (1/1) ... [2024-01-31 16:11:55,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:11:55,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:11:55,756 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-01-31 16:11:55,758 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-01-31 16:11:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 16:11:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 16:11:55,789 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 16:11:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 16:11:55,790 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 16:11:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 16:11:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 16:11:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 16:11:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 16:11:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 16:11:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 16:11:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 16:11:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 16:11:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 16:11:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 16:11:55,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 16:11:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 16:11:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 16:11:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 16:11:55,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 16:11:55,794 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 16:11:55,880 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 16:11:55,882 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 16:11:56,370 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 16:11:56,371 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 16:11:56,620 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 16:11:56,620 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 16:11:56,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:11:56 BoogieIcfgContainer [2024-01-31 16:11:56,621 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 16:11:56,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 16:11:56,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 16:11:56,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 16:11:56,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:11:53" (1/4) ... [2024-01-31 16:11:56,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351b72f1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:11:56, skipping insertion in model container [2024-01-31 16:11:56,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:11:55" (2/4) ... [2024-01-31 16:11:56,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351b72f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:11:56, skipping insertion in model container [2024-01-31 16:11:56,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:55" (3/4) ... [2024-01-31 16:11:56,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351b72f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:11:56, skipping insertion in model container [2024-01-31 16:11:56,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:11:56" (4/4) ... [2024-01-31 16:11:56,629 INFO L112 eAbstractionObserver]: Analyzing ICFG test-easy6.wvr.c [2024-01-31 16:11:56,642 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 16:11:56,643 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-01-31 16:11:56,643 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 16:11:56,768 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-31 16:11:56,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions, 236 flow [2024-01-31 16:11:56,852 INFO L124 PetriNetUnfolderBase]: 0/109 cut-off events. [2024-01-31 16:11:56,852 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-31 16:11:56,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 109 events. 0/109 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 298 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-01-31 16:11:56,854 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 111 transitions, 236 flow [2024-01-31 16:11:56,858 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 108 transitions, 228 flow [2024-01-31 16:11:56,870 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 16:11:56,877 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;@60680bda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 16:11:56,877 INFO L358 AbstractCegarLoop]: Starting to check reachability of 116 error locations. [2024-01-31 16:11:56,879 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 16:11:56,879 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-31 16:11:56,879 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:11:56,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:56,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-31 16:11:56,880 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:11:56,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:56,884 INFO L85 PathProgramCache]: Analyzing trace with hash 16279, now seen corresponding path program 1 times [2024-01-31 16:11:56,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:56,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168344548] [2024-01-31 16:11:56,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:56,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:57,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:57,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168344548] [2024-01-31 16:11:57,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168344548] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:57,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:57,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:11:57,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120567318] [2024-01-31 16:11:57,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:57,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:57,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:57,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:57,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:57,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 111 [2024-01-31 16:11:57,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-01-31 16:11:57,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:57,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 111 [2024-01-31 16:11:57,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:57,650 INFO L124 PetriNetUnfolderBase]: 1197/2839 cut-off events. [2024-01-31 16:11:57,650 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-01-31 16:11:57,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4987 conditions, 2839 events. 1197/2839 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 21652 event pairs, 655 based on Foata normal form. 0/1723 useless extension candidates. Maximal degree in co-relation 4793. Up to 2061 conditions per place. [2024-01-31 16:11:57,673 INFO L140 encePairwiseOnDemand]: 89/111 looper letters, 52 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2024-01-31 16:11:57,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 96 transitions, 317 flow [2024-01-31 16:11:57,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions. [2024-01-31 16:11:57,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6156156156156156 [2024-01-31 16:11:57,692 INFO L175 Difference]: Start difference. First operand has 115 places, 108 transitions, 228 flow. Second operand 3 states and 205 transitions. [2024-01-31 16:11:57,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 96 transitions, 317 flow [2024-01-31 16:11:57,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 96 transitions, 307 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-31 16:11:57,700 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 199 flow [2024-01-31 16:11:57,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=95, PETRI_TRANSITIONS=91} [2024-01-31 16:11:57,705 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -20 predicate places. [2024-01-31 16:11:57,706 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 199 flow [2024-01-31 16:11:57,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-01-31 16:11:57,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:57,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-31 16:11:57,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 16:11:57,707 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:11:57,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:57,707 INFO L85 PathProgramCache]: Analyzing trace with hash 485639763, now seen corresponding path program 1 times [2024-01-31 16:11:57,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:57,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126627490] [2024-01-31 16:11:57,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:57,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:57,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:57,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126627490] [2024-01-31 16:11:57,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126627490] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:57,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:57,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:11:57,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584985220] [2024-01-31 16:11:57,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:57,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:11:57,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:57,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:11:57,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:11:57,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 111 [2024-01-31 16:11:57,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 91 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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-01-31 16:11:57,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:57,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 111 [2024-01-31 16:11:57,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:58,193 INFO L124 PetriNetUnfolderBase]: 1257/2886 cut-off events. [2024-01-31 16:11:58,194 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2024-01-31 16:11:58,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5194 conditions, 2886 events. 1257/2886 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 21523 event pairs, 743 based on Foata normal form. 378/2249 useless extension candidates. Maximal degree in co-relation 2402. Up to 2120 conditions per place. [2024-01-31 16:11:58,204 INFO L140 encePairwiseOnDemand]: 99/111 looper letters, 71 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2024-01-31 16:11:58,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 103 transitions, 373 flow [2024-01-31 16:11:58,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:11:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:11:58,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2024-01-31 16:11:58,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797297297297297 [2024-01-31 16:11:58,209 INFO L175 Difference]: Start difference. First operand has 95 places, 91 transitions, 199 flow. Second operand 4 states and 213 transitions. [2024-01-31 16:11:58,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 103 transitions, 373 flow [2024-01-31 16:11:58,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 103 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:11:58,212 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 180 flow [2024-01-31 16:11:58,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2024-01-31 16:11:58,213 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -28 predicate places. [2024-01-31 16:11:58,213 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 180 flow [2024-01-31 16:11:58,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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-01-31 16:11:58,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:58,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-31 16:11:58,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 16:11:58,214 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:11:58,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:58,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2125035946, now seen corresponding path program 1 times [2024-01-31 16:11:58,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:58,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367615508] [2024-01-31 16:11:58,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:58,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:58,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:58,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367615508] [2024-01-31 16:11:58,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367615508] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:58,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:58,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:11:58,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254452502] [2024-01-31 16:11:58,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:58,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:11:58,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:58,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:11:58,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-31 16:11:58,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:11:58,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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-01-31 16:11:58,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:58,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:11:58,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:58,945 INFO L124 PetriNetUnfolderBase]: 1789/3696 cut-off events. [2024-01-31 16:11:58,945 INFO L125 PetriNetUnfolderBase]: For 135/140 co-relation queries the response was YES. [2024-01-31 16:11:58,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6963 conditions, 3696 events. 1789/3696 cut-off events. For 135/140 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 25076 event pairs, 613 based on Foata normal form. 9/2567 useless extension candidates. Maximal degree in co-relation 6664. Up to 2793 conditions per place. [2024-01-31 16:11:58,958 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 83 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2024-01-31 16:11:58,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 111 transitions, 433 flow [2024-01-31 16:11:58,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:11:58,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:11:58,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2024-01-31 16:11:58,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3801801801801802 [2024-01-31 16:11:58,960 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 180 flow. Second operand 5 states and 211 transitions. [2024-01-31 16:11:58,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 111 transitions, 433 flow [2024-01-31 16:11:58,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 111 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:58,962 INFO L231 Difference]: Finished difference. Result has 92 places, 85 transitions, 220 flow [2024-01-31 16:11:58,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=92, PETRI_TRANSITIONS=85} [2024-01-31 16:11:58,963 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -23 predicate places. [2024-01-31 16:11:58,963 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 85 transitions, 220 flow [2024-01-31 16:11:58,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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-01-31 16:11:58,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:58,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:11:58,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 16:11:58,964 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:11:58,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:58,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1453984249, now seen corresponding path program 1 times [2024-01-31 16:11:58,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:58,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672481060] [2024-01-31 16:11:58,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:58,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:59,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:59,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:59,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672481060] [2024-01-31 16:11:59,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672481060] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:59,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:59,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:11:59,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398362737] [2024-01-31 16:11:59,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:59,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:11:59,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:59,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:11:59,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:11:59,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 111 [2024-01-31 16:11:59,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 85 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-01-31 16:11:59,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:59,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 111 [2024-01-31 16:11:59,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:59,313 INFO L124 PetriNetUnfolderBase]: 1266/2607 cut-off events. [2024-01-31 16:11:59,313 INFO L125 PetriNetUnfolderBase]: For 276/281 co-relation queries the response was YES. [2024-01-31 16:11:59,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5123 conditions, 2607 events. 1266/2607 cut-off events. For 276/281 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 17853 event pairs, 52 based on Foata normal form. 397/2362 useless extension candidates. Maximal degree in co-relation 5105. Up to 2084 conditions per place. [2024-01-31 16:11:59,324 INFO L140 encePairwiseOnDemand]: 99/111 looper letters, 91 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2024-01-31 16:11:59,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 114 transitions, 483 flow [2024-01-31 16:11:59,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:11:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:11:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 230 transitions. [2024-01-31 16:11:59,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180180180180181 [2024-01-31 16:11:59,325 INFO L175 Difference]: Start difference. First operand has 92 places, 85 transitions, 220 flow. Second operand 4 states and 230 transitions. [2024-01-31 16:11:59,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 114 transitions, 483 flow [2024-01-31 16:11:59,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 114 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:59,328 INFO L231 Difference]: Finished difference. Result has 83 places, 75 transitions, 197 flow [2024-01-31 16:11:59,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=83, PETRI_TRANSITIONS=75} [2024-01-31 16:11:59,329 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -32 predicate places. [2024-01-31 16:11:59,329 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 197 flow [2024-01-31 16:11:59,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-01-31 16:11:59,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:59,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:11:59,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 16:11:59,330 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:11:59,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:59,330 INFO L85 PathProgramCache]: Analyzing trace with hash -2123838126, now seen corresponding path program 1 times [2024-01-31 16:11:59,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:59,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337798833] [2024-01-31 16:11:59,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:59,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:59,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:59,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337798833] [2024-01-31 16:11:59,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337798833] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:59,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:59,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:11:59,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244891407] [2024-01-31 16:11:59,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:59,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:11:59,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:59,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:11:59,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-31 16:11:59,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:11:59,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 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-01-31 16:11:59,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:59,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:11:59,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:59,798 INFO L124 PetriNetUnfolderBase]: 1808/3299 cut-off events. [2024-01-31 16:11:59,798 INFO L125 PetriNetUnfolderBase]: For 301/306 co-relation queries the response was YES. [2024-01-31 16:11:59,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6825 conditions, 3299 events. 1808/3299 cut-off events. For 301/306 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 19994 event pairs, 619 based on Foata normal form. 7/2558 useless extension candidates. Maximal degree in co-relation 6808. Up to 2869 conditions per place. [2024-01-31 16:11:59,809 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 79 selfloop transitions, 8 changer transitions 0/99 dead transitions. [2024-01-31 16:11:59,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 99 transitions, 440 flow [2024-01-31 16:11:59,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:11:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:11:59,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 207 transitions. [2024-01-31 16:11:59,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.372972972972973 [2024-01-31 16:11:59,811 INFO L175 Difference]: Start difference. First operand has 83 places, 75 transitions, 197 flow. Second operand 5 states and 207 transitions. [2024-01-31 16:11:59,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 99 transitions, 440 flow [2024-01-31 16:11:59,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 99 transitions, 431 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:59,813 INFO L231 Difference]: Finished difference. Result has 87 places, 77 transitions, 230 flow [2024-01-31 16:11:59,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=87, PETRI_TRANSITIONS=77} [2024-01-31 16:11:59,813 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -28 predicate places. [2024-01-31 16:11:59,814 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 77 transitions, 230 flow [2024-01-31 16:11:59,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 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-01-31 16:11:59,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:59,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:11:59,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 16:11:59,814 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:11:59,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:59,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2050058727, now seen corresponding path program 1 times [2024-01-31 16:11:59,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:59,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843354393] [2024-01-31 16:11:59,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:59,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:59,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:59,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843354393] [2024-01-31 16:11:59,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843354393] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:59,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:59,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:11:59,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719417203] [2024-01-31 16:11:59,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:59,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:11:59,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:59,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:11:59,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:12:00,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:00,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 77 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 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-01-31 16:12:00,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:00,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:00,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:00,342 INFO L124 PetriNetUnfolderBase]: 1766/3209 cut-off events. [2024-01-31 16:12:00,342 INFO L125 PetriNetUnfolderBase]: For 409/425 co-relation queries the response was YES. [2024-01-31 16:12:00,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6756 conditions, 3209 events. 1766/3209 cut-off events. For 409/425 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 19870 event pairs, 613 based on Foata normal form. 9/2478 useless extension candidates. Maximal degree in co-relation 6357. Up to 2793 conditions per place. [2024-01-31 16:12:00,354 INFO L140 encePairwiseOnDemand]: 103/111 looper letters, 84 selfloop transitions, 10 changer transitions 0/106 dead transitions. [2024-01-31 16:12:00,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 106 transitions, 495 flow [2024-01-31 16:12:00,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:00,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 239 transitions. [2024-01-31 16:12:00,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588588588588589 [2024-01-31 16:12:00,355 INFO L175 Difference]: Start difference. First operand has 87 places, 77 transitions, 230 flow. Second operand 6 states and 239 transitions. [2024-01-31 16:12:00,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 106 transitions, 495 flow [2024-01-31 16:12:00,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 106 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:12:00,358 INFO L231 Difference]: Finished difference. Result has 91 places, 79 transitions, 259 flow [2024-01-31 16:12:00,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=259, PETRI_PLACES=91, PETRI_TRANSITIONS=79} [2024-01-31 16:12:00,358 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -24 predicate places. [2024-01-31 16:12:00,359 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 79 transitions, 259 flow [2024-01-31 16:12:00,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 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-01-31 16:12:00,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:00,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:00,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 16:12:00,359 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:00,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:00,360 INFO L85 PathProgramCache]: Analyzing trace with hash -898952171, now seen corresponding path program 1 times [2024-01-31 16:12:00,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:00,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546304234] [2024-01-31 16:12:00,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:00,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:00,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:00,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546304234] [2024-01-31 16:12:00,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546304234] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:00,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:00,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:12:00,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073541202] [2024-01-31 16:12:00,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:00,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:00,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:00,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:00,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:12:00,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:00,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 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-01-31 16:12:00,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:00,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:00,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:00,897 INFO L124 PetriNetUnfolderBase]: 1766/3153 cut-off events. [2024-01-31 16:12:00,897 INFO L125 PetriNetUnfolderBase]: For 565/570 co-relation queries the response was YES. [2024-01-31 16:12:00,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6858 conditions, 3153 events. 1766/3153 cut-off events. For 565/570 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 19266 event pairs, 771 based on Foata normal form. 11/2480 useless extension candidates. Maximal degree in co-relation 6836. Up to 2869 conditions per place. [2024-01-31 16:12:00,910 INFO L140 encePairwiseOnDemand]: 103/111 looper letters, 82 selfloop transitions, 11 changer transitions 0/105 dead transitions. [2024-01-31 16:12:00,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 105 transitions, 517 flow [2024-01-31 16:12:00,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2024-01-31 16:12:00,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35585585585585583 [2024-01-31 16:12:00,912 INFO L175 Difference]: Start difference. First operand has 91 places, 79 transitions, 259 flow. Second operand 6 states and 237 transitions. [2024-01-31 16:12:00,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 105 transitions, 517 flow [2024-01-31 16:12:00,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 105 transitions, 495 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-01-31 16:12:00,915 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 279 flow [2024-01-31 16:12:00,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=279, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2024-01-31 16:12:00,915 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -22 predicate places. [2024-01-31 16:12:00,916 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 279 flow [2024-01-31 16:12:00,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 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-01-31 16:12:00,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:00,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:00,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 16:12:00,916 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:00,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:00,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2145456550, now seen corresponding path program 1 times [2024-01-31 16:12:00,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:00,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123755868] [2024-01-31 16:12:00,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:00,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:01,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:01,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123755868] [2024-01-31 16:12:01,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123755868] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:01,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:01,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:12:01,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888702366] [2024-01-31 16:12:01,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:01,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:01,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:01,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:01,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:12:01,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:01,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 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-01-31 16:12:01,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:01,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:01,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:01,526 INFO L124 PetriNetUnfolderBase]: 1772/3227 cut-off events. [2024-01-31 16:12:01,526 INFO L125 PetriNetUnfolderBase]: For 765/770 co-relation queries the response was YES. [2024-01-31 16:12:01,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7092 conditions, 3227 events. 1772/3227 cut-off events. For 765/770 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 19553 event pairs, 618 based on Foata normal form. 9/2586 useless extension candidates. Maximal degree in co-relation 7069. Up to 2871 conditions per place. [2024-01-31 16:12:01,535 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 81 selfloop transitions, 13 changer transitions 0/106 dead transitions. [2024-01-31 16:12:01,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 106 transitions, 543 flow [2024-01-31 16:12:01,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 236 transitions. [2024-01-31 16:12:01,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35435435435435436 [2024-01-31 16:12:01,537 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 279 flow. Second operand 6 states and 236 transitions. [2024-01-31 16:12:01,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 106 transitions, 543 flow [2024-01-31 16:12:01,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 106 transitions, 528 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-01-31 16:12:01,540 INFO L231 Difference]: Finished difference. Result has 97 places, 84 transitions, 318 flow [2024-01-31 16:12:01,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=318, PETRI_PLACES=97, PETRI_TRANSITIONS=84} [2024-01-31 16:12:01,540 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -18 predicate places. [2024-01-31 16:12:01,540 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 84 transitions, 318 flow [2024-01-31 16:12:01,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 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-01-31 16:12:01,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:01,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:01,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 16:12:01,541 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:01,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:01,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2099344360, now seen corresponding path program 2 times [2024-01-31 16:12:01,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:01,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097697458] [2024-01-31 16:12:01,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:01,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:01,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:01,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097697458] [2024-01-31 16:12:01,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097697458] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:01,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:01,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:12:01,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757806173] [2024-01-31 16:12:01,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:01,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:01,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:01,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:01,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:12:01,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:01,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 84 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 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-01-31 16:12:01,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:01,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:01,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:02,072 INFO L124 PetriNetUnfolderBase]: 1766/3207 cut-off events. [2024-01-31 16:12:02,072 INFO L125 PetriNetUnfolderBase]: For 1024/1029 co-relation queries the response was YES. [2024-01-31 16:12:02,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7150 conditions, 3207 events. 1766/3207 cut-off events. For 1024/1029 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 19445 event pairs, 627 based on Foata normal form. 9/2564 useless extension candidates. Maximal degree in co-relation 7125. Up to 2869 conditions per place. [2024-01-31 16:12:02,084 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 78 selfloop transitions, 14 changer transitions 0/104 dead transitions. [2024-01-31 16:12:02,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 104 transitions, 561 flow [2024-01-31 16:12:02,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:02,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2024-01-31 16:12:02,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34984984984984985 [2024-01-31 16:12:02,086 INFO L175 Difference]: Start difference. First operand has 97 places, 84 transitions, 318 flow. Second operand 6 states and 233 transitions. [2024-01-31 16:12:02,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 104 transitions, 561 flow [2024-01-31 16:12:02,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 104 transitions, 533 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-01-31 16:12:02,088 INFO L231 Difference]: Finished difference. Result has 99 places, 85 transitions, 332 flow [2024-01-31 16:12:02,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=332, PETRI_PLACES=99, PETRI_TRANSITIONS=85} [2024-01-31 16:12:02,089 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -16 predicate places. [2024-01-31 16:12:02,089 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 85 transitions, 332 flow [2024-01-31 16:12:02,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 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-01-31 16:12:02,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:02,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:02,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 16:12:02,090 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:02,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:02,090 INFO L85 PathProgramCache]: Analyzing trace with hash -2099342920, now seen corresponding path program 1 times [2024-01-31 16:12:02,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:02,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596915889] [2024-01-31 16:12:02,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:02,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:02,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:02,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596915889] [2024-01-31 16:12:02,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596915889] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:02,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:02,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:12:02,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763194324] [2024-01-31 16:12:02,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:02,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:02,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:02,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:02,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:12:02,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:02,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 85 transitions, 332 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 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-01-31 16:12:02,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:02,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:02,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:02,644 INFO L124 PetriNetUnfolderBase]: 1770/3339 cut-off events. [2024-01-31 16:12:02,645 INFO L125 PetriNetUnfolderBase]: For 1090/1110 co-relation queries the response was YES. [2024-01-31 16:12:02,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7364 conditions, 3339 events. 1770/3339 cut-off events. For 1090/1110 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 20196 event pairs, 673 based on Foata normal form. 11/2674 useless extension candidates. Maximal degree in co-relation 6978. Up to 2857 conditions per place. [2024-01-31 16:12:02,658 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 83 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2024-01-31 16:12:02,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 112 transitions, 615 flow [2024-01-31 16:12:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:02,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:02,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2024-01-31 16:12:02,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35585585585585583 [2024-01-31 16:12:02,659 INFO L175 Difference]: Start difference. First operand has 99 places, 85 transitions, 332 flow. Second operand 6 states and 237 transitions. [2024-01-31 16:12:02,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 112 transitions, 615 flow [2024-01-31 16:12:02,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 112 transitions, 590 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 16:12:02,663 INFO L231 Difference]: Finished difference. Result has 103 places, 89 transitions, 375 flow [2024-01-31 16:12:02,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=103, PETRI_TRANSITIONS=89} [2024-01-31 16:12:02,663 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -12 predicate places. [2024-01-31 16:12:02,663 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 375 flow [2024-01-31 16:12:02,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 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-01-31 16:12:02,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:02,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:02,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 16:12:02,664 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:02,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:02,665 INFO L85 PathProgramCache]: Analyzing trace with hash -885335720, now seen corresponding path program 2 times [2024-01-31 16:12:02,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:02,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341088504] [2024-01-31 16:12:02,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:02,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:02,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:02,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341088504] [2024-01-31 16:12:02,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341088504] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:02,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:02,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:12:02,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717980977] [2024-01-31 16:12:02,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:02,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:02,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:02,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:02,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:12:02,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:02,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 89 transitions, 375 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 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-01-31 16:12:02,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:02,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:02,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:03,332 INFO L124 PetriNetUnfolderBase]: 1764/3333 cut-off events. [2024-01-31 16:12:03,332 INFO L125 PetriNetUnfolderBase]: For 1272/1286 co-relation queries the response was YES. [2024-01-31 16:12:03,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7413 conditions, 3333 events. 1764/3333 cut-off events. For 1272/1286 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 20088 event pairs, 668 based on Foata normal form. 12/2673 useless extension candidates. Maximal degree in co-relation 7020. Up to 2855 conditions per place. [2024-01-31 16:12:03,345 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 80 selfloop transitions, 16 changer transitions 0/109 dead transitions. [2024-01-31 16:12:03,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 109 transitions, 619 flow [2024-01-31 16:12:03,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:03,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2024-01-31 16:12:03,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2024-01-31 16:12:03,346 INFO L175 Difference]: Start difference. First operand has 103 places, 89 transitions, 375 flow. Second operand 6 states and 234 transitions. [2024-01-31 16:12:03,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 109 transitions, 619 flow [2024-01-31 16:12:03,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 109 transitions, 599 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-31 16:12:03,349 INFO L231 Difference]: Finished difference. Result has 107 places, 89 transitions, 392 flow [2024-01-31 16:12:03,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=392, PETRI_PLACES=107, PETRI_TRANSITIONS=89} [2024-01-31 16:12:03,350 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -8 predicate places. [2024-01-31 16:12:03,350 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 89 transitions, 392 flow [2024-01-31 16:12:03,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 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-01-31 16:12:03,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:03,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:03,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-31 16:12:03,351 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:03,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:03,351 INFO L85 PathProgramCache]: Analyzing trace with hash 857248063, now seen corresponding path program 1 times [2024-01-31 16:12:03,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:03,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185910695] [2024-01-31 16:12:03,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:03,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:03,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:03,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185910695] [2024-01-31 16:12:03,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185910695] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:03,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:03,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:12:03,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023227265] [2024-01-31 16:12:03,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:03,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 16:12:03,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:03,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 16:12:03,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:12:03,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:03,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 89 transitions, 392 flow. Second operand has 8 states, 8 states have (on average 25.5) internal successors, (204), 8 states have internal predecessors, (204), 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-01-31 16:12:03,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:03,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:03,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:03,994 INFO L124 PetriNetUnfolderBase]: 1596/3003 cut-off events. [2024-01-31 16:12:03,994 INFO L125 PetriNetUnfolderBase]: For 1180/1204 co-relation queries the response was YES. [2024-01-31 16:12:03,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6635 conditions, 3003 events. 1596/3003 cut-off events. For 1180/1204 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 17789 event pairs, 497 based on Foata normal form. 7/2410 useless extension candidates. Maximal degree in co-relation 6394. Up to 2397 conditions per place. [2024-01-31 16:12:04,005 INFO L140 encePairwiseOnDemand]: 100/111 looper letters, 105 selfloop transitions, 20 changer transitions 0/138 dead transitions. [2024-01-31 16:12:04,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 138 transitions, 799 flow [2024-01-31 16:12:04,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 16:12:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 16:12:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 305 transitions. [2024-01-31 16:12:04,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34346846846846846 [2024-01-31 16:12:04,006 INFO L175 Difference]: Start difference. First operand has 107 places, 89 transitions, 392 flow. Second operand 8 states and 305 transitions. [2024-01-31 16:12:04,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 138 transitions, 799 flow [2024-01-31 16:12:04,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 138 transitions, 747 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-01-31 16:12:04,009 INFO L231 Difference]: Finished difference. Result has 112 places, 96 transitions, 458 flow [2024-01-31 16:12:04,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=458, PETRI_PLACES=112, PETRI_TRANSITIONS=96} [2024-01-31 16:12:04,010 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2024-01-31 16:12:04,010 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 96 transitions, 458 flow [2024-01-31 16:12:04,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.5) internal successors, (204), 8 states have internal predecessors, (204), 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-01-31 16:12:04,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:04,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:04,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-31 16:12:04,011 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:04,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:04,011 INFO L85 PathProgramCache]: Analyzing trace with hash 391042397, now seen corresponding path program 1 times [2024-01-31 16:12:04,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:04,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824293502] [2024-01-31 16:12:04,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:04,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:04,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:04,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824293502] [2024-01-31 16:12:04,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824293502] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:04,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:04,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:12:04,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899024338] [2024-01-31 16:12:04,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:04,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:04,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:04,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:04,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:12:04,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:04,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 96 transitions, 458 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-01-31 16:12:04,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:04,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:04,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:04,584 INFO L124 PetriNetUnfolderBase]: 1644/3073 cut-off events. [2024-01-31 16:12:04,584 INFO L125 PetriNetUnfolderBase]: For 1616/1649 co-relation queries the response was YES. [2024-01-31 16:12:04,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7192 conditions, 3073 events. 1644/3073 cut-off events. For 1616/1649 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 18172 event pairs, 691 based on Foata normal form. 31/2564 useless extension candidates. Maximal degree in co-relation 6924. Up to 2565 conditions per place. [2024-01-31 16:12:04,595 INFO L140 encePairwiseOnDemand]: 103/111 looper letters, 91 selfloop transitions, 21 changer transitions 0/125 dead transitions. [2024-01-31 16:12:04,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 125 transitions, 778 flow [2024-01-31 16:12:04,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 242 transitions. [2024-01-31 16:12:04,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3633633633633634 [2024-01-31 16:12:04,597 INFO L175 Difference]: Start difference. First operand has 112 places, 96 transitions, 458 flow. Second operand 6 states and 242 transitions. [2024-01-31 16:12:04,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 125 transitions, 778 flow [2024-01-31 16:12:04,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 125 transitions, 762 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-01-31 16:12:04,600 INFO L231 Difference]: Finished difference. Result has 116 places, 98 transitions, 508 flow [2024-01-31 16:12:04,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=508, PETRI_PLACES=116, PETRI_TRANSITIONS=98} [2024-01-31 16:12:04,601 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 1 predicate places. [2024-01-31 16:12:04,601 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 98 transitions, 508 flow [2024-01-31 16:12:04,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-01-31 16:12:04,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:04,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:04,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-31 16:12:04,601 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:04,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:04,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1821133157, now seen corresponding path program 1 times [2024-01-31 16:12:04,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:04,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747458112] [2024-01-31 16:12:04,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:04,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:04,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:04,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747458112] [2024-01-31 16:12:04,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747458112] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:04,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:04,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:12:04,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013500117] [2024-01-31 16:12:04,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:04,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:04,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:04,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:04,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:12:04,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:04,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 98 transitions, 508 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-01-31 16:12:04,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:04,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:04,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:05,193 INFO L124 PetriNetUnfolderBase]: 1648/2963 cut-off events. [2024-01-31 16:12:05,194 INFO L125 PetriNetUnfolderBase]: For 2251/2260 co-relation queries the response was YES. [2024-01-31 16:12:05,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7385 conditions, 2963 events. 1648/2963 cut-off events. For 2251/2260 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 17740 event pairs, 750 based on Foata normal form. 17/2508 useless extension candidates. Maximal degree in co-relation 7350. Up to 2559 conditions per place. [2024-01-31 16:12:05,203 INFO L140 encePairwiseOnDemand]: 100/111 looper letters, 95 selfloop transitions, 25 changer transitions 0/133 dead transitions. [2024-01-31 16:12:05,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 133 transitions, 873 flow [2024-01-31 16:12:05,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 249 transitions. [2024-01-31 16:12:05,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3738738738738739 [2024-01-31 16:12:05,205 INFO L175 Difference]: Start difference. First operand has 116 places, 98 transitions, 508 flow. Second operand 6 states and 249 transitions. [2024-01-31 16:12:05,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 133 transitions, 873 flow [2024-01-31 16:12:05,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 133 transitions, 835 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-31 16:12:05,208 INFO L231 Difference]: Finished difference. Result has 119 places, 103 transitions, 572 flow [2024-01-31 16:12:05,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=572, PETRI_PLACES=119, PETRI_TRANSITIONS=103} [2024-01-31 16:12:05,209 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 4 predicate places. [2024-01-31 16:12:05,209 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 103 transitions, 572 flow [2024-01-31 16:12:05,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-01-31 16:12:05,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:05,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:05,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-31 16:12:05,210 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:05,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:05,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1451474299, now seen corresponding path program 2 times [2024-01-31 16:12:05,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:05,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218508106] [2024-01-31 16:12:05,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:05,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:05,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:05,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:05,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218508106] [2024-01-31 16:12:05,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218508106] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:05,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:05,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:12:05,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290901822] [2024-01-31 16:12:05,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:05,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:05,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:05,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:05,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:12:05,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:05,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 103 transitions, 572 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-01-31 16:12:05,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:05,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:05,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:05,810 INFO L124 PetriNetUnfolderBase]: 1981/3604 cut-off events. [2024-01-31 16:12:05,810 INFO L125 PetriNetUnfolderBase]: For 3424/3489 co-relation queries the response was YES. [2024-01-31 16:12:05,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9249 conditions, 3604 events. 1981/3604 cut-off events. For 3424/3489 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 21219 event pairs, 807 based on Foata normal form. 68/3111 useless extension candidates. Maximal degree in co-relation 8948. Up to 2838 conditions per place. [2024-01-31 16:12:05,846 INFO L140 encePairwiseOnDemand]: 103/111 looper letters, 96 selfloop transitions, 25 changer transitions 0/136 dead transitions. [2024-01-31 16:12:05,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 136 transitions, 956 flow [2024-01-31 16:12:05,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 244 transitions. [2024-01-31 16:12:05,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3663663663663664 [2024-01-31 16:12:05,848 INFO L175 Difference]: Start difference. First operand has 119 places, 103 transitions, 572 flow. Second operand 6 states and 244 transitions. [2024-01-31 16:12:05,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 136 transitions, 956 flow [2024-01-31 16:12:05,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 136 transitions, 906 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-31 16:12:05,858 INFO L231 Difference]: Finished difference. Result has 121 places, 107 transitions, 611 flow [2024-01-31 16:12:05,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=611, PETRI_PLACES=121, PETRI_TRANSITIONS=107} [2024-01-31 16:12:05,859 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 6 predicate places. [2024-01-31 16:12:05,859 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 107 transitions, 611 flow [2024-01-31 16:12:05,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-01-31 16:12:05,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:05,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:05,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-31 16:12:05,860 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:05,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:05,860 INFO L85 PathProgramCache]: Analyzing trace with hash -449614727, now seen corresponding path program 2 times [2024-01-31 16:12:05,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:05,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910855172] [2024-01-31 16:12:05,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:05,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:06,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:06,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:06,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910855172] [2024-01-31 16:12:06,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910855172] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:06,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:06,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:12:06,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869770713] [2024-01-31 16:12:06,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:06,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:06,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:06,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:06,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:12:06,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:06,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 107 transitions, 611 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-01-31 16:12:06,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:06,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:06,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:06,565 INFO L124 PetriNetUnfolderBase]: 1642/2957 cut-off events. [2024-01-31 16:12:06,565 INFO L125 PetriNetUnfolderBase]: For 2875/2888 co-relation queries the response was YES. [2024-01-31 16:12:06,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7758 conditions, 2957 events. 1642/2957 cut-off events. For 2875/2888 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 17723 event pairs, 765 based on Foata normal form. 57/2540 useless extension candidates. Maximal degree in co-relation 7720. Up to 2573 conditions per place. [2024-01-31 16:12:06,578 INFO L140 encePairwiseOnDemand]: 103/111 looper letters, 84 selfloop transitions, 27 changer transitions 0/124 dead transitions. [2024-01-31 16:12:06,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 124 transitions, 902 flow [2024-01-31 16:12:06,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2024-01-31 16:12:06,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2024-01-31 16:12:06,580 INFO L175 Difference]: Start difference. First operand has 121 places, 107 transitions, 611 flow. Second operand 6 states and 234 transitions. [2024-01-31 16:12:06,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 124 transitions, 902 flow [2024-01-31 16:12:06,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 124 transitions, 872 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 16:12:06,585 INFO L231 Difference]: Finished difference. Result has 124 places, 107 transitions, 649 flow [2024-01-31 16:12:06,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=649, PETRI_PLACES=124, PETRI_TRANSITIONS=107} [2024-01-31 16:12:06,586 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 9 predicate places. [2024-01-31 16:12:06,586 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 107 transitions, 649 flow [2024-01-31 16:12:06,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-01-31 16:12:06,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:06,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:06,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-31 16:12:06,587 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:06,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:06,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1614885897, now seen corresponding path program 3 times [2024-01-31 16:12:06,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:06,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35456232] [2024-01-31 16:12:06,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:06,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:06,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:06,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35456232] [2024-01-31 16:12:06,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35456232] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:06,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:06,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:12:06,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451571601] [2024-01-31 16:12:06,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:06,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:12:06,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:06,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:12:06,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:12:06,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:06,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 107 transitions, 649 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-01-31 16:12:06,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:06,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:06,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:07,330 INFO L124 PetriNetUnfolderBase]: 1847/3380 cut-off events. [2024-01-31 16:12:07,331 INFO L125 PetriNetUnfolderBase]: For 4071/4127 co-relation queries the response was YES. [2024-01-31 16:12:07,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8829 conditions, 3380 events. 1847/3380 cut-off events. For 4071/4127 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 19696 event pairs, 750 based on Foata normal form. 50/2878 useless extension candidates. Maximal degree in co-relation 8528. Up to 2828 conditions per place. [2024-01-31 16:12:07,344 INFO L140 encePairwiseOnDemand]: 100/111 looper letters, 84 selfloop transitions, 31 changer transitions 0/130 dead transitions. [2024-01-31 16:12:07,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 130 transitions, 960 flow [2024-01-31 16:12:07,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:12:07,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:12:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 239 transitions. [2024-01-31 16:12:07,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588588588588589 [2024-01-31 16:12:07,346 INFO L175 Difference]: Start difference. First operand has 124 places, 107 transitions, 649 flow. Second operand 6 states and 239 transitions. [2024-01-31 16:12:07,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 130 transitions, 960 flow [2024-01-31 16:12:07,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 130 transitions, 891 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-01-31 16:12:07,351 INFO L231 Difference]: Finished difference. Result has 126 places, 112 transitions, 703 flow [2024-01-31 16:12:07,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=703, PETRI_PLACES=126, PETRI_TRANSITIONS=112} [2024-01-31 16:12:07,352 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 11 predicate places. [2024-01-31 16:12:07,352 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 112 transitions, 703 flow [2024-01-31 16:12:07,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-01-31 16:12:07,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:07,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:07,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-31 16:12:07,353 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:07,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:07,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1188807365, now seen corresponding path program 1 times [2024-01-31 16:12:07,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:07,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954663266] [2024-01-31 16:12:07,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:07,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:07,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:07,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954663266] [2024-01-31 16:12:07,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954663266] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:07,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:07,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:12:07,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303446828] [2024-01-31 16:12:07,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:07,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 16:12:07,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:07,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 16:12:07,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:12:07,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:07,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 112 transitions, 703 flow. Second operand has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 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-01-31 16:12:07,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:07,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:07,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:07,980 INFO L124 PetriNetUnfolderBase]: 1460/2669 cut-off events. [2024-01-31 16:12:07,980 INFO L125 PetriNetUnfolderBase]: For 3341/3390 co-relation queries the response was YES. [2024-01-31 16:12:07,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7325 conditions, 2669 events. 1460/2669 cut-off events. For 3341/3390 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 15616 event pairs, 661 based on Foata normal form. 17/2268 useless extension candidates. Maximal degree in co-relation 7284. Up to 1931 conditions per place. [2024-01-31 16:12:07,991 INFO L140 encePairwiseOnDemand]: 101/111 looper letters, 109 selfloop transitions, 26 changer transitions 0/150 dead transitions. [2024-01-31 16:12:07,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 150 transitions, 1101 flow [2024-01-31 16:12:07,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 16:12:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 16:12:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 275 transitions. [2024-01-31 16:12:07,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3539253539253539 [2024-01-31 16:12:07,993 INFO L175 Difference]: Start difference. First operand has 126 places, 112 transitions, 703 flow. Second operand 7 states and 275 transitions. [2024-01-31 16:12:07,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 150 transitions, 1101 flow [2024-01-31 16:12:07,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 150 transitions, 1047 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-01-31 16:12:07,999 INFO L231 Difference]: Finished difference. Result has 131 places, 116 transitions, 759 flow [2024-01-31 16:12:07,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=759, PETRI_PLACES=131, PETRI_TRANSITIONS=116} [2024-01-31 16:12:07,999 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 16 predicate places. [2024-01-31 16:12:07,999 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 116 transitions, 759 flow [2024-01-31 16:12:08,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 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-01-31 16:12:08,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:08,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:08,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-31 16:12:08,000 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:08,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:08,001 INFO L85 PathProgramCache]: Analyzing trace with hash -818312030, now seen corresponding path program 1 times [2024-01-31 16:12:08,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:08,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23593426] [2024-01-31 16:12:08,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:08,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:08,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:08,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:08,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23593426] [2024-01-31 16:12:08,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23593426] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:08,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:08,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:12:08,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74171250] [2024-01-31 16:12:08,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:08,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 16:12:08,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:08,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 16:12:08,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:12:08,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:08,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 116 transitions, 759 flow. Second operand has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 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-01-31 16:12:08,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:08,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:08,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:08,650 INFO L124 PetriNetUnfolderBase]: 1495/2748 cut-off events. [2024-01-31 16:12:08,650 INFO L125 PetriNetUnfolderBase]: For 3708/3790 co-relation queries the response was YES. [2024-01-31 16:12:08,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7782 conditions, 2748 events. 1495/2748 cut-off events. For 3708/3790 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 15625 event pairs, 487 based on Foata normal form. 47/2463 useless extension candidates. Maximal degree in co-relation 7508. Up to 1805 conditions per place. [2024-01-31 16:12:08,662 INFO L140 encePairwiseOnDemand]: 101/111 looper letters, 113 selfloop transitions, 28 changer transitions 0/156 dead transitions. [2024-01-31 16:12:08,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 156 transitions, 1167 flow [2024-01-31 16:12:08,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 16:12:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 16:12:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 306 transitions. [2024-01-31 16:12:08,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34459459459459457 [2024-01-31 16:12:08,665 INFO L175 Difference]: Start difference. First operand has 131 places, 116 transitions, 759 flow. Second operand 8 states and 306 transitions. [2024-01-31 16:12:08,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 156 transitions, 1167 flow [2024-01-31 16:12:08,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 156 transitions, 1137 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-01-31 16:12:08,672 INFO L231 Difference]: Finished difference. Result has 138 places, 118 transitions, 831 flow [2024-01-31 16:12:08,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=831, PETRI_PLACES=138, PETRI_TRANSITIONS=118} [2024-01-31 16:12:08,673 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 23 predicate places. [2024-01-31 16:12:08,673 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 118 transitions, 831 flow [2024-01-31 16:12:08,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 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-01-31 16:12:08,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:08,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:08,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-01-31 16:12:08,673 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:08,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:08,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1006496784, now seen corresponding path program 1 times [2024-01-31 16:12:08,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:08,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372643521] [2024-01-31 16:12:08,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:08,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:08,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:08,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372643521] [2024-01-31 16:12:08,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372643521] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:08,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:08,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:12:08,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345340665] [2024-01-31 16:12:08,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:08,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 16:12:08,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:08,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 16:12:08,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:12:08,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:08,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 118 transitions, 831 flow. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 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-01-31 16:12:08,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:08,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:08,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:09,293 INFO L124 PetriNetUnfolderBase]: 1403/2618 cut-off events. [2024-01-31 16:12:09,294 INFO L125 PetriNetUnfolderBase]: For 4505/4558 co-relation queries the response was YES. [2024-01-31 16:12:09,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7704 conditions, 2618 events. 1403/2618 cut-off events. For 4505/4558 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 15031 event pairs, 490 based on Foata normal form. 19/2315 useless extension candidates. Maximal degree in co-relation 7658. Up to 1812 conditions per place. [2024-01-31 16:12:09,310 INFO L140 encePairwiseOnDemand]: 101/111 looper letters, 102 selfloop transitions, 34 changer transitions 0/151 dead transitions. [2024-01-31 16:12:09,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 151 transitions, 1284 flow [2024-01-31 16:12:09,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 16:12:09,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 16:12:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 294 transitions. [2024-01-31 16:12:09,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3310810810810811 [2024-01-31 16:12:09,313 INFO L175 Difference]: Start difference. First operand has 138 places, 118 transitions, 831 flow. Second operand 8 states and 294 transitions. [2024-01-31 16:12:09,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 151 transitions, 1284 flow [2024-01-31 16:12:09,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 151 transitions, 1243 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-01-31 16:12:09,324 INFO L231 Difference]: Finished difference. Result has 144 places, 126 transitions, 969 flow [2024-01-31 16:12:09,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=969, PETRI_PLACES=144, PETRI_TRANSITIONS=126} [2024-01-31 16:12:09,325 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 29 predicate places. [2024-01-31 16:12:09,325 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 126 transitions, 969 flow [2024-01-31 16:12:09,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 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-01-31 16:12:09,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:09,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:09,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-01-31 16:12:09,326 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:09,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:09,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1930508408, now seen corresponding path program 2 times [2024-01-31 16:12:09,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:09,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625808961] [2024-01-31 16:12:09,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:09,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:09,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:09,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625808961] [2024-01-31 16:12:09,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625808961] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:09,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:09,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:12:09,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696282939] [2024-01-31 16:12:09,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:09,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 16:12:09,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:09,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 16:12:09,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:12:09,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:09,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 126 transitions, 969 flow. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 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-01-31 16:12:09,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:09,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:09,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:09,908 INFO L124 PetriNetUnfolderBase]: 1397/2584 cut-off events. [2024-01-31 16:12:09,908 INFO L125 PetriNetUnfolderBase]: For 4654/4707 co-relation queries the response was YES. [2024-01-31 16:12:09,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7695 conditions, 2584 events. 1397/2584 cut-off events. For 4654/4707 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 14866 event pairs, 492 based on Foata normal form. 19/2283 useless extension candidates. Maximal degree in co-relation 7646. Up to 1787 conditions per place. [2024-01-31 16:12:09,920 INFO L140 encePairwiseOnDemand]: 101/111 looper letters, 99 selfloop transitions, 37 changer transitions 0/151 dead transitions. [2024-01-31 16:12:09,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 151 transitions, 1363 flow [2024-01-31 16:12:09,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 16:12:09,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 16:12:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 292 transitions. [2024-01-31 16:12:09,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32882882882882886 [2024-01-31 16:12:09,922 INFO L175 Difference]: Start difference. First operand has 144 places, 126 transitions, 969 flow. Second operand 8 states and 292 transitions. [2024-01-31 16:12:09,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 151 transitions, 1363 flow [2024-01-31 16:12:09,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 151 transitions, 1317 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-01-31 16:12:09,931 INFO L231 Difference]: Finished difference. Result has 150 places, 129 transitions, 1046 flow [2024-01-31 16:12:09,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1046, PETRI_PLACES=150, PETRI_TRANSITIONS=129} [2024-01-31 16:12:09,932 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 35 predicate places. [2024-01-31 16:12:09,932 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 129 transitions, 1046 flow [2024-01-31 16:12:09,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 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-01-31 16:12:09,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:09,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:09,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-01-31 16:12:09,933 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:09,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:09,933 INFO L85 PathProgramCache]: Analyzing trace with hash 357732288, now seen corresponding path program 3 times [2024-01-31 16:12:09,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:09,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145630930] [2024-01-31 16:12:09,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:09,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:10,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:10,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145630930] [2024-01-31 16:12:10,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145630930] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:10,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:10,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:12:10,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542369359] [2024-01-31 16:12:10,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:10,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 16:12:10,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:10,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 16:12:10,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:12:10,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:10,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 129 transitions, 1046 flow. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 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-01-31 16:12:10,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:10,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:10,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:10,536 INFO L124 PetriNetUnfolderBase]: 1394/2579 cut-off events. [2024-01-31 16:12:10,537 INFO L125 PetriNetUnfolderBase]: For 4982/5035 co-relation queries the response was YES. [2024-01-31 16:12:10,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7740 conditions, 2579 events. 1394/2579 cut-off events. For 4982/5035 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 14889 event pairs, 492 based on Foata normal form. 19/2278 useless extension candidates. Maximal degree in co-relation 7688. Up to 1787 conditions per place. [2024-01-31 16:12:10,548 INFO L140 encePairwiseOnDemand]: 101/111 looper letters, 102 selfloop transitions, 39 changer transitions 0/156 dead transitions. [2024-01-31 16:12:10,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 156 transitions, 1426 flow [2024-01-31 16:12:10,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 16:12:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 16:12:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 295 transitions. [2024-01-31 16:12:10,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3322072072072072 [2024-01-31 16:12:10,550 INFO L175 Difference]: Start difference. First operand has 150 places, 129 transitions, 1046 flow. Second operand 8 states and 295 transitions. [2024-01-31 16:12:10,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 156 transitions, 1426 flow [2024-01-31 16:12:10,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 156 transitions, 1369 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-01-31 16:12:10,559 INFO L231 Difference]: Finished difference. Result has 154 places, 129 transitions, 1072 flow [2024-01-31 16:12:10,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1072, PETRI_PLACES=154, PETRI_TRANSITIONS=129} [2024-01-31 16:12:10,560 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 39 predicate places. [2024-01-31 16:12:10,560 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 129 transitions, 1072 flow [2024-01-31 16:12:10,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 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-01-31 16:12:10,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:10,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:10,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-01-31 16:12:10,560 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:10,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1733934478, now seen corresponding path program 4 times [2024-01-31 16:12:10,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:10,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209042763] [2024-01-31 16:12:10,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:10,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:10,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:10,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:10,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209042763] [2024-01-31 16:12:10,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209042763] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:10,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:10,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:12:10,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323876169] [2024-01-31 16:12:10,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:10,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 16:12:10,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:10,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 16:12:10,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:12:10,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:10,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 129 transitions, 1072 flow. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 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-01-31 16:12:10,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:10,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:10,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:11,269 INFO L124 PetriNetUnfolderBase]: 1411/2599 cut-off events. [2024-01-31 16:12:11,269 INFO L125 PetriNetUnfolderBase]: For 5394/5447 co-relation queries the response was YES. [2024-01-31 16:12:11,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7833 conditions, 2599 events. 1411/2599 cut-off events. For 5394/5447 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 15062 event pairs, 495 based on Foata normal form. 19/2295 useless extension candidates. Maximal degree in co-relation 7781. Up to 1791 conditions per place. [2024-01-31 16:12:11,284 INFO L140 encePairwiseOnDemand]: 98/111 looper letters, 101 selfloop transitions, 39 changer transitions 0/155 dead transitions. [2024-01-31 16:12:11,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 155 transitions, 1478 flow [2024-01-31 16:12:11,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 16:12:11,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 16:12:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 294 transitions. [2024-01-31 16:12:11,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3310810810810811 [2024-01-31 16:12:11,293 INFO L175 Difference]: Start difference. First operand has 154 places, 129 transitions, 1072 flow. Second operand 8 states and 294 transitions. [2024-01-31 16:12:11,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 155 transitions, 1478 flow [2024-01-31 16:12:11,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 155 transitions, 1401 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-01-31 16:12:11,322 INFO L231 Difference]: Finished difference. Result has 159 places, 135 transitions, 1149 flow [2024-01-31 16:12:11,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1149, PETRI_PLACES=159, PETRI_TRANSITIONS=135} [2024-01-31 16:12:11,323 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 44 predicate places. [2024-01-31 16:12:11,323 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 135 transitions, 1149 flow [2024-01-31 16:12:11,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 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-01-31 16:12:11,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:11,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:11,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-01-31 16:12:11,324 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:11,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:11,340 INFO L85 PathProgramCache]: Analyzing trace with hash -949804910, now seen corresponding path program 1 times [2024-01-31 16:12:11,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:11,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322479314] [2024-01-31 16:12:11,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:11,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:11,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:11,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322479314] [2024-01-31 16:12:11,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322479314] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:11,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:11,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:12:11,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997433648] [2024-01-31 16:12:11,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:11,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 16:12:11,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:11,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 16:12:11,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:12:11,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:11,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 135 transitions, 1149 flow. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 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-01-31 16:12:11,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:11,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:11,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:12,163 INFO L124 PetriNetUnfolderBase]: 1474/2701 cut-off events. [2024-01-31 16:12:12,163 INFO L125 PetriNetUnfolderBase]: For 5781/5860 co-relation queries the response was YES. [2024-01-31 16:12:12,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8376 conditions, 2701 events. 1474/2701 cut-off events. For 5781/5860 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 15996 event pairs, 689 based on Foata normal form. 26/2330 useless extension candidates. Maximal degree in co-relation 8146. Up to 1854 conditions per place. [2024-01-31 16:12:12,178 INFO L140 encePairwiseOnDemand]: 99/111 looper letters, 123 selfloop transitions, 31 changer transitions 0/173 dead transitions. [2024-01-31 16:12:12,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 173 transitions, 1612 flow [2024-01-31 16:12:12,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 16:12:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 16:12:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 276 transitions. [2024-01-31 16:12:12,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3552123552123552 [2024-01-31 16:12:12,179 INFO L175 Difference]: Start difference. First operand has 159 places, 135 transitions, 1149 flow. Second operand 7 states and 276 transitions. [2024-01-31 16:12:12,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 173 transitions, 1612 flow [2024-01-31 16:12:12,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 173 transitions, 1569 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-01-31 16:12:12,191 INFO L231 Difference]: Finished difference. Result has 164 places, 141 transitions, 1220 flow [2024-01-31 16:12:12,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1106, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1220, PETRI_PLACES=164, PETRI_TRANSITIONS=141} [2024-01-31 16:12:12,191 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 49 predicate places. [2024-01-31 16:12:12,192 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 141 transitions, 1220 flow [2024-01-31 16:12:12,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 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-01-31 16:12:12,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:12,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:12,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-01-31 16:12:12,192 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:12,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:12,193 INFO L85 PathProgramCache]: Analyzing trace with hash -210045352, now seen corresponding path program 2 times [2024-01-31 16:12:12,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:12,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933623204] [2024-01-31 16:12:12,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:12,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:12,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:12,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:12,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933623204] [2024-01-31 16:12:12,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933623204] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:12,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:12,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:12:12,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236786579] [2024-01-31 16:12:12,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:12,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 16:12:12,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:12,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 16:12:12,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:12:12,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:12,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 141 transitions, 1220 flow. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 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-01-31 16:12:12,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:12,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:12,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:12,872 INFO L124 PetriNetUnfolderBase]: 1485/2724 cut-off events. [2024-01-31 16:12:12,872 INFO L125 PetriNetUnfolderBase]: For 6167/6239 co-relation queries the response was YES. [2024-01-31 16:12:12,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8651 conditions, 2724 events. 1485/2724 cut-off events. For 6167/6239 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 16087 event pairs, 698 based on Foata normal form. 28/2368 useless extension candidates. Maximal degree in co-relation 8421. Up to 1856 conditions per place. [2024-01-31 16:12:12,888 INFO L140 encePairwiseOnDemand]: 102/111 looper letters, 119 selfloop transitions, 32 changer transitions 0/170 dead transitions. [2024-01-31 16:12:12,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 170 transitions, 1654 flow [2024-01-31 16:12:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 16:12:12,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 16:12:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 267 transitions. [2024-01-31 16:12:12,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3436293436293436 [2024-01-31 16:12:12,890 INFO L175 Difference]: Start difference. First operand has 164 places, 141 transitions, 1220 flow. Second operand 7 states and 267 transitions. [2024-01-31 16:12:12,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 170 transitions, 1654 flow [2024-01-31 16:12:12,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 170 transitions, 1615 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-01-31 16:12:12,905 INFO L231 Difference]: Finished difference. Result has 169 places, 145 transitions, 1291 flow [2024-01-31 16:12:12,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1291, PETRI_PLACES=169, PETRI_TRANSITIONS=145} [2024-01-31 16:12:12,905 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 54 predicate places. [2024-01-31 16:12:12,905 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 145 transitions, 1291 flow [2024-01-31 16:12:12,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 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-01-31 16:12:12,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:12,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:12,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-01-31 16:12:12,906 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:12,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:12,906 INFO L85 PathProgramCache]: Analyzing trace with hash -208316482, now seen corresponding path program 3 times [2024-01-31 16:12:12,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:12,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354509746] [2024-01-31 16:12:12,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:12,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:13,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:13,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354509746] [2024-01-31 16:12:13,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354509746] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:13,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:13,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:12:13,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169581443] [2024-01-31 16:12:13,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:13,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 16:12:13,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:13,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 16:12:13,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:12:13,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:13,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 145 transitions, 1291 flow. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 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-01-31 16:12:13,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:13,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:13,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:13,572 INFO L124 PetriNetUnfolderBase]: 1482/2719 cut-off events. [2024-01-31 16:12:13,572 INFO L125 PetriNetUnfolderBase]: For 6523/6595 co-relation queries the response was YES. [2024-01-31 16:12:13,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8702 conditions, 2719 events. 1482/2719 cut-off events. For 6523/6595 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 16109 event pairs, 700 based on Foata normal form. 22/2357 useless extension candidates. Maximal degree in co-relation 8534. Up to 1856 conditions per place. [2024-01-31 16:12:13,586 INFO L140 encePairwiseOnDemand]: 102/111 looper letters, 117 selfloop transitions, 33 changer transitions 0/169 dead transitions. [2024-01-31 16:12:13,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 169 transitions, 1679 flow [2024-01-31 16:12:13,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 16:12:13,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 16:12:13,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 265 transitions. [2024-01-31 16:12:13,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3410553410553411 [2024-01-31 16:12:13,587 INFO L175 Difference]: Start difference. First operand has 169 places, 145 transitions, 1291 flow. Second operand 7 states and 265 transitions. [2024-01-31 16:12:13,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 169 transitions, 1679 flow [2024-01-31 16:12:13,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 169 transitions, 1628 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-01-31 16:12:13,598 INFO L231 Difference]: Finished difference. Result has 173 places, 145 transitions, 1311 flow [2024-01-31 16:12:13,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1311, PETRI_PLACES=173, PETRI_TRANSITIONS=145} [2024-01-31 16:12:13,599 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 58 predicate places. [2024-01-31 16:12:13,599 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 145 transitions, 1311 flow [2024-01-31 16:12:13,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 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-01-31 16:12:13,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:13,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:13,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-01-31 16:12:13,600 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:13,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:13,600 INFO L85 PathProgramCache]: Analyzing trace with hash 17444766, now seen corresponding path program 1 times [2024-01-31 16:12:13,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:13,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227503542] [2024-01-31 16:12:13,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:13,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:13,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:13,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227503542] [2024-01-31 16:12:13,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227503542] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:13,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:13,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:12:13,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095083487] [2024-01-31 16:12:13,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:13,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 16:12:13,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:13,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 16:12:13,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-01-31 16:12:13,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 111 [2024-01-31 16:12:13,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 145 transitions, 1311 flow. Second operand has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 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-01-31 16:12:13,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:13,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 111 [2024-01-31 16:12:13,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:14,264 INFO L124 PetriNetUnfolderBase]: 1453/2690 cut-off events. [2024-01-31 16:12:14,264 INFO L125 PetriNetUnfolderBase]: For 6640/6717 co-relation queries the response was YES. [2024-01-31 16:12:14,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8560 conditions, 2690 events. 1453/2690 cut-off events. For 6640/6717 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 15604 event pairs, 623 based on Foata normal form. 29/2391 useless extension candidates. Maximal degree in co-relation 8498. Up to 1861 conditions per place. [2024-01-31 16:12:14,280 INFO L140 encePairwiseOnDemand]: 102/111 looper letters, 129 selfloop transitions, 33 changer transitions 0/180 dead transitions. [2024-01-31 16:12:14,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 180 transitions, 1757 flow [2024-01-31 16:12:14,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 16:12:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 16:12:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 299 transitions. [2024-01-31 16:12:14,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3367117117117117 [2024-01-31 16:12:14,282 INFO L175 Difference]: Start difference. First operand has 173 places, 145 transitions, 1311 flow. Second operand 8 states and 299 transitions. [2024-01-31 16:12:14,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 180 transitions, 1757 flow [2024-01-31 16:12:14,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 180 transitions, 1685 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-01-31 16:12:14,294 INFO L231 Difference]: Finished difference. Result has 175 places, 145 transitions, 1312 flow [2024-01-31 16:12:14,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1312, PETRI_PLACES=175, PETRI_TRANSITIONS=145} [2024-01-31 16:12:14,294 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 60 predicate places. [2024-01-31 16:12:14,295 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 145 transitions, 1312 flow [2024-01-31 16:12:14,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 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-01-31 16:12:14,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:14,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:14,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-01-31 16:12:14,295 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 113 more)] === [2024-01-31 16:12:14,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash -418825243, now seen corresponding path program 1 times [2024-01-31 16:12:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:14,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224180490] [2024-01-31 16:12:14,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:14,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:12:14,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 16:12:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:12:14,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 16:12:14,378 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 16:12:14,378 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 116 remaining) [2024-01-31 16:12:14,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 116 remaining) [2024-01-31 16:12:14,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 116 remaining) [2024-01-31 16:12:14,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 116 remaining) [2024-01-31 16:12:14,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 116 remaining) [2024-01-31 16:12:14,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 116 remaining) [2024-01-31 16:12:14,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 116 remaining) [2024-01-31 16:12:14,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 116 remaining) [2024-01-31 16:12:14,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 116 remaining) [2024-01-31 16:12:14,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 116 remaining) [2024-01-31 16:12:14,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 116 remaining) [2024-01-31 16:12:14,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 116 remaining) [2024-01-31 16:12:14,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 116 remaining) [2024-01-31 16:12:14,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 116 remaining) [2024-01-31 16:12:14,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 116 remaining) [2024-01-31 16:12:14,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 116 remaining) [2024-01-31 16:12:14,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 116 remaining) [2024-01-31 16:12:14,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 116 remaining) [2024-01-31 16:12:14,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 116 remaining) [2024-01-31 16:12:14,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 116 remaining) [2024-01-31 16:12:14,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 116 remaining) [2024-01-31 16:12:14,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 116 remaining) [2024-01-31 16:12:14,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 116 remaining) [2024-01-31 16:12:14,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 116 remaining) [2024-01-31 16:12:14,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 116 remaining) [2024-01-31 16:12:14,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 116 remaining) [2024-01-31 16:12:14,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err25ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 116 remaining) [2024-01-31 16:12:14,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err26ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 116 remaining) [2024-01-31 16:12:14,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err27ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 116 remaining) [2024-01-31 16:12:14,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 116 remaining) [2024-01-31 16:12:14,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 116 remaining) [2024-01-31 16:12:14,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 116 remaining) [2024-01-31 16:12:14,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 116 remaining) [2024-01-31 16:12:14,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 116 remaining) [2024-01-31 16:12:14,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 116 remaining) [2024-01-31 16:12:14,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 116 remaining) [2024-01-31 16:12:14,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 116 remaining) [2024-01-31 16:12:14,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 116 remaining) [2024-01-31 16:12:14,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 116 remaining) [2024-01-31 16:12:14,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 116 remaining) [2024-01-31 16:12:14,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 116 remaining) [2024-01-31 16:12:14,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 116 remaining) [2024-01-31 16:12:14,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 116 remaining) [2024-01-31 16:12:14,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 116 remaining) [2024-01-31 16:12:14,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 116 remaining) [2024-01-31 16:12:14,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 116 remaining) [2024-01-31 16:12:14,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 116 remaining) [2024-01-31 16:12:14,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 116 remaining) [2024-01-31 16:12:14,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 116 remaining) [2024-01-31 16:12:14,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 116 remaining) [2024-01-31 16:12:14,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 116 remaining) [2024-01-31 16:12:14,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 116 remaining) [2024-01-31 16:12:14,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 116 remaining) [2024-01-31 16:12:14,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 116 remaining) [2024-01-31 16:12:14,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 116 remaining) [2024-01-31 16:12:14,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err26ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 116 remaining) [2024-01-31 16:12:14,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err27ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 116 remaining) [2024-01-31 16:12:14,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 116 remaining) [2024-01-31 16:12:14,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (57 of 116 remaining) [2024-01-31 16:12:14,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 116 remaining) [2024-01-31 16:12:14,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 116 remaining) [2024-01-31 16:12:14,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 116 remaining) [2024-01-31 16:12:14,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 116 remaining) [2024-01-31 16:12:14,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 116 remaining) [2024-01-31 16:12:14,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 116 remaining) [2024-01-31 16:12:14,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 116 remaining) [2024-01-31 16:12:14,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 116 remaining) [2024-01-31 16:12:14,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 116 remaining) [2024-01-31 16:12:14,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 116 remaining) [2024-01-31 16:12:14,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 116 remaining) [2024-01-31 16:12:14,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 116 remaining) [2024-01-31 16:12:14,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 116 remaining) [2024-01-31 16:12:14,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 116 remaining) [2024-01-31 16:12:14,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 116 remaining) [2024-01-31 16:12:14,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 116 remaining) [2024-01-31 16:12:14,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 116 remaining) [2024-01-31 16:12:14,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 116 remaining) [2024-01-31 16:12:14,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 116 remaining) [2024-01-31 16:12:14,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 116 remaining) [2024-01-31 16:12:14,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 116 remaining) [2024-01-31 16:12:14,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 116 remaining) [2024-01-31 16:12:14,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 116 remaining) [2024-01-31 16:12:14,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 116 remaining) [2024-01-31 16:12:14,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 116 remaining) [2024-01-31 16:12:14,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 116 remaining) [2024-01-31 16:12:14,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err25ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 116 remaining) [2024-01-31 16:12:14,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err26ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 116 remaining) [2024-01-31 16:12:14,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err27ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 116 remaining) [2024-01-31 16:12:14,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 116 remaining) [2024-01-31 16:12:14,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 116 remaining) [2024-01-31 16:12:14,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 116 remaining) [2024-01-31 16:12:14,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 116 remaining) [2024-01-31 16:12:14,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 116 remaining) [2024-01-31 16:12:14,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 116 remaining) [2024-01-31 16:12:14,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 116 remaining) [2024-01-31 16:12:14,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 116 remaining) [2024-01-31 16:12:14,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 116 remaining) [2024-01-31 16:12:14,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 116 remaining) [2024-01-31 16:12:14,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 116 remaining) [2024-01-31 16:12:14,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 116 remaining) [2024-01-31 16:12:14,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 116 remaining) [2024-01-31 16:12:14,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 116 remaining) [2024-01-31 16:12:14,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 116 remaining) [2024-01-31 16:12:14,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 116 remaining) [2024-01-31 16:12:14,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 116 remaining) [2024-01-31 16:12:14,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 116 remaining) [2024-01-31 16:12:14,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 116 remaining) [2024-01-31 16:12:14,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 116 remaining) [2024-01-31 16:12:14,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 116 remaining) [2024-01-31 16:12:14,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 116 remaining) [2024-01-31 16:12:14,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 116 remaining) [2024-01-31 16:12:14,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 116 remaining) [2024-01-31 16:12:14,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 116 remaining) [2024-01-31 16:12:14,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 116 remaining) [2024-01-31 16:12:14,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err26ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 116 remaining) [2024-01-31 16:12:14,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err27ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 116 remaining) [2024-01-31 16:12:14,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-01-31 16:12:14,393 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:12:14,398 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 16:12:14,398 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 16:12:14,417 INFO L503 ceAbstractionStarter]: Automizer considered 57 witness invariants [2024-01-31 16:12:14,417 INFO L504 ceAbstractionStarter]: WitnessConsidered=57 [2024-01-31 16:12:14,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:12:14 BasicIcfg [2024-01-31 16:12:14,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 16:12:14,418 INFO L158 Benchmark]: Toolchain (without parser) took 19265.84ms. Allocated memory was 161.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 127.5MB in the beginning and 846.3MB in the end (delta: -718.8MB). Peak memory consumption was 373.0MB. Max. memory is 16.1GB. [2024-01-31 16:12:14,418 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 161.5MB. Free memory was 118.9MB in the beginning and 118.7MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:12:14,418 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 161.5MB. Free memory was 120.4MB in the beginning and 120.2MB in the end (delta: 181.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:12:14,419 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.64ms. Allocated memory is still 161.5MB. Free memory was 127.5MB in the beginning and 96.8MB in the end (delta: 30.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-01-31 16:12:14,419 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.02ms. Allocated memory is still 161.5MB. Free memory was 96.8MB in the beginning and 93.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 16:12:14,419 INFO L158 Benchmark]: Boogie Preprocessor took 59.61ms. Allocated memory is still 161.5MB. Free memory was 93.4MB in the beginning and 90.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 16:12:14,419 INFO L158 Benchmark]: RCFGBuilder took 912.10ms. Allocated memory is still 161.5MB. Free memory was 90.5MB in the beginning and 61.7MB in the end (delta: 28.8MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-01-31 16:12:14,419 INFO L158 Benchmark]: TraceAbstraction took 17794.09ms. Allocated memory was 161.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 60.7MB in the beginning and 846.3MB in the end (delta: -785.7MB). Peak memory consumption was 305.9MB. Max. memory is 16.1GB. [2024-01-31 16:12:14,420 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.17ms. Allocated memory is still 161.5MB. Free memory was 118.9MB in the beginning and 118.7MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.16ms. Allocated memory is still 161.5MB. Free memory was 120.4MB in the beginning and 120.2MB in the end (delta: 181.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 435.64ms. Allocated memory is still 161.5MB. Free memory was 127.5MB in the beginning and 96.8MB in the end (delta: 30.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.02ms. Allocated memory is still 161.5MB. Free memory was 96.8MB in the beginning and 93.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.61ms. Allocated memory is still 161.5MB. Free memory was 93.4MB in the beginning and 90.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 912.10ms. Allocated memory is still 161.5MB. Free memory was 90.5MB in the beginning and 61.7MB in the end (delta: 28.8MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17794.09ms. Allocated memory was 161.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 60.7MB in the beginning and 846.3MB in the end (delta: -785.7MB). Peak memory consumption was 305.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 59]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] 0 _Bool e1, e2; [L39] 0 int n1, n2, tmp1, tmp2, i, i1, i2; [L107] 0 pthread_t t1, t2; VAL [e1=0, e2=0, i=0, i=0, i=0, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L110] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]],BinaryExpression[COMPEQ,IdentifierExpression[n1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[tmp1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[tmp2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]]]] [L110] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [e1=0, e2=0, i=0, i=0, i=0, n1=0, n2=0, t1={3:0}, t2={5:0}, tmp1=0, tmp2=0] [L43] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=0, e2=0, i=0, i=0, i=0, n1=0, n2=0, tmp1=0, tmp2=0] [L44] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L44] 1 e1 = 1 [L45] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=1, e2=0, i=0, i=0, i=0, n1=0, n2=0, tmp1=0, tmp2=0] [L46] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=1, e2=0, i=0, i=0, i=0, n1=0, n2=0, tmp1=0, tmp2=0] [L47] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L47] 1 tmp1 = n2 [L48] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=1, e2=0, i=0, i=0, i=0, n1=0, n2=0, tmp1=0, tmp2=0] [L49] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=1, e2=0, i=0, i=0, i=0, n1=0, n2=0, tmp1=0, tmp2=0] [L50] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L50] 1 n1 = tmp1 + 1 [L51] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[n1]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L52] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=1, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L53] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L53] 1 e1 = 0 [L54] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L55] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L56] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] [L56] CALL 1 assume_abort_if_not(!e2) [L35] COND FALSE 1 !(!cond) [L56] RET 1 assume_abort_if_not(!e2) [L57] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L58] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] [L59] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[n1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[tmp2]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i1]]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i2]]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[n2]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]],BinaryExpression[COMPNEQ,IdentifierExpression[n2],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[e2],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] VAL [_argptr={0:0}, _argptr={0:0}, e1=0, e2=0, i=0, i=0, i=0, n1=1, n2=0, tmp1=0, tmp2=0] - UnprovableResult [Line: 43]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 100]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 103]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 110]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 111]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 110]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 212 locations, 116 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.6s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2636 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2121 mSDsluCounter, 1229 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 913 mSDsCounter, 626 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6089 IncrementalHoareTripleChecker+Invalid, 6715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 626 mSolverCounterUnsat, 316 mSDtfsCounter, 6089 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1312occurred in iteration=27, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 8922 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-31 16:12:14,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE