./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe003_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/safe003_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7c74aec 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/safe003_tso.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe003_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-wip.fs.fix-undeclared-acsl-variable-e7c74ae-m [2024-02-07 19:03:30,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:03:30,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:03:30,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:03:30,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:03:31,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:03:31,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:03:31,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:03:31,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:03:31,011 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:03:31,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:03:31,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:03:31,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:03:31,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:03:31,014 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:03:31,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:03:31,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:03:31,015 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:03:31,015 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:03:31,015 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:03:31,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:03:31,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:03:31,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:03:31,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:03:31,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:03:31,026 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:03:31,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:03:31,026 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:03:31,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:03:31,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:03:31,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:03:31,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:03:31,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:03:31,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:03:31,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:03:31,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:03:31,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:03:31,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:03:31,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:03:31,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:03:31,030 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:03:31,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:03:31,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:03:31,030 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 19:03:31,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:03:31,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:03:31,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:03:31,273 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:03:31,273 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:03:31,274 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/safe003_tso.yml/witness.yml [2024-02-07 19:03:31,369 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:03:31,375 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:03:31,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_tso.i [2024-02-07 19:03:32,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:03:32,699 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:03:32,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_tso.i [2024-02-07 19:03:32,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d749341fe/e6594bc4407849bead21198f5b306204/FLAGf9ecd07dc [2024-02-07 19:03:32,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d749341fe/e6594bc4407849bead21198f5b306204 [2024-02-07 19:03:32,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:03:32,734 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:03:32,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:03:32,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:03:32,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:03:32,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:03:31" (1/2) ... [2024-02-07 19:03:32,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b6280f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:32, skipping insertion in model container [2024-02-07 19:03:32,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:03:31" (1/2) ... [2024-02-07 19:03:32,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4216c6f1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:32, skipping insertion in model container [2024-02-07 19:03:32,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:03:32" (2/2) ... [2024-02-07 19:03:32,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b6280f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:32, skipping insertion in model container [2024-02-07 19:03:32,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:03:32" (2/2) ... [2024-02-07 19:03:32,743 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:03:32,811 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:03:32,812 INFO L76 edCorrectnessWitness]: Location invariant before [L785-L785] 0 <= __unbuffered_cnt [2024-02-07 19:03:32,812 INFO L76 edCorrectnessWitness]: Location invariant before [L786-L786] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:03:32,812 INFO L76 edCorrectnessWitness]: Location invariant before [L755-L755] (((0 <= y) && (y <= 2)) && (y <= 127)) && ((y == 0 || y == 1) || y == 2) [2024-02-07 19:03:32,812 INFO L76 edCorrectnessWitness]: Location invariant before [L791-L791] (((((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 2)) && (__unbuffered_p2_EBX <= 127)) && (y == 2)) && ((__unbuffered_p1_EAX == 1 && (__unbuffered_p2_EAX == 1 || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) || ((((((0 <= __unbuffered_p1_EAX && 0 <= __unbuffered_p2_EAX) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2) [2024-02-07 19:03:32,813 INFO L76 edCorrectnessWitness]: Location invariant before [L793-L793] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:03:32,813 INFO L76 edCorrectnessWitness]: Location invariant before [L792-L792] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:03:32,813 INFO L76 edCorrectnessWitness]: Location invariant before [L734-L734] 1 <= __unbuffered_cnt [2024-02-07 19:03:32,814 INFO L76 edCorrectnessWitness]: Location invariant before [L764-L764] 1 <= __unbuffered_cnt [2024-02-07 19:03:32,814 INFO L76 edCorrectnessWitness]: Location invariant before [L726-L726] y == 2 [2024-02-07 19:03:32,814 INFO L76 edCorrectnessWitness]: Location invariant before [L748-L748] 0 <= __unbuffered_cnt [2024-02-07 19:03:32,814 INFO L76 edCorrectnessWitness]: Location invariant before [L740-L740] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 19:03:32,814 INFO L76 edCorrectnessWitness]: Location invariant before [L758-L758] (((0 <= y) && (y <= 2)) && (y <= 127)) && ((y == 0 || y == 1) || y == 2) [2024-02-07 19:03:32,814 INFO L76 edCorrectnessWitness]: Location invariant before [L741-L741] ((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) [2024-02-07 19:03:32,815 INFO L76 edCorrectnessWitness]: Location invariant before [L749-L749] 1 <= __unbuffered_cnt [2024-02-07 19:03:32,815 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 19:03:32,815 INFO L76 edCorrectnessWitness]: Location invariant before [L756-L756] (((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 19:03:32,815 INFO L76 edCorrectnessWitness]: Location invariant before [L763-L763] 0 <= __unbuffered_cnt [2024-02-07 19:03:32,815 INFO L76 edCorrectnessWitness]: Location invariant before [L729-L729] x == 1 [2024-02-07 19:03:32,815 INFO L76 edCorrectnessWitness]: Location invariant before [L744-L744] y == 1 [2024-02-07 19:03:32,815 INFO L76 edCorrectnessWitness]: Location invariant before [L733-L733] 0 <= __unbuffered_cnt [2024-02-07 19:03:32,816 INFO L76 edCorrectnessWitness]: Location invariant before [L759-L759] (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 2)) && (__unbuffered_p2_EBX <= 127)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2) [2024-02-07 19:03:32,816 INFO L76 edCorrectnessWitness]: Location invariant before [L787-L787] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:03:32,858 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:03:33,015 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/safe003_tso.i[945,958] [2024-02-07 19:03:33,211 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:03:33,221 INFO L206 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 19:03:33,254 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/safe003_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 Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:03:33,309 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:03:33,342 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:03:33,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:33 WrapperNode [2024-02-07 19:03:33,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:03:33,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:03:33,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:03:33,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:03:33,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,385 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2024-02-07 19:03:33,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:03:33,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:03:33,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:03:33,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:03:33,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,430 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 19:03:33,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:03:33,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:03:33,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:03:33,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:03:33,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:03:33,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:03:33,492 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 19:03:33,494 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 19:03:33,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:03:33,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:03:33,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:03:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:03:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 19:03:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:03:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:03:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:03:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 19:03:33,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 19:03:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 19:03:33,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 19:03:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-07 19:03:33,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-07 19:03:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:03:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:03:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:03:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:03:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 19:03:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:03:33,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:03:33,524 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 19:03:33,629 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:03:33,630 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:03:33,864 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:03:33,865 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:03:34,084 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:03:34,085 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 19:03:34,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:03:34 BoogieIcfgContainer [2024-02-07 19:03:34,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:03:34,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:03:34,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:03:34,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:03:34,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:03:31" (1/4) ... [2024-02-07 19:03:34,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8d9e3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:03:34, skipping insertion in model container [2024-02-07 19:03:34,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:03:32" (2/4) ... [2024-02-07 19:03:34,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8d9e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:03:34, skipping insertion in model container [2024-02-07 19:03:34,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:33" (3/4) ... [2024-02-07 19:03:34,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8d9e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:03:34, skipping insertion in model container [2024-02-07 19:03:34,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:03:34" (4/4) ... [2024-02-07 19:03:34,096 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_tso.i [2024-02-07 19:03:34,111 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:03:34,111 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-02-07 19:03:34,112 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:03:34,156 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 19:03:34,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 61 transitions, 134 flow [2024-02-07 19:03:34,224 INFO L124 PetriNetUnfolderBase]: 1/58 cut-off events. [2024-02-07 19:03:34,225 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:03:34,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 58 events. 1/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 181 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2024-02-07 19:03:34,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 61 transitions, 134 flow [2024-02-07 19:03:34,231 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 58 transitions, 125 flow [2024-02-07 19:03:34,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:03:34,247 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;@3981028c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:03:34,247 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-02-07 19:03:34,251 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:03:34,251 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 19:03:34,252 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:03:34,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:34,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 19:03:34,253 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:34,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:34,257 INFO L85 PathProgramCache]: Analyzing trace with hash 9763270, now seen corresponding path program 1 times [2024-02-07 19:03:34,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:34,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145007441] [2024-02-07 19:03:34,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:34,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:34,398 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 19:03:34,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:34,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145007441] [2024-02-07 19:03:34,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145007441] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:34,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:34,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:34,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775472194] [2024-02-07 19:03:34,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:34,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-07 19:03:34,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:34,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-07 19:03:34,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-07 19:03:34,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-07 19:03:34,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 125 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 19:03:34,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:34,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-07 19:03:34,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:35,576 INFO L124 PetriNetUnfolderBase]: 7575/12790 cut-off events. [2024-02-07 19:03:35,576 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-02-07 19:03:35,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23589 conditions, 12790 events. 7575/12790 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 100344 event pairs, 7575 based on Foata normal form. 294/9064 useless extension candidates. Maximal degree in co-relation 23578. Up to 10697 conditions per place. [2024-02-07 19:03:35,689 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 32 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2024-02-07 19:03:35,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 165 flow [2024-02-07 19:03:35,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-07 19:03:35,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-07 19:03:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2024-02-07 19:03:35,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.639344262295082 [2024-02-07 19:03:35,703 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 125 flow. Second operand 2 states and 78 transitions. [2024-02-07 19:03:35,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 165 flow [2024-02-07 19:03:35,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 19:03:35,722 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 98 flow [2024-02-07 19:03:35,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-02-07 19:03:35,726 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -13 predicate places. [2024-02-07 19:03:35,727 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 98 flow [2024-02-07 19:03:35,727 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 19:03:35,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:35,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 19:03:35,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:03:35,728 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:35,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:35,728 INFO L85 PathProgramCache]: Analyzing trace with hash 791120442, now seen corresponding path program 1 times [2024-02-07 19:03:35,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:35,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695825812] [2024-02-07 19:03:35,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:35,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:03:35,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:35,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695825812] [2024-02-07 19:03:35,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695825812] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:35,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:35,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:35,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400290674] [2024-02-07 19:03:35,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:35,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:35,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:35,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:35,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:35,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-07 19:03:35,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 98 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 19:03:35,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:35,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-07 19:03:35,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:36,643 INFO L124 PetriNetUnfolderBase]: 7169/11185 cut-off events. [2024-02-07 19:03:36,643 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:03:36,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21424 conditions, 11185 events. 7169/11185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 81602 event pairs, 2069 based on Foata normal form. 0/7967 useless extension candidates. Maximal degree in co-relation 21421. Up to 7403 conditions per place. [2024-02-07 19:03:36,709 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 54 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2024-02-07 19:03:36,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 262 flow [2024-02-07 19:03:36,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:36,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:36,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-02-07 19:03:36,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5901639344262295 [2024-02-07 19:03:36,712 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 98 flow. Second operand 3 states and 108 transitions. [2024-02-07 19:03:36,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 262 flow [2024-02-07 19:03:36,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 70 transitions, 262 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 19:03:36,715 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 106 flow [2024-02-07 19:03:36,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-02-07 19:03:36,716 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -10 predicate places. [2024-02-07 19:03:36,716 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 106 flow [2024-02-07 19:03:36,717 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 19:03:36,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:36,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:36,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:03:36,718 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:36,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:36,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1199852967, now seen corresponding path program 1 times [2024-02-07 19:03:36,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:36,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047334469] [2024-02-07 19:03:36,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:36,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:36,767 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 19:03:36,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:36,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047334469] [2024-02-07 19:03:36,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047334469] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:36,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:36,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:36,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695859446] [2024-02-07 19:03:36,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:36,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:36,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:36,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:36,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:36,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-07 19:03:36,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 106 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 19:03:36,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:36,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-07 19:03:36,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:37,230 INFO L124 PetriNetUnfolderBase]: 5477/8288 cut-off events. [2024-02-07 19:03:37,231 INFO L125 PetriNetUnfolderBase]: For 573/574 co-relation queries the response was YES. [2024-02-07 19:03:37,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17152 conditions, 8288 events. 5477/8288 cut-off events. For 573/574 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 52492 event pairs, 1779 based on Foata normal form. 0/6450 useless extension candidates. Maximal degree in co-relation 17147. Up to 6613 conditions per place. [2024-02-07 19:03:37,344 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 51 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2024-02-07 19:03:37,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 271 flow [2024-02-07 19:03:37,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:37,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-02-07 19:03:37,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6010928961748634 [2024-02-07 19:03:37,349 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 106 flow. Second operand 3 states and 110 transitions. [2024-02-07 19:03:37,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 271 flow [2024-02-07 19:03:37,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:37,352 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 134 flow [2024-02-07 19:03:37,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2024-02-07 19:03:37,354 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -9 predicate places. [2024-02-07 19:03:37,355 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 134 flow [2024-02-07 19:03:37,355 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 19:03:37,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:37,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:37,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:03:37,356 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:37,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:37,356 INFO L85 PathProgramCache]: Analyzing trace with hash 55899852, now seen corresponding path program 1 times [2024-02-07 19:03:37,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:37,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304751092] [2024-02-07 19:03:37,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:37,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:37,453 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 19:03:37,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:37,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304751092] [2024-02-07 19:03:37,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304751092] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:37,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:37,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:37,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928513630] [2024-02-07 19:03:37,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:37,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:37,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:37,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:37,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:37,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-07 19:03:37,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 134 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 19:03:37,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:37,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-07 19:03:37,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:38,150 INFO L124 PetriNetUnfolderBase]: 5301/8907 cut-off events. [2024-02-07 19:03:38,151 INFO L125 PetriNetUnfolderBase]: For 1126/1126 co-relation queries the response was YES. [2024-02-07 19:03:38,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19450 conditions, 8907 events. 5301/8907 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 65312 event pairs, 2681 based on Foata normal form. 0/7067 useless extension candidates. Maximal degree in co-relation 19444. Up to 7500 conditions per place. [2024-02-07 19:03:38,212 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 48 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2024-02-07 19:03:38,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 277 flow [2024-02-07 19:03:38,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:38,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-02-07 19:03:38,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5573770491803278 [2024-02-07 19:03:38,213 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 134 flow. Second operand 3 states and 102 transitions. [2024-02-07 19:03:38,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 277 flow [2024-02-07 19:03:38,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 65 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:38,215 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 153 flow [2024-02-07 19:03:38,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2024-02-07 19:03:38,216 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -7 predicate places. [2024-02-07 19:03:38,217 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 153 flow [2024-02-07 19:03:38,217 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 19:03:38,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:38,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:38,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:03:38,217 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:38,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:38,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1774348101, now seen corresponding path program 1 times [2024-02-07 19:03:38,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:38,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489360278] [2024-02-07 19:03:38,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:38,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:38,245 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 19:03:38,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:38,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489360278] [2024-02-07 19:03:38,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489360278] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:38,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:38,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:38,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741676693] [2024-02-07 19:03:38,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:38,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:38,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:38,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:38,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:38,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-07 19:03:38,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 153 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 19:03:38,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:38,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-07 19:03:38,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:38,731 INFO L124 PetriNetUnfolderBase]: 4764/7553 cut-off events. [2024-02-07 19:03:38,731 INFO L125 PetriNetUnfolderBase]: For 2120/2123 co-relation queries the response was YES. [2024-02-07 19:03:38,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17976 conditions, 7553 events. 4764/7553 cut-off events. For 2120/2123 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 50885 event pairs, 1571 based on Foata normal form. 227/6991 useless extension candidates. Maximal degree in co-relation 17969. Up to 5021 conditions per place. [2024-02-07 19:03:38,779 INFO L140 encePairwiseOnDemand]: 59/61 looper letters, 61 selfloop transitions, 1 changer transitions 0/76 dead transitions. [2024-02-07 19:03:38,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 76 transitions, 351 flow [2024-02-07 19:03:38,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:38,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:38,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-02-07 19:03:38,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5846994535519126 [2024-02-07 19:03:38,781 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 153 flow. Second operand 3 states and 107 transitions. [2024-02-07 19:03:38,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 76 transitions, 351 flow [2024-02-07 19:03:38,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 76 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:38,784 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 146 flow [2024-02-07 19:03:38,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2024-02-07 19:03:38,786 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -8 predicate places. [2024-02-07 19:03:38,786 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 146 flow [2024-02-07 19:03:38,786 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 19:03:38,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:38,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:38,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:03:38,787 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:38,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:38,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1732844786, now seen corresponding path program 1 times [2024-02-07 19:03:38,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:38,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049523771] [2024-02-07 19:03:38,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:38,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:38,847 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 19:03:38,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:38,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049523771] [2024-02-07 19:03:38,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049523771] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:38,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:38,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:38,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406713302] [2024-02-07 19:03:38,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:38,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:38,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:38,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:38,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:38,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2024-02-07 19:03:38,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 146 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 19:03:38,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:38,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2024-02-07 19:03:38,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:39,257 INFO L124 PetriNetUnfolderBase]: 4764/8287 cut-off events. [2024-02-07 19:03:39,258 INFO L125 PetriNetUnfolderBase]: For 2320/2322 co-relation queries the response was YES. [2024-02-07 19:03:39,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18620 conditions, 8287 events. 4764/8287 cut-off events. For 2320/2322 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 62302 event pairs, 4246 based on Foata normal form. 0/7101 useless extension candidates. Maximal degree in co-relation 18614. Up to 6859 conditions per place. [2024-02-07 19:03:39,314 INFO L140 encePairwiseOnDemand]: 59/61 looper letters, 35 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2024-02-07 19:03:39,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 216 flow [2024-02-07 19:03:39,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:39,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-02-07 19:03:39,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4371584699453552 [2024-02-07 19:03:39,316 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 146 flow. Second operand 3 states and 80 transitions. [2024-02-07 19:03:39,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 216 flow [2024-02-07 19:03:39,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 49 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:39,318 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 145 flow [2024-02-07 19:03:39,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2024-02-07 19:03:39,319 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -8 predicate places. [2024-02-07 19:03:39,319 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 145 flow [2024-02-07 19:03:39,319 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 19:03:39,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:39,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:39,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:03:39,320 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:39,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash 672671598, now seen corresponding path program 1 times [2024-02-07 19:03:39,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:39,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037606620] [2024-02-07 19:03:39,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:39,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:39,352 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 19:03:39,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:39,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037606620] [2024-02-07 19:03:39,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037606620] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:39,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:39,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:39,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879101687] [2024-02-07 19:03:39,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:39,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:39,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:39,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:39,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:39,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-07 19:03:39,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 145 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 19:03:39,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:39,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-07 19:03:39,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:40,043 INFO L124 PetriNetUnfolderBase]: 6778/11300 cut-off events. [2024-02-07 19:03:40,044 INFO L125 PetriNetUnfolderBase]: For 2706/2708 co-relation queries the response was YES. [2024-02-07 19:03:40,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26112 conditions, 11300 events. 6778/11300 cut-off events. For 2706/2708 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 86139 event pairs, 2699 based on Foata normal form. 438/10110 useless extension candidates. Maximal degree in co-relation 26106. Up to 5481 conditions per place. [2024-02-07 19:03:40,142 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 61 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2024-02-07 19:03:40,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 78 transitions, 362 flow [2024-02-07 19:03:40,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-02-07 19:03:40,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6065573770491803 [2024-02-07 19:03:40,144 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 145 flow. Second operand 3 states and 111 transitions. [2024-02-07 19:03:40,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 78 transitions, 362 flow [2024-02-07 19:03:40,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 361 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:40,146 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 176 flow [2024-02-07 19:03:40,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-02-07 19:03:40,147 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -5 predicate places. [2024-02-07 19:03:40,147 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 176 flow [2024-02-07 19:03:40,147 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 19:03:40,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:40,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:40,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 19:03:40,148 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:40,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:40,148 INFO L85 PathProgramCache]: Analyzing trace with hash 601150121, now seen corresponding path program 1 times [2024-02-07 19:03:40,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:40,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778993013] [2024-02-07 19:03:40,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:40,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:40,183 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 19:03:40,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:40,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778993013] [2024-02-07 19:03:40,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778993013] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:40,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:40,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:40,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598903263] [2024-02-07 19:03:40,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:40,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:40,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:40,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:40,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:40,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-07 19:03:40,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 176 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 19:03:40,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:40,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-07 19:03:40,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:40,751 INFO L124 PetriNetUnfolderBase]: 5389/9061 cut-off events. [2024-02-07 19:03:40,751 INFO L125 PetriNetUnfolderBase]: For 5100/5153 co-relation queries the response was YES. [2024-02-07 19:03:40,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21530 conditions, 9061 events. 5389/9061 cut-off events. For 5100/5153 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 66112 event pairs, 2830 based on Foata normal form. 458/8202 useless extension candidates. Maximal degree in co-relation 21523. Up to 4533 conditions per place. [2024-02-07 19:03:40,820 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 55 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2024-02-07 19:03:40,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 337 flow [2024-02-07 19:03:40,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:40,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-02-07 19:03:40,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5737704918032787 [2024-02-07 19:03:40,822 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 176 flow. Second operand 3 states and 105 transitions. [2024-02-07 19:03:40,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 337 flow [2024-02-07 19:03:40,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 71 transitions, 324 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-07 19:03:40,826 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 143 flow [2024-02-07 19:03:40,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2024-02-07 19:03:40,827 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -8 predicate places. [2024-02-07 19:03:40,827 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 143 flow [2024-02-07 19:03:40,827 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 19:03:40,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:40,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:40,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 19:03:40,828 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:40,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:40,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1183460550, now seen corresponding path program 1 times [2024-02-07 19:03:40,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:40,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394251117] [2024-02-07 19:03:40,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:40,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:40,914 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 19:03:40,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:40,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394251117] [2024-02-07 19:03:40,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394251117] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:40,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:40,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:03:40,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977780734] [2024-02-07 19:03:40,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:40,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:03:40,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:40,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:03:40,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:03:40,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2024-02-07 19:03:40,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 143 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 19:03:40,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:40,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2024-02-07 19:03:40,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:41,475 INFO L124 PetriNetUnfolderBase]: 5139/9177 cut-off events. [2024-02-07 19:03:41,476 INFO L125 PetriNetUnfolderBase]: For 2152/2152 co-relation queries the response was YES. [2024-02-07 19:03:41,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20704 conditions, 9177 events. 5139/9177 cut-off events. For 2152/2152 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 71512 event pairs, 1103 based on Foata normal form. 281/7996 useless extension candidates. Maximal degree in co-relation 20698. Up to 4333 conditions per place. [2024-02-07 19:03:41,536 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 60 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2024-02-07 19:03:41,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 78 transitions, 383 flow [2024-02-07 19:03:41,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:03:41,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:03:41,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2024-02-07 19:03:41,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5122950819672131 [2024-02-07 19:03:41,538 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 143 flow. Second operand 4 states and 125 transitions. [2024-02-07 19:03:41,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 78 transitions, 383 flow [2024-02-07 19:03:41,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 361 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:41,543 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 161 flow [2024-02-07 19:03:41,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2024-02-07 19:03:41,544 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -5 predicate places. [2024-02-07 19:03:41,544 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 161 flow [2024-02-07 19:03:41,544 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 19:03:41,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:41,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:41,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 19:03:41,545 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:41,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:41,545 INFO L85 PathProgramCache]: Analyzing trace with hash -280995301, now seen corresponding path program 1 times [2024-02-07 19:03:41,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:41,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33104275] [2024-02-07 19:03:41,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:41,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:41,570 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 19:03:41,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:41,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33104275] [2024-02-07 19:03:41,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33104275] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:41,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:41,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:41,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583773134] [2024-02-07 19:03:41,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:41,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:41,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:41,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:41,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:41,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-07 19:03:41,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 19:03:41,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:41,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-07 19:03:41,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:41,934 INFO L124 PetriNetUnfolderBase]: 2843/5167 cut-off events. [2024-02-07 19:03:41,934 INFO L125 PetriNetUnfolderBase]: For 2071/2071 co-relation queries the response was YES. [2024-02-07 19:03:41,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12028 conditions, 5167 events. 2843/5167 cut-off events. For 2071/2071 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 36254 event pairs, 1305 based on Foata normal form. 152/5059 useless extension candidates. Maximal degree in co-relation 12021. Up to 4002 conditions per place. [2024-02-07 19:03:41,951 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 39 selfloop transitions, 3 changer transitions 2/57 dead transitions. [2024-02-07 19:03:41,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 272 flow [2024-02-07 19:03:41,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-02-07 19:03:41,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5191256830601093 [2024-02-07 19:03:41,952 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 161 flow. Second operand 3 states and 95 transitions. [2024-02-07 19:03:41,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 272 flow [2024-02-07 19:03:41,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:41,954 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 139 flow [2024-02-07 19:03:41,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2024-02-07 19:03:41,954 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -9 predicate places. [2024-02-07 19:03:41,954 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 139 flow [2024-02-07 19:03:41,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 19:03:41,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:41,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:41,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 19:03:41,955 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:41,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:41,956 INFO L85 PathProgramCache]: Analyzing trace with hash 325482130, now seen corresponding path program 1 times [2024-02-07 19:03:41,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:41,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749904478] [2024-02-07 19:03:41,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:41,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:42,044 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 19:03:42,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:42,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749904478] [2024-02-07 19:03:42,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749904478] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:42,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:42,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:42,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186767965] [2024-02-07 19:03:42,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:42,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:03:42,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:42,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:03:42,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:03:42,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-07 19:03:42,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 19:03:42,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:42,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-07 19:03:42,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:42,289 INFO L124 PetriNetUnfolderBase]: 2291/4129 cut-off events. [2024-02-07 19:03:42,289 INFO L125 PetriNetUnfolderBase]: For 1678/1678 co-relation queries the response was YES. [2024-02-07 19:03:42,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9643 conditions, 4129 events. 2291/4129 cut-off events. For 1678/1678 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 27738 event pairs, 1157 based on Foata normal form. 2/3954 useless extension candidates. Maximal degree in co-relation 9636. Up to 3386 conditions per place. [2024-02-07 19:03:42,311 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 43 selfloop transitions, 6 changer transitions 0/62 dead transitions. [2024-02-07 19:03:42,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 301 flow [2024-02-07 19:03:42,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:03:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:03:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-02-07 19:03:42,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46311475409836067 [2024-02-07 19:03:42,313 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 139 flow. Second operand 4 states and 113 transitions. [2024-02-07 19:03:42,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 301 flow [2024-02-07 19:03:42,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 278 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-02-07 19:03:42,316 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 163 flow [2024-02-07 19:03:42,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2024-02-07 19:03:42,317 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -8 predicate places. [2024-02-07 19:03:42,317 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 163 flow [2024-02-07 19:03:42,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 19:03:42,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:42,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:42,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 19:03:42,318 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:42,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:42,318 INFO L85 PathProgramCache]: Analyzing trace with hash -2058002548, now seen corresponding path program 1 times [2024-02-07 19:03:42,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:42,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050179272] [2024-02-07 19:03:42,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:42,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:42,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 19:03:42,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:42,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050179272] [2024-02-07 19:03:42,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050179272] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:42,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:42,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:03:42,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960631252] [2024-02-07 19:03:42,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:42,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:03:42,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:42,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:03:42,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:03:42,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2024-02-07 19:03:42,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 163 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 19:03:42,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:42,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2024-02-07 19:03:42,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:42,711 INFO L124 PetriNetUnfolderBase]: 1674/3050 cut-off events. [2024-02-07 19:03:42,711 INFO L125 PetriNetUnfolderBase]: For 1069/1069 co-relation queries the response was YES. [2024-02-07 19:03:42,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7178 conditions, 3050 events. 1674/3050 cut-off events. For 1069/1069 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 18667 event pairs, 170 based on Foata normal form. 152/3086 useless extension candidates. Maximal degree in co-relation 7171. Up to 945 conditions per place. [2024-02-07 19:03:42,724 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 68 selfloop transitions, 8 changer transitions 1/90 dead transitions. [2024-02-07 19:03:42,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 90 transitions, 461 flow [2024-02-07 19:03:42,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:03:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:03:42,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-02-07 19:03:42,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4852459016393443 [2024-02-07 19:03:42,726 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 163 flow. Second operand 5 states and 148 transitions. [2024-02-07 19:03:42,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 90 transitions, 461 flow [2024-02-07 19:03:42,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 90 transitions, 454 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:42,728 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 206 flow [2024-02-07 19:03:42,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2024-02-07 19:03:42,729 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -3 predicate places. [2024-02-07 19:03:42,729 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 206 flow [2024-02-07 19:03:42,729 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 19:03:42,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:42,729 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] [2024-02-07 19:03:42,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 19:03:42,729 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:42,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:42,729 INFO L85 PathProgramCache]: Analyzing trace with hash 602787466, now seen corresponding path program 1 times [2024-02-07 19:03:42,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:42,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305924257] [2024-02-07 19:03:42,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:42,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:42,810 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 19:03:42,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:42,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305924257] [2024-02-07 19:03:42,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305924257] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:42,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:42,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 19:03:42,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142973546] [2024-02-07 19:03:42,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:42,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:03:42,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:42,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:03:42,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:03:42,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2024-02-07 19:03:42,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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 19:03:42,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:42,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2024-02-07 19:03:42,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:42,983 INFO L124 PetriNetUnfolderBase]: 1028/1744 cut-off events. [2024-02-07 19:03:42,983 INFO L125 PetriNetUnfolderBase]: For 1719/1719 co-relation queries the response was YES. [2024-02-07 19:03:42,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5015 conditions, 1744 events. 1028/1744 cut-off events. For 1719/1719 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 8561 event pairs, 126 based on Foata normal form. 76/1792 useless extension candidates. Maximal degree in co-relation 5006. Up to 576 conditions per place. [2024-02-07 19:03:42,990 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 60 selfloop transitions, 11 changer transitions 1/85 dead transitions. [2024-02-07 19:03:42,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 458 flow [2024-02-07 19:03:42,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 19:03:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 19:03:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-02-07 19:03:42,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4344262295081967 [2024-02-07 19:03:42,992 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 206 flow. Second operand 6 states and 159 transitions. [2024-02-07 19:03:42,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 458 flow [2024-02-07 19:03:42,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 85 transitions, 433 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-02-07 19:03:42,996 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 220 flow [2024-02-07 19:03:42,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2024-02-07 19:03:42,997 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 0 predicate places. [2024-02-07 19:03:42,997 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 220 flow [2024-02-07 19:03:42,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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 19:03:42,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:42,997 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, 1] [2024-02-07 19:03:42,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 19:03:42,998 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:42,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:42,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1794774536, now seen corresponding path program 1 times [2024-02-07 19:03:42,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:42,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417534215] [2024-02-07 19:03:42,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:42,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:03:43,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:03:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:03:43,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:03:43,039 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:03:43,040 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 41 remaining) [2024-02-07 19:03:43,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 41 remaining) [2024-02-07 19:03:43,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 41 remaining) [2024-02-07 19:03:43,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 41 remaining) [2024-02-07 19:03:43,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 41 remaining) [2024-02-07 19:03:43,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 41 remaining) [2024-02-07 19:03:43,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 41 remaining) [2024-02-07 19:03:43,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 41 remaining) [2024-02-07 19:03:43,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 41 remaining) [2024-02-07 19:03:43,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 41 remaining) [2024-02-07 19:03:43,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 41 remaining) [2024-02-07 19:03:43,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 41 remaining) [2024-02-07 19:03:43,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 41 remaining) [2024-02-07 19:03:43,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 41 remaining) [2024-02-07 19:03:43,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 41 remaining) [2024-02-07 19:03:43,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 41 remaining) [2024-02-07 19:03:43,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 41 remaining) [2024-02-07 19:03:43,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 41 remaining) [2024-02-07 19:03:43,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 41 remaining) [2024-02-07 19:03:43,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 41 remaining) [2024-02-07 19:03:43,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 41 remaining) [2024-02-07 19:03:43,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 41 remaining) [2024-02-07 19:03:43,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (18 of 41 remaining) [2024-02-07 19:03:43,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 41 remaining) [2024-02-07 19:03:43,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 41 remaining) [2024-02-07 19:03:43,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 41 remaining) [2024-02-07 19:03:43,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 41 remaining) [2024-02-07 19:03:43,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 41 remaining) [2024-02-07 19:03:43,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 41 remaining) [2024-02-07 19:03:43,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 41 remaining) [2024-02-07 19:03:43,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 41 remaining) [2024-02-07 19:03:43,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 41 remaining) [2024-02-07 19:03:43,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 41 remaining) [2024-02-07 19:03:43,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 41 remaining) [2024-02-07 19:03:43,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 41 remaining) [2024-02-07 19:03:43,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 41 remaining) [2024-02-07 19:03:43,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 41 remaining) [2024-02-07 19:03:43,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 41 remaining) [2024-02-07 19:03:43,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 41 remaining) [2024-02-07 19:03:43,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 41 remaining) [2024-02-07 19:03:43,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 41 remaining) [2024-02-07 19:03:43,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-07 19:03:43,047 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:43,053 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:03:43,053 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:03:43,101 INFO L503 ceAbstractionStarter]: Automizer considered 22 witness invariants [2024-02-07 19:03:43,101 INFO L504 ceAbstractionStarter]: WitnessConsidered=22 [2024-02-07 19:03:43,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:03:43 BasicIcfg [2024-02-07 19:03:43,102 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:03:43,102 INFO L158 Benchmark]: Toolchain (without parser) took 10368.36ms. Allocated memory was 178.3MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 116.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 661.2MB. Max. memory is 16.1GB. [2024-02-07 19:03:43,102 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 178.3MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:03:43,102 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 178.3MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:03:43,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 607.82ms. Allocated memory is still 178.3MB. Free memory was 116.1MB in the beginning and 84.9MB in the end (delta: 31.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-02-07 19:03:43,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.34ms. Allocated memory is still 178.3MB. Free memory was 84.9MB in the beginning and 82.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:03:43,103 INFO L158 Benchmark]: Boogie Preprocessor took 73.26ms. Allocated memory is still 178.3MB. Free memory was 82.7MB in the beginning and 80.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:03:43,103 INFO L158 Benchmark]: RCFGBuilder took 626.12ms. Allocated memory is still 178.3MB. Free memory was 80.2MB in the beginning and 139.8MB in the end (delta: -59.5MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2024-02-07 19:03:43,104 INFO L158 Benchmark]: TraceAbstraction took 9013.71ms. Allocated memory was 178.3MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 139.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 683.6MB. Max. memory is 16.1GB. [2024-02-07 19:03:43,105 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 178.3MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.18ms. Allocated memory is still 178.3MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 607.82ms. Allocated memory is still 178.3MB. Free memory was 116.1MB in the beginning and 84.9MB in the end (delta: 31.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.34ms. Allocated memory is still 178.3MB. Free memory was 84.9MB in the beginning and 82.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.26ms. Allocated memory is still 178.3MB. Free memory was 82.7MB in the beginning and 80.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 626.12ms. Allocated memory is still 178.3MB. Free memory was 80.2MB in the beginning and 139.8MB in the end (delta: -59.5MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9013.71ms. Allocated memory was 178.3MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 139.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 683.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 791]: 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_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L778] 0 pthread_t t1867; [L779] FCALL, FORK 0 pthread_create(&t1867, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1867={5:0}, x=0, y=0] [L725] 1 y = 2 [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]] VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L780] 0 pthread_t t1868; [L781] FCALL, FORK 0 pthread_create(&t1868, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1867={5:0}, t1868={6:0}, x=0, y=2] [L740] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]]]] [L740] 2 __unbuffered_p1_EAX = x [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L728] 1 x = 1 [L729] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L782] 0 pthread_t t1869; [L783] FCALL, FORK 0 pthread_create(&t1869, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1867={5:0}, t1868={6:0}, t1869={3:0}, x=1, y=2] [L755] 3 CodeAnnotStmt[Assertion[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]]]]]] [L755] 3 __unbuffered_p2_EAX = y [L756] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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] [L743] 2 y = 1 [L744] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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] [L758] 3 CodeAnnotStmt[Assertion[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]]]]]] [L758] 3 __unbuffered_p2_EBX = y [L759] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[2]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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] [L733] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L733] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L734] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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] [L748] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L748] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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] [L763] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L763] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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] [L785] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L785] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L786] 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_p1_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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, t1867={5:0}, t1868={6:0}, t1869={3:0}, x=1, y=1] [L787] 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]]]]]] [L787] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L787] RET 0 assume_abort_if_not(main$tmp_guard0) [L791] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[127]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]],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]]]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]]],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]]]]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[2]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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, t1867={5:0}, t1868={6:0}, t1869={3:0}, x=1, y=1] - UnprovableResult [Line: 726]: 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: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 740]: 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: 744]: 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: 755]: 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: 758]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 759]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 763]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 764]: 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: 787]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 792]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 779]: 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: 781]: 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: 783]: 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, 100 locations, 41 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: 8.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 378 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 375 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 862 IncrementalHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 3 mSDtfsCounter, 862 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=13, InterpolantAutomatonStates: 45, 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.7s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 473 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 19:03:43,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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