./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe017_tso.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe017_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 958ec4d9 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_tso.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe017_tso.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-dev-958ec4d-m [2024-02-07 14:24:27,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:24:27,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 14:24:27,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:24:27,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:24:27,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:24:27,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:24:27,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:24:27,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:24:27,648 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:24:27,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:24:27,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:24:27,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:24:27,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:24:27,650 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:24:27,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:24:27,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:24:27,651 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:24:27,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:24:27,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:24:27,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:24:27,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:24:27,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:24:27,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:24:27,652 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:24:27,652 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:24:27,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:24:27,653 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:24:27,653 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:24:27,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:24:27,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:24:27,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:24:27,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:24:27,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:24:27,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:24:27,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:24:27,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:24:27,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:24:27,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:24:27,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:24:27,656 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:24:27,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:24:27,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:24:27,657 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-02-07 14:24:27,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:24:27,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:24:27,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:24:27,867 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:24:27,867 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:24:27,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_tso.i [2024-02-07 14:24:29,068 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:24:29,274 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:24:29,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_tso.i [2024-02-07 14:24:29,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f62557361/d12bc518f39649c996b3743fe687d6a1/FLAG076b38f6d [2024-02-07 14:24:29,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f62557361/d12bc518f39649c996b3743fe687d6a1 [2024-02-07 14:24:29,310 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:24:29,311 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:24:29,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe017_tso.yml/witness.yml [2024-02-07 14:24:29,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:24:29,409 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:24:29,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:24:29,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:24:29,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:24:29,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:24:29" (1/2) ... [2024-02-07 14:24:29,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b51e15f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:29, skipping insertion in model container [2024-02-07 14:24:29,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:24:29" (1/2) ... [2024-02-07 14:24:29,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@69923bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:24:29, skipping insertion in model container [2024-02-07 14:24:29,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:24:29" (2/2) ... [2024-02-07 14:24:29,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b51e15f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:29, skipping insertion in model container [2024-02-07 14:24:29,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:24:29" (2/2) ... [2024-02-07 14:24:29,418 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:24:29,465 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:24:29,466 INFO L76 edCorrectnessWitness]: Location invariant before [L730-L730] 1 <= __unbuffered_cnt [2024-02-07 14:24:29,467 INFO L76 edCorrectnessWitness]: Location invariant before [L749-L749] (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2) [2024-02-07 14:24:29,467 INFO L76 edCorrectnessWitness]: Location invariant before [L784-L784] (((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (x == 2)) && (y == 2 || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2) [2024-02-07 14:24:29,467 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 14:24:29,467 INFO L76 edCorrectnessWitness]: Location invariant before [L752-L752] y == 1 [2024-02-07 14:24:29,468 INFO L76 edCorrectnessWitness]: Location invariant before [L748-L748] (((0 <= x) && (x <= 2)) && (x <= 127)) && ((x == 0 || x == 1) || x == 2) [2024-02-07 14:24:29,468 INFO L76 edCorrectnessWitness]: Location invariant before [L785-L785] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:24:29,468 INFO L76 edCorrectnessWitness]: Location invariant before [L742-L742] 1 <= __unbuffered_cnt [2024-02-07 14:24:29,468 INFO L76 edCorrectnessWitness]: Location invariant before [L722-L722] y == 2 [2024-02-07 14:24:29,468 INFO L76 edCorrectnessWitness]: Location invariant before [L779-L779] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:24:29,468 INFO L76 edCorrectnessWitness]: Location invariant before [L786-L786] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:24:29,469 INFO L76 edCorrectnessWitness]: Location invariant before [L757-L757] 1 <= __unbuffered_cnt [2024-02-07 14:24:29,469 INFO L76 edCorrectnessWitness]: Location invariant before [L778-L778] 0 <= __unbuffered_cnt [2024-02-07 14:24:29,469 INFO L76 edCorrectnessWitness]: Location invariant before [L737-L737] x == 2 [2024-02-07 14:24:29,469 INFO L76 edCorrectnessWitness]: Location invariant before [L780-L780] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:24:29,469 INFO L76 edCorrectnessWitness]: Location invariant before [L741-L741] 0 <= __unbuffered_cnt [2024-02-07 14:24:29,469 INFO L76 edCorrectnessWitness]: Location invariant before [L729-L729] 0 <= __unbuffered_cnt [2024-02-07 14:24:29,469 INFO L76 edCorrectnessWitness]: Location invariant before [L725-L725] x == 1 [2024-02-07 14:24:29,470 INFO L76 edCorrectnessWitness]: Location invariant before [L756-L756] 0 <= __unbuffered_cnt [2024-02-07 14:24:29,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:24:29,705 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_tso.i[945,958] [2024-02-07 14:24:29,837 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:24:29,846 INFO L203 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 14:24:29,881 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_tso.i[945,958] 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-02-07 14:24:29,911 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:24:29,938 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:24:29,938 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:29 WrapperNode [2024-02-07 14:24:29,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:24:29,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:24:29,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:24:29,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:24:29,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:29" (1/1) ... [2024-02-07 14:24:29,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:29" (1/1) ... [2024-02-07 14:24:29,973 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 75 [2024-02-07 14:24:29,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:24:29,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:24:29,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:24:29,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:24:29,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:29" (1/1) ... [2024-02-07 14:24:29,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:29" (1/1) ... [2024-02-07 14:24:29,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:29" (1/1) ... [2024-02-07 14:24:29,994 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-07 14:24:29,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:29" (1/1) ... [2024-02-07 14:24:29,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:29" (1/1) ... [2024-02-07 14:24:30,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:29" (1/1) ... [2024-02-07 14:24:30,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:29" (1/1) ... [2024-02-07 14:24:30,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:29" (1/1) ... [2024-02-07 14:24:30,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:29" (1/1) ... [2024-02-07 14:24:30,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:24:30,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:24:30,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:24:30,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:24:30,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:29" (1/1) ... [2024-02-07 14:24:30,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:24:30,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:24:30,046 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-02-07 14:24:30,055 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-02-07 14:24:30,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:24:30,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:24:30,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:24:30,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 14:24:30,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 14:24:30,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:24:30,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:24:30,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:24:30,079 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 14:24:30,080 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 14:24:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 14:24:30,080 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 14:24:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-07 14:24:30,080 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-07 14:24:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:24:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:24:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:24:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 14:24:30,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 14:24:30,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:24:30,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:24:30,082 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 14:24:30,203 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:24:30,205 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:24:30,385 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:24:30,385 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:24:30,515 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:24:30,515 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 14:24:30,516 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:24:30 BoogieIcfgContainer [2024-02-07 14:24:30,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:24:30,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:24:30,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:24:30,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:24:30,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:24:29" (1/4) ... [2024-02-07 14:24:30,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362a3190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:24:30, skipping insertion in model container [2024-02-07 14:24:30,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:24:29" (2/4) ... [2024-02-07 14:24:30,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362a3190 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:24:30, skipping insertion in model container [2024-02-07 14:24:30,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:24:29" (3/4) ... [2024-02-07 14:24:30,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362a3190 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:24:30, skipping insertion in model container [2024-02-07 14:24:30,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:24:30" (4/4) ... [2024-02-07 14:24:30,548 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_tso.i [2024-02-07 14:24:30,561 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:24:30,561 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-02-07 14:24:30,562 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:24:30,619 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 14:24:30,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 57 transitions, 126 flow [2024-02-07 14:24:30,688 INFO L124 PetriNetUnfolderBase]: 1/54 cut-off events. [2024-02-07 14:24:30,689 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:24:30,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 54 events. 1/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 151 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2024-02-07 14:24:30,693 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 57 transitions, 126 flow [2024-02-07 14:24:30,698 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 54 transitions, 117 flow [2024-02-07 14:24:30,713 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:24:30,721 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;@2444af81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:24:30,722 INFO L358 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-02-07 14:24:30,725 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:24:30,726 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 14:24:30,726 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:24:30,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:30,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 14:24:30,728 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 32 more)] === [2024-02-07 14:24:30,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:30,735 INFO L85 PathProgramCache]: Analyzing trace with hash 9106075, now seen corresponding path program 1 times [2024-02-07 14:24:30,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:30,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025004055] [2024-02-07 14:24:30,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:30,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:30,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:30,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025004055] [2024-02-07 14:24:30,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025004055] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:30,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:30,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:30,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552227768] [2024-02-07 14:24:30,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:30,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-07 14:24:30,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:30,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-07 14:24:30,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-07 14:24:31,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-02-07 14:24:31,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 117 flow. Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-02-07 14:24:31,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:31,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-02-07 14:24:31,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:31,839 INFO L124 PetriNetUnfolderBase]: 4606/8098 cut-off events. [2024-02-07 14:24:31,840 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-02-07 14:24:31,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14746 conditions, 8098 events. 4606/8098 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 62731 event pairs, 4606 based on Foata normal form. 210/6117 useless extension candidates. Maximal degree in co-relation 14735. Up to 6570 conditions per place. [2024-02-07 14:24:31,892 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 29 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2024-02-07 14:24:31,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 153 flow [2024-02-07 14:24:31,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-07 14:24:31,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-07 14:24:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2024-02-07 14:24:31,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6491228070175439 [2024-02-07 14:24:31,904 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 117 flow. Second operand 2 states and 74 transitions. [2024-02-07 14:24:31,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 153 flow [2024-02-07 14:24:31,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 150 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 14:24:31,913 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 92 flow [2024-02-07 14:24:31,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2024-02-07 14:24:31,918 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -12 predicate places. [2024-02-07 14:24:31,918 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 92 flow [2024-02-07 14:24:31,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-02-07 14:24:31,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:31,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:31,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:24:31,919 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 32 more)] === [2024-02-07 14:24:31,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:31,919 INFO L85 PathProgramCache]: Analyzing trace with hash 696461450, now seen corresponding path program 1 times [2024-02-07 14:24:31,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:31,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333230986] [2024-02-07 14:24:31,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:31,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:32,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:32,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:32,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333230986] [2024-02-07 14:24:32,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333230986] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:32,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:32,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:32,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477648052] [2024-02-07 14:24:32,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:32,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:32,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:32,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:32,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:32,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-02-07 14:24:32,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:32,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:32,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-02-07 14:24:32,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:32,457 INFO L124 PetriNetUnfolderBase]: 3572/5394 cut-off events. [2024-02-07 14:24:32,457 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:24:32,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10630 conditions, 5394 events. 3572/5394 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 31934 event pairs, 1170 based on Foata normal form. 0/4242 useless extension candidates. Maximal degree in co-relation 10627. Up to 4600 conditions per place. [2024-02-07 14:24:32,485 INFO L140 encePairwiseOnDemand]: 49/57 looper letters, 45 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2024-02-07 14:24:32,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 234 flow [2024-02-07 14:24:32,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-02-07 14:24:32,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6081871345029239 [2024-02-07 14:24:32,488 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 92 flow. Second operand 3 states and 104 transitions. [2024-02-07 14:24:32,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 234 flow [2024-02-07 14:24:32,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 14:24:32,491 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 124 flow [2024-02-07 14:24:32,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-02-07 14:24:32,492 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -9 predicate places. [2024-02-07 14:24:32,492 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 124 flow [2024-02-07 14:24:32,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:32,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:32,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:32,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:24:32,493 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 32 more)] === [2024-02-07 14:24:32,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash -457328173, now seen corresponding path program 1 times [2024-02-07 14:24:32,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:32,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025680219] [2024-02-07 14:24:32,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:32,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:32,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:32,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:32,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025680219] [2024-02-07 14:24:32,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025680219] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:32,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:32,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:24:32,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733957306] [2024-02-07 14:24:32,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:32,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:32,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:32,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:32,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:32,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-02-07 14:24:32,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-02-07 14:24:32,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:32,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-02-07 14:24:32,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:32,977 INFO L124 PetriNetUnfolderBase]: 3442/6075 cut-off events. [2024-02-07 14:24:32,977 INFO L125 PetriNetUnfolderBase]: For 667/667 co-relation queries the response was YES. [2024-02-07 14:24:32,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12812 conditions, 6075 events. 3442/6075 cut-off events. For 667/667 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 43739 event pairs, 1572 based on Foata normal form. 0/4842 useless extension candidates. Maximal degree in co-relation 12807. Up to 4871 conditions per place. [2024-02-07 14:24:33,012 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 45 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2024-02-07 14:24:33,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 62 transitions, 261 flow [2024-02-07 14:24:33,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:33,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-02-07 14:24:33,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5730994152046783 [2024-02-07 14:24:33,018 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 124 flow. Second operand 3 states and 98 transitions. [2024-02-07 14:24:33,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 62 transitions, 261 flow [2024-02-07 14:24:33,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:33,021 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 141 flow [2024-02-07 14:24:33,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2024-02-07 14:24:33,022 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2024-02-07 14:24:33,022 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 141 flow [2024-02-07 14:24:33,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-02-07 14:24:33,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:33,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:33,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:24:33,023 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 32 more)] === [2024-02-07 14:24:33,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:33,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1292333265, now seen corresponding path program 1 times [2024-02-07 14:24:33,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:33,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050648106] [2024-02-07 14:24:33,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:33,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:33,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:33,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:33,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050648106] [2024-02-07 14:24:33,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050648106] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:33,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:33,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:33,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635008693] [2024-02-07 14:24:33,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:33,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:33,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:33,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:33,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:33,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-02-07 14:24:33,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-02-07 14:24:33,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:33,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-02-07 14:24:33,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:33,458 INFO L124 PetriNetUnfolderBase]: 3442/6071 cut-off events. [2024-02-07 14:24:33,458 INFO L125 PetriNetUnfolderBase]: For 1513/1513 co-relation queries the response was YES. [2024-02-07 14:24:33,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13530 conditions, 6071 events. 3442/6071 cut-off events. For 1513/1513 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 44828 event pairs, 2986 based on Foata normal form. 0/5101 useless extension candidates. Maximal degree in co-relation 13524. Up to 4997 conditions per place. [2024-02-07 14:24:33,491 INFO L140 encePairwiseOnDemand]: 55/57 looper letters, 33 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2024-02-07 14:24:33,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 207 flow [2024-02-07 14:24:33,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:33,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-02-07 14:24:33,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45614035087719296 [2024-02-07 14:24:33,493 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 141 flow. Second operand 3 states and 78 transitions. [2024-02-07 14:24:33,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 207 flow [2024-02-07 14:24:33,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 47 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:33,495 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 138 flow [2024-02-07 14:24:33,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2024-02-07 14:24:33,496 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2024-02-07 14:24:33,497 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 138 flow [2024-02-07 14:24:33,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-02-07 14:24:33,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:33,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:33,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:24:33,498 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 32 more)] === [2024-02-07 14:24:33,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:33,498 INFO L85 PathProgramCache]: Analyzing trace with hash -135580171, now seen corresponding path program 1 times [2024-02-07 14:24:33,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:33,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056448643] [2024-02-07 14:24:33,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:33,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:33,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-02-07 14:24:33,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:33,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056448643] [2024-02-07 14:24:33,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056448643] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:33,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:33,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:33,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278736628] [2024-02-07 14:24:33,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:33,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:33,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:33,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:33,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:33,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-02-07 14:24:33,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-02-07 14:24:33,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:33,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-02-07 14:24:33,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:34,089 INFO L124 PetriNetUnfolderBase]: 5057/8665 cut-off events. [2024-02-07 14:24:34,090 INFO L125 PetriNetUnfolderBase]: For 1913/1913 co-relation queries the response was YES. [2024-02-07 14:24:34,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19542 conditions, 8665 events. 5057/8665 cut-off events. For 1913/1913 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 64861 event pairs, 2267 based on Foata normal form. 177/7520 useless extension candidates. Maximal degree in co-relation 19536. Up to 4136 conditions per place. [2024-02-07 14:24:34,135 INFO L140 encePairwiseOnDemand]: 53/57 looper letters, 56 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2024-02-07 14:24:34,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 73 transitions, 336 flow [2024-02-07 14:24:34,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-02-07 14:24:34,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6140350877192983 [2024-02-07 14:24:34,137 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 138 flow. Second operand 3 states and 105 transitions. [2024-02-07 14:24:34,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 73 transitions, 336 flow [2024-02-07 14:24:34,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 335 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:34,140 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 167 flow [2024-02-07 14:24:34,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2024-02-07 14:24:34,142 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -4 predicate places. [2024-02-07 14:24:34,142 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 167 flow [2024-02-07 14:24:34,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-02-07 14:24:34,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:34,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:34,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 14:24:34,143 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 32 more)] === [2024-02-07 14:24:34,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:34,144 INFO L85 PathProgramCache]: Analyzing trace with hash -258943706, now seen corresponding path program 1 times [2024-02-07 14:24:34,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:34,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218414841] [2024-02-07 14:24:34,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:34,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:34,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:34,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218414841] [2024-02-07 14:24:34,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218414841] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:34,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:34,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:34,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702907033] [2024-02-07 14:24:34,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:34,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:34,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:34,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:34,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:34,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-02-07 14:24:34,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-02-07 14:24:34,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:34,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-02-07 14:24:34,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:34,585 INFO L124 PetriNetUnfolderBase]: 4366/7397 cut-off events. [2024-02-07 14:24:34,585 INFO L125 PetriNetUnfolderBase]: For 4166/4222 co-relation queries the response was YES. [2024-02-07 14:24:34,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17495 conditions, 7397 events. 4366/7397 cut-off events. For 4166/4222 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 53830 event pairs, 2319 based on Foata normal form. 254/6418 useless extension candidates. Maximal degree in co-relation 17488. Up to 3666 conditions per place. [2024-02-07 14:24:34,625 INFO L140 encePairwiseOnDemand]: 53/57 looper letters, 55 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2024-02-07 14:24:34,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 337 flow [2024-02-07 14:24:34,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-02-07 14:24:34,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6081871345029239 [2024-02-07 14:24:34,626 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 167 flow. Second operand 3 states and 104 transitions. [2024-02-07 14:24:34,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 337 flow [2024-02-07 14:24:34,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 324 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-07 14:24:34,630 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 140 flow [2024-02-07 14:24:34,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-02-07 14:24:34,630 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -6 predicate places. [2024-02-07 14:24:34,631 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 140 flow [2024-02-07 14:24:34,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-02-07 14:24:34,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:34,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:34,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 14:24:34,631 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 32 more)] === [2024-02-07 14:24:34,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:34,632 INFO L85 PathProgramCache]: Analyzing trace with hash -686709728, now seen corresponding path program 1 times [2024-02-07 14:24:34,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:34,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581617708] [2024-02-07 14:24:34,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:34,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:34,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:34,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581617708] [2024-02-07 14:24:34,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581617708] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:34,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:34,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:24:34,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782695225] [2024-02-07 14:24:34,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:34,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:24:34,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:34,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:24:34,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:24:34,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-02-07 14:24:34,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:34,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:34,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-02-07 14:24:34,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:35,064 INFO L124 PetriNetUnfolderBase]: 4295/7724 cut-off events. [2024-02-07 14:24:35,064 INFO L125 PetriNetUnfolderBase]: For 1983/1983 co-relation queries the response was YES. [2024-02-07 14:24:35,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17344 conditions, 7724 events. 4295/7724 cut-off events. For 1983/1983 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 60014 event pairs, 951 based on Foata normal form. 233/6631 useless extension candidates. Maximal degree in co-relation 17338. Up to 3693 conditions per place. [2024-02-07 14:24:35,105 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 57 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2024-02-07 14:24:35,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 75 transitions, 368 flow [2024-02-07 14:24:35,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:24:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:24:35,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2024-02-07 14:24:35,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5350877192982456 [2024-02-07 14:24:35,107 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 140 flow. Second operand 4 states and 122 transitions. [2024-02-07 14:24:35,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 75 transitions, 368 flow [2024-02-07 14:24:35,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 75 transitions, 346 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:35,109 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 158 flow [2024-02-07 14:24:35,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2024-02-07 14:24:35,110 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -3 predicate places. [2024-02-07 14:24:35,110 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 158 flow [2024-02-07 14:24:35,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:35,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:35,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:35,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 14:24:35,111 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 32 more)] === [2024-02-07 14:24:35,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:35,111 INFO L85 PathProgramCache]: Analyzing trace with hash -129049367, now seen corresponding path program 1 times [2024-02-07 14:24:35,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:35,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787559303] [2024-02-07 14:24:35,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:35,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:35,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:35,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787559303] [2024-02-07 14:24:35,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787559303] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:35,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:35,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:35,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002140919] [2024-02-07 14:24:35,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:35,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:24:35,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:35,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:24:35,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:24:35,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-02-07 14:24:35,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-02-07 14:24:35,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:35,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-02-07 14:24:35,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:35,377 INFO L124 PetriNetUnfolderBase]: 2232/4103 cut-off events. [2024-02-07 14:24:35,377 INFO L125 PetriNetUnfolderBase]: For 1735/1735 co-relation queries the response was YES. [2024-02-07 14:24:35,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9426 conditions, 4103 events. 2232/4103 cut-off events. For 1735/1735 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 28196 event pairs, 1092 based on Foata normal form. 124/4017 useless extension candidates. Maximal degree in co-relation 9419. Up to 3227 conditions per place. [2024-02-07 14:24:35,395 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 37 selfloop transitions, 3 changer transitions 2/55 dead transitions. [2024-02-07 14:24:35,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 262 flow [2024-02-07 14:24:35,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:24:35,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:24:35,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-02-07 14:24:35,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2024-02-07 14:24:35,397 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 158 flow. Second operand 3 states and 93 transitions. [2024-02-07 14:24:35,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 262 flow [2024-02-07 14:24:35,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:35,399 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 136 flow [2024-02-07 14:24:35,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2024-02-07 14:24:35,399 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2024-02-07 14:24:35,400 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 136 flow [2024-02-07 14:24:35,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-02-07 14:24:35,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:35,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:35,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 14:24:35,400 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 32 more)] === [2024-02-07 14:24:35,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:35,401 INFO L85 PathProgramCache]: Analyzing trace with hash -513661801, now seen corresponding path program 1 times [2024-02-07 14:24:35,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:35,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714843251] [2024-02-07 14:24:35,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:35,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:35,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:35,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714843251] [2024-02-07 14:24:35,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714843251] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:35,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:35,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:24:35,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97167520] [2024-02-07 14:24:35,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:35,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:24:35,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:35,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:24:35,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:24:35,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-02-07 14:24:35,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-02-07 14:24:35,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:35,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-02-07 14:24:35,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:35,692 INFO L124 PetriNetUnfolderBase]: 1805/3479 cut-off events. [2024-02-07 14:24:35,692 INFO L125 PetriNetUnfolderBase]: For 1311/1311 co-relation queries the response was YES. [2024-02-07 14:24:35,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7771 conditions, 3479 events. 1805/3479 cut-off events. For 1311/1311 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 24460 event pairs, 1185 based on Foata normal form. 2/3291 useless extension candidates. Maximal degree in co-relation 7764. Up to 2699 conditions per place. [2024-02-07 14:24:35,710 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 41 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2024-02-07 14:24:35,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 291 flow [2024-02-07 14:24:35,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:24:35,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:24:35,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-02-07 14:24:35,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2024-02-07 14:24:35,711 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 136 flow. Second operand 4 states and 111 transitions. [2024-02-07 14:24:35,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 291 flow [2024-02-07 14:24:35,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 60 transitions, 268 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-02-07 14:24:35,714 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 160 flow [2024-02-07 14:24:35,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-02-07 14:24:35,715 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -6 predicate places. [2024-02-07 14:24:35,715 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 160 flow [2024-02-07 14:24:35,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-02-07 14:24:35,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:35,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:35,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 14:24:35,716 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 32 more)] === [2024-02-07 14:24:35,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash 394843128, now seen corresponding path program 1 times [2024-02-07 14:24:35,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:35,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904919364] [2024-02-07 14:24:35,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:35,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:35,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:35,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904919364] [2024-02-07 14:24:35,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904919364] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:35,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:35,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:24:35,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379129012] [2024-02-07 14:24:35,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:35,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:24:35,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:35,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:24:35,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:24:35,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-02-07 14:24:35,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:35,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:35,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-02-07 14:24:35,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:35,983 INFO L124 PetriNetUnfolderBase]: 1360/2531 cut-off events. [2024-02-07 14:24:35,984 INFO L125 PetriNetUnfolderBase]: For 947/947 co-relation queries the response was YES. [2024-02-07 14:24:35,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5853 conditions, 2531 events. 1360/2531 cut-off events. For 947/947 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 15460 event pairs, 116 based on Foata normal form. 124/2553 useless extension candidates. Maximal degree in co-relation 5846. Up to 849 conditions per place. [2024-02-07 14:24:35,994 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 64 selfloop transitions, 8 changer transitions 1/86 dead transitions. [2024-02-07 14:24:35,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 86 transitions, 441 flow [2024-02-07 14:24:35,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:24:35,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:24:35,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-02-07 14:24:35,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052631578947369 [2024-02-07 14:24:35,996 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 160 flow. Second operand 5 states and 144 transitions. [2024-02-07 14:24:35,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 86 transitions, 441 flow [2024-02-07 14:24:35,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 434 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:35,999 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 203 flow [2024-02-07 14:24:35,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2024-02-07 14:24:35,999 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2024-02-07 14:24:35,999 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 203 flow [2024-02-07 14:24:36,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:36,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:36,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:36,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 14:24:36,000 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 32 more)] === [2024-02-07 14:24:36,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:36,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1567388835, now seen corresponding path program 1 times [2024-02-07 14:24:36,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:36,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691315300] [2024-02-07 14:24:36,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:36,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:36,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:36,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:36,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691315300] [2024-02-07 14:24:36,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691315300] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:36,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:36,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:24:36,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949861288] [2024-02-07 14:24:36,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:36,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:24:36,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:36,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:24:36,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:24:36,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-02-07 14:24:36,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:36,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:36,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-02-07 14:24:36,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:36,234 INFO L124 PetriNetUnfolderBase]: 1175/2180 cut-off events. [2024-02-07 14:24:36,235 INFO L125 PetriNetUnfolderBase]: For 2011/2011 co-relation queries the response was YES. [2024-02-07 14:24:36,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5740 conditions, 2180 events. 1175/2180 cut-off events. For 2011/2011 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 12823 event pairs, 131 based on Foata normal form. 4/2117 useless extension candidates. Maximal degree in co-relation 5731. Up to 1479 conditions per place. [2024-02-07 14:24:36,245 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 62 selfloop transitions, 10 changer transitions 0/85 dead transitions. [2024-02-07 14:24:36,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 85 transitions, 516 flow [2024-02-07 14:24:36,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:24:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:24:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2024-02-07 14:24:36,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4982456140350877 [2024-02-07 14:24:36,247 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 203 flow. Second operand 5 states and 142 transitions. [2024-02-07 14:24:36,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 85 transitions, 516 flow [2024-02-07 14:24:36,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 85 transitions, 462 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-02-07 14:24:36,250 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 237 flow [2024-02-07 14:24:36,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2024-02-07 14:24:36,251 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places. [2024-02-07 14:24:36,251 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 237 flow [2024-02-07 14:24:36,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:24:36,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:36,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:36,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 14:24:36,252 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 32 more)] === [2024-02-07 14:24:36,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:36,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2041848989, now seen corresponding path program 2 times [2024-02-07 14:24:36,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:36,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198680051] [2024-02-07 14:24:36,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:36,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:36,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:36,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198680051] [2024-02-07 14:24:36,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198680051] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:36,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:36,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 14:24:36,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023417051] [2024-02-07 14:24:36,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:36,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:24:36,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:36,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:24:36,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:24:36,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-02-07 14:24:36,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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-02-07 14:24:36,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:36,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-02-07 14:24:36,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:36,472 INFO L124 PetriNetUnfolderBase]: 843/1446 cut-off events. [2024-02-07 14:24:36,472 INFO L125 PetriNetUnfolderBase]: For 1350/1350 co-relation queries the response was YES. [2024-02-07 14:24:36,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4121 conditions, 1446 events. 843/1446 cut-off events. For 1350/1350 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6885 event pairs, 69 based on Foata normal form. 68/1492 useless extension candidates. Maximal degree in co-relation 4111. Up to 496 conditions per place. [2024-02-07 14:24:36,478 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 65 selfloop transitions, 11 changer transitions 1/90 dead transitions. [2024-02-07 14:24:36,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 541 flow [2024-02-07 14:24:36,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:24:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:24:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2024-02-07 14:24:36,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45614035087719296 [2024-02-07 14:24:36,480 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 237 flow. Second operand 6 states and 156 transitions. [2024-02-07 14:24:36,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 541 flow [2024-02-07 14:24:36,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 508 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-02-07 14:24:36,483 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 255 flow [2024-02-07 14:24:36,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=255, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2024-02-07 14:24:36,483 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 6 predicate places. [2024-02-07 14:24:36,484 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 255 flow [2024-02-07 14:24:36,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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-02-07 14:24:36,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:36,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:36,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 14:24:36,484 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 32 more)] === [2024-02-07 14:24:36,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:36,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1684393635, now seen corresponding path program 1 times [2024-02-07 14:24:36,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:36,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459365171] [2024-02-07 14:24:36,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:36,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:36,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:36,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459365171] [2024-02-07 14:24:36,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459365171] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:36,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:36,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:24:36,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218956915] [2024-02-07 14:24:36,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:36,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:24:36,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:36,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:24:36,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:24:36,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-02-07 14:24:36,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-02-07 14:24:36,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:36,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-02-07 14:24:36,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:36,774 INFO L124 PetriNetUnfolderBase]: 1018/1867 cut-off events. [2024-02-07 14:24:36,774 INFO L125 PetriNetUnfolderBase]: For 2723/2723 co-relation queries the response was YES. [2024-02-07 14:24:36,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5469 conditions, 1867 events. 1018/1867 cut-off events. For 2723/2723 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10262 event pairs, 271 based on Foata normal form. 8/1836 useless extension candidates. Maximal degree in co-relation 5457. Up to 573 conditions per place. [2024-02-07 14:24:36,782 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 78 selfloop transitions, 15 changer transitions 0/106 dead transitions. [2024-02-07 14:24:36,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 106 transitions, 752 flow [2024-02-07 14:24:36,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:24:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:24:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-02-07 14:24:36,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.519298245614035 [2024-02-07 14:24:36,784 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 255 flow. Second operand 5 states and 148 transitions. [2024-02-07 14:24:36,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 106 transitions, 752 flow [2024-02-07 14:24:36,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 572 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-02-07 14:24:36,791 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 288 flow [2024-02-07 14:24:36,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=288, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2024-02-07 14:24:36,792 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 5 predicate places. [2024-02-07 14:24:36,792 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 288 flow [2024-02-07 14:24:36,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-02-07 14:24:36,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:36,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:36,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 14:24:36,793 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 32 more)] === [2024-02-07 14:24:36,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:36,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1568334673, now seen corresponding path program 2 times [2024-02-07 14:24:36,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:36,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271663504] [2024-02-07 14:24:36,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:36,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:36,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:36,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271663504] [2024-02-07 14:24:36,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271663504] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:36,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:36,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:24:36,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109419224] [2024-02-07 14:24:36,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:36,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:24:36,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:36,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:24:36,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:24:36,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-02-07 14:24:36,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-02-07 14:24:36,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:36,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-02-07 14:24:36,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:37,084 INFO L124 PetriNetUnfolderBase]: 1534/2844 cut-off events. [2024-02-07 14:24:37,084 INFO L125 PetriNetUnfolderBase]: For 2871/2871 co-relation queries the response was YES. [2024-02-07 14:24:37,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7534 conditions, 2844 events. 1534/2844 cut-off events. For 2871/2871 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 17448 event pairs, 569 based on Foata normal form. 8/2798 useless extension candidates. Maximal degree in co-relation 7523. Up to 1208 conditions per place. [2024-02-07 14:24:37,096 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 76 selfloop transitions, 11 changer transitions 0/100 dead transitions. [2024-02-07 14:24:37,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 642 flow [2024-02-07 14:24:37,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:24:37,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:24:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-02-07 14:24:37,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47719298245614034 [2024-02-07 14:24:37,098 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 288 flow. Second operand 5 states and 136 transitions. [2024-02-07 14:24:37,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 642 flow [2024-02-07 14:24:37,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 100 transitions, 617 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:37,103 INFO L231 Difference]: Finished difference. Result has 73 places, 65 transitions, 364 flow [2024-02-07 14:24:37,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=364, PETRI_PLACES=73, PETRI_TRANSITIONS=65} [2024-02-07 14:24:37,103 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 10 predicate places. [2024-02-07 14:24:37,103 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 65 transitions, 364 flow [2024-02-07 14:24:37,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-02-07 14:24:37,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:37,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:37,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-07 14:24:37,104 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 32 more)] === [2024-02-07 14:24:37,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:37,104 INFO L85 PathProgramCache]: Analyzing trace with hash -474570889, now seen corresponding path program 3 times [2024-02-07 14:24:37,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:37,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360075102] [2024-02-07 14:24:37,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:37,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:24:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:24:37,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:24:37,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360075102] [2024-02-07 14:24:37,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360075102] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:24:37,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:24:37,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:24:37,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658226097] [2024-02-07 14:24:37,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:24:37,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:24:37,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:24:37,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:24:37,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:24:37,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-02-07 14:24:37,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 65 transitions, 364 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-02-07 14:24:37,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:24:37,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-02-07 14:24:37,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:24:37,364 INFO L124 PetriNetUnfolderBase]: 1538/2894 cut-off events. [2024-02-07 14:24:37,365 INFO L125 PetriNetUnfolderBase]: For 3625/3625 co-relation queries the response was YES. [2024-02-07 14:24:37,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7859 conditions, 2894 events. 1538/2894 cut-off events. For 3625/3625 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 17885 event pairs, 462 based on Foata normal form. 8/2831 useless extension candidates. Maximal degree in co-relation 7846. Up to 1000 conditions per place. [2024-02-07 14:24:37,377 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 72 selfloop transitions, 18 changer transitions 0/103 dead transitions. [2024-02-07 14:24:37,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 103 transitions, 696 flow [2024-02-07 14:24:37,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:24:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:24:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-02-07 14:24:37,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4842105263157895 [2024-02-07 14:24:37,379 INFO L175 Difference]: Start difference. First operand has 73 places, 65 transitions, 364 flow. Second operand 5 states and 138 transitions. [2024-02-07 14:24:37,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 103 transitions, 696 flow [2024-02-07 14:24:37,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 103 transitions, 681 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-02-07 14:24:37,386 INFO L231 Difference]: Finished difference. Result has 78 places, 68 transitions, 438 flow [2024-02-07 14:24:37,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=438, PETRI_PLACES=78, PETRI_TRANSITIONS=68} [2024-02-07 14:24:37,387 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 15 predicate places. [2024-02-07 14:24:37,387 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 68 transitions, 438 flow [2024-02-07 14:24:37,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-02-07 14:24:37,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:24:37,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:37,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-07 14:24:37,387 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 32 more)] === [2024-02-07 14:24:37,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:24:37,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1045139733, now seen corresponding path program 4 times [2024-02-07 14:24:37,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:24:37,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567665781] [2024-02-07 14:24:37,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:24:37,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:24:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:24:37,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 14:24:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:24:37,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 14:24:37,421 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 14:24:37,422 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 35 remaining) [2024-02-07 14:24:37,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 35 remaining) [2024-02-07 14:24:37,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 35 remaining) [2024-02-07 14:24:37,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 35 remaining) [2024-02-07 14:24:37,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 35 remaining) [2024-02-07 14:24:37,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 35 remaining) [2024-02-07 14:24:37,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 35 remaining) [2024-02-07 14:24:37,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 35 remaining) [2024-02-07 14:24:37,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 35 remaining) [2024-02-07 14:24:37,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 35 remaining) [2024-02-07 14:24:37,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 35 remaining) [2024-02-07 14:24:37,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 35 remaining) [2024-02-07 14:24:37,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 35 remaining) [2024-02-07 14:24:37,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 35 remaining) [2024-02-07 14:24:37,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 35 remaining) [2024-02-07 14:24:37,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 35 remaining) [2024-02-07 14:24:37,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 35 remaining) [2024-02-07 14:24:37,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 35 remaining) [2024-02-07 14:24:37,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 35 remaining) [2024-02-07 14:24:37,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (15 of 35 remaining) [2024-02-07 14:24:37,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 35 remaining) [2024-02-07 14:24:37,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 35 remaining) [2024-02-07 14:24:37,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 35 remaining) [2024-02-07 14:24:37,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 35 remaining) [2024-02-07 14:24:37,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 35 remaining) [2024-02-07 14:24:37,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 35 remaining) [2024-02-07 14:24:37,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 35 remaining) [2024-02-07 14:24:37,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 35 remaining) [2024-02-07 14:24:37,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 35 remaining) [2024-02-07 14:24:37,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 35 remaining) [2024-02-07 14:24:37,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 35 remaining) [2024-02-07 14:24:37,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 35 remaining) [2024-02-07 14:24:37,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 35 remaining) [2024-02-07 14:24:37,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 35 remaining) [2024-02-07 14:24:37,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 35 remaining) [2024-02-07 14:24:37,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-07 14:24:37,428 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:24:37,432 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 14:24:37,432 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 14:24:37,467 INFO L503 ceAbstractionStarter]: Automizer considered 19 witness invariants [2024-02-07 14:24:37,468 INFO L504 ceAbstractionStarter]: WitnessConsidered=19 [2024-02-07 14:24:37,468 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 02:24:37 BasicIcfg [2024-02-07 14:24:37,468 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 14:24:37,469 INFO L158 Benchmark]: Toolchain (without parser) took 8060.02ms. Allocated memory was 144.7MB in the beginning and 1.0GB in the end (delta: 857.7MB). Free memory was 113.6MB in the beginning and 499.6MB in the end (delta: -386.1MB). Peak memory consumption was 471.5MB. Max. memory is 16.1GB. [2024-02-07 14:24:37,469 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:24:37,469 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 144.7MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:24:37,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.91ms. Allocated memory is still 144.7MB. Free memory was 113.6MB in the beginning and 84.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-02-07 14:24:37,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.35ms. Allocated memory is still 144.7MB. Free memory was 84.2MB in the beginning and 82.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:24:37,470 INFO L158 Benchmark]: Boogie Preprocessor took 33.30ms. Allocated memory is still 144.7MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:24:37,470 INFO L158 Benchmark]: RCFGBuilder took 507.98ms. Allocated memory is still 144.7MB. Free memory was 80.0MB in the beginning and 48.1MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-02-07 14:24:37,470 INFO L158 Benchmark]: TraceAbstraction took 6949.73ms. Allocated memory was 144.7MB in the beginning and 1.0GB in the end (delta: 857.7MB). Free memory was 47.6MB in the beginning and 499.6MB in the end (delta: -452.0MB). Peak memory consumption was 406.5MB. Max. memory is 16.1GB. [2024-02-07 14:24:37,471 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 144.7MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 528.91ms. Allocated memory is still 144.7MB. Free memory was 113.6MB in the beginning and 84.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.35ms. Allocated memory is still 144.7MB. Free memory was 84.2MB in the beginning and 82.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.30ms. Allocated memory is still 144.7MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 507.98ms. Allocated memory is still 144.7MB. Free memory was 80.0MB in the beginning and 48.1MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6949.73ms. Allocated memory was 144.7MB in the beginning and 1.0GB in the end (delta: 857.7MB). Free memory was 47.6MB in the beginning and 499.6MB in the end (delta: -452.0MB). Peak memory consumption was 406.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 784]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L771] 0 pthread_t t2195; [L772] FCALL, FORK 0 pthread_create(&t2195, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2195={5:0}, x=0, y=0] [L721] 1 y = 2 [L722] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]] VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L773] 0 pthread_t t2196; [L774] FCALL, FORK 0 pthread_create(&t2196, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2195={5:0}, t2196={6:0}, x=0, y=2] [L736] 2 x = 2 [L737] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]] VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=2, y=2] [L724] 1 x = 1 [L725] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=2] [L729] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L729] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L730] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=2] [L775] 0 pthread_t t2197; [L776] FCALL, FORK 0 pthread_create(&t2197, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2195={5:0}, t2196={6:0}, t2197={3:0}, x=1, y=2] [L748] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]]]] [L748] 3 __unbuffered_p2_EAX = x [L749] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]]]]] VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=2] [L751] 3 y = 1 [L752] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L741] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L756] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L756] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L778] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L778] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L779] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2195={5:0}, t2196={6:0}, t2197={3:0}, x=1, y=1] [L780] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L780] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L780] RET 0 assume_abort_if_not(main$tmp_guard0) [L784] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[127]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2195={5:0}, t2196={6:0}, t2197={3:0}, x=1, y=1] - UnprovableResult [Line: 722]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 730]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 737]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 756]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 779]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 786]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 776]: 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: 772]: 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: 774]: 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 7 procedures, 92 locations, 35 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: 6.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 460 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 457 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1065 IncrementalHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 2 mSDtfsCounter, 1065 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=438occurred in iteration=15, InterpolantAutomatonStates: 59, 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, 0.9s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 1097 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-02-07 14:24:37,503 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