./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-match-trans.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-match-trans.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fced0e87 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/chl-match-trans.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-match-trans.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.extract-columns-fced0e8-m [2024-01-31 16:08:14,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 16:08:14,624 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 16:08:14,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 16:08:14,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 16:08:14,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 16:08:14,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 16:08:14,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 16:08:14,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 16:08:14,663 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 16:08:14,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 16:08:14,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 16:08:14,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 16:08:14,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 16:08:14,665 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 16:08:14,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 16:08:14,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 16:08:14,666 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 16:08:14,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 16:08:14,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 16:08:14,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 16:08:14,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 16:08:14,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 16:08:14,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 16:08:14,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 16:08:14,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 16:08:14,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 16:08:14,668 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 16:08:14,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 16:08:14,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 16:08:14,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 16:08:14,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 16:08:14,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:08:14,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 16:08:14,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 16:08:14,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 16:08:14,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 16:08:14,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 16:08:14,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 16:08:14,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 16:08:14,671 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 16:08:14,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 16:08:14,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 16:08:14,672 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-31 16:08:14,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 16:08:14,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 16:08:14,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 16:08:14,891 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 16:08:14,892 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 16:08:14,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-match-trans.wvr.c [2024-01-31 16:08:15,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 16:08:16,077 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 16:08:16,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-trans.wvr.c [2024-01-31 16:08:16,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a1a1b9e/d2a686b42b634608b3f5850f9a84b7bd/FLAG66288a001 [2024-01-31 16:08:16,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a1a1b9e/d2a686b42b634608b3f5850f9a84b7bd [2024-01-31 16:08:16,113 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 16:08:16,114 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 16:08:16,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-match-trans.wvr.yml/witness.yml [2024-01-31 16:08:16,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 16:08:16,197 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 16:08:16,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 16:08:16,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 16:08:16,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 16:08:16,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:08:16" (1/2) ... [2024-01-31 16:08:16,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56124a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:16, skipping insertion in model container [2024-01-31 16:08:16,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:08:16" (1/2) ... [2024-01-31 16:08:16,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@79aca92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:16, skipping insertion in model container [2024-01-31 16:08:16,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:08:16" (2/2) ... [2024-01-31 16:08:16,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56124a81 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:16, skipping insertion in model container [2024-01-31 16:08:16,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:08:16" (2/2) ... [2024-01-31 16:08:16,206 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 16:08:16,245 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 16:08:16,246 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (((((((seq_1_start_4 == 0) && (seq_2_start_5 == 0)) && (score_6 == 0)) && (seq_1_start_7 == 0)) && (seq_2_start_8 == 0)) && (result_9 == 0)) && (result_10 == 0)) && (result_11 == 0) [2024-01-31 16:08:16,246 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] ((((seq_1_start_7 == 0) && (seq_2_start_8 == 0)) && (result_9 == 0)) && (result_10 == 0)) && (result_11 == 0) [2024-01-31 16:08:16,246 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((result_9 == 0) && (result_10 == 0)) && (result_11 == 0) [2024-01-31 16:08:16,246 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-31 16:08:16,246 INFO L98 nessWitnessExtractor]: Location invariant after [L43-L43] (((((4294967296LL + (long long )s1) + (long long )s2 >= 0LL) && ((4294967295LL - (long long )s1) + (long long )s2 >= 0LL)) && ((4294967295LL + (long long )s1) - (long long )s2 >= 0LL)) && ((4294967294LL - (long long )s1) - (long long )s2 >= 0LL)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:08:16,246 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-31 16:08:16,246 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-31 16:08:16,247 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (((((((((((score_0 == 0) && (seq_1_start_1 == 0)) && (seq_2_start_2 == 0)) && (score_3 == 0)) && (seq_1_start_4 == 0)) && (seq_2_start_5 == 0)) && (score_6 == 0)) && (seq_1_start_7 == 0)) && (seq_2_start_8 == 0)) && (result_9 == 0)) && (result_10 == 0)) && (result_11 == 0) [2024-01-31 16:08:16,247 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (((((4294967296LL + (long long )s1) + (long long )s2 >= 0LL) && ((4294967295LL - (long long )s1) + (long long )s2 >= 0LL)) && ((4294967295LL + (long long )s1) - (long long )s2 >= 0LL)) && ((4294967294LL - (long long )s1) - (long long )s2 >= 0LL)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:08:16,247 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] ((((((seq_2_start_5 == 0) && (score_6 == 0)) && (seq_1_start_7 == 0)) && (seq_2_start_8 == 0)) && (result_9 == 0)) && (result_10 == 0)) && (result_11 == 0) [2024-01-31 16:08:16,247 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L43] (((((4294967296LL + (long long )s1) + (long long )s2 >= 0LL) && ((4294967295LL - (long long )s1) + (long long )s2 >= 0LL)) && ((4294967295LL + (long long )s1) - (long long )s2 >= 0LL)) && ((4294967294LL - (long long )s1) - (long long )s2 >= 0LL)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:08:16,247 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (((((score_6 == 0) && (seq_1_start_7 == 0)) && (seq_2_start_8 == 0)) && (result_9 == 0)) && (result_10 == 0)) && (result_11 == 0) [2024-01-31 16:08:16,247 INFO L98 nessWitnessExtractor]: Location invariant after [L52-L52] (unsigned long )_argptr == 0UL [2024-01-31 16:08:16,247 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (((((((((seq_2_start_2 == 0) && (score_3 == 0)) && (seq_1_start_4 == 0)) && (seq_2_start_5 == 0)) && (score_6 == 0)) && (seq_1_start_7 == 0)) && (seq_2_start_8 == 0)) && (result_9 == 0)) && (result_10 == 0)) && (result_11 == 0) [2024-01-31 16:08:16,248 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (unsigned long )_argptr == 0UL [2024-01-31 16:08:16,248 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (((((4294967296LL + (long long )s1) + (long long )s2 >= 0LL) && ((4294967295LL - (long long )s1) + (long long )s2 >= 0LL)) && ((4294967295LL + (long long )s1) - (long long )s2 >= 0LL)) && ((4294967294LL - (long long )s1) - (long long )s2 >= 0LL)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:08:16,248 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] ((((((((((seq_1_start_1 == 0) && (seq_2_start_2 == 0)) && (score_3 == 0)) && (seq_1_start_4 == 0)) && (seq_2_start_5 == 0)) && (score_6 == 0)) && (seq_1_start_7 == 0)) && (seq_2_start_8 == 0)) && (result_9 == 0)) && (result_10 == 0)) && (result_11 == 0) [2024-01-31 16:08:16,248 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] ((((((((score_3 == 0) && (seq_1_start_4 == 0)) && (seq_2_start_5 == 0)) && (score_6 == 0)) && (seq_1_start_7 == 0)) && (seq_2_start_8 == 0)) && (result_9 == 0)) && (result_10 == 0)) && (result_11 == 0) [2024-01-31 16:08:16,248 INFO L98 nessWitnessExtractor]: Location invariant before [L95-L95] (1 <= b) && (b != 0) [2024-01-31 16:08:16,248 INFO L98 nessWitnessExtractor]: Location invariant after [L51-L51] (((((4294967296LL + (long long )s1) + (long long )s2 >= 0LL) && ((4294967295LL - (long long )s1) + (long long )s2 >= 0LL)) && ((4294967295LL + (long long )s1) - (long long )s2 >= 0LL)) && ((4294967294LL - (long long )s1) - (long long )s2 >= 0LL)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:08:16,248 INFO L98 nessWitnessExtractor]: Location invariant after [L44-L44] (unsigned long )_argptr == 0UL [2024-01-31 16:08:16,248 INFO L98 nessWitnessExtractor]: Location invariant after [L60-L60] (unsigned long )_argptr == 0UL [2024-01-31 16:08:16,249 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] (unsigned long )_argptr == 0UL [2024-01-31 16:08:16,249 INFO L98 nessWitnessExtractor]: Location invariant after [L59-L59] (((((4294967296LL + (long long )s1) + (long long )s2 >= 0LL) && ((4294967295LL - (long long )s1) + (long long )s2 >= 0LL)) && ((4294967295LL + (long long )s1) - (long long )s2 >= 0LL)) && ((4294967294LL - (long long )s1) - (long long )s2 >= 0LL)) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:08:16,249 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] (unsigned long )_argptr == 0UL [2024-01-31 16:08:16,249 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] (((seq_2_start_8 == 0) && (result_9 == 0)) && (result_10 == 0)) && (result_11 == 0) [2024-01-31 16:08:16,249 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (b <= -1) && (b != 0) [2024-01-31 16:08:16,269 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 16:08:16,381 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-trans.wvr.c[2993,3006] [2024-01-31 16:08:16,385 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:08:16,391 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 16:08:16,400 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-01-31 16:08:16,400 WARN L424 MainDispatcher]: Unable to annotate s1 = plus(seq_1_start_1, seq_2_start_2) with a witness entry [2024-01-31 16:08:16,401 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-01-31 16:08:16,401 WARN L424 MainDispatcher]: Unable to annotate s2 = plus(seq_1_start_4, seq_2_start_5) with a witness entry Start Parsing Local [2024-01-31 16:08:16,420 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-01-31 16:08:16,420 WARN L424 MainDispatcher]: Unable to annotate s1 = plus(seq_1_start_4, seq_2_start_5) with a witness entry [2024-01-31 16:08:16,421 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-01-31 16:08:16,421 WARN L424 MainDispatcher]: Unable to annotate s2 = plus(seq_1_start_7, seq_2_start_8) with a witness entry Start Parsing Local [2024-01-31 16:08:16,422 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-01-31 16:08:16,428 WARN L424 MainDispatcher]: Unable to annotate s1 = plus(seq_1_start_1, seq_2_start_2) with a witness entry [2024-01-31 16:08:16,429 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-01-31 16:08:16,429 WARN L424 MainDispatcher]: Unable to annotate s2 = plus(seq_1_start_7, seq_2_start_8) with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-31 16:08:16,444 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-trans.wvr.c[2993,3006] Start Parsing Local Start Parsing Local [2024-01-31 16:08:16,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:08:16,459 INFO L208 MainTranslator]: Completed translation [2024-01-31 16:08:16,460 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:16 WrapperNode [2024-01-31 16:08:16,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 16:08:16,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 16:08:16,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 16:08:16,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 16:08:16,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:16" (1/1) ... [2024-01-31 16:08:16,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:16" (1/1) ... [2024-01-31 16:08:16,498 INFO L138 Inliner]: procedures = 23, calls = 33, calls flagged for inlining = 11, calls inlined = 21, statements flattened = 238 [2024-01-31 16:08:16,499 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 16:08:16,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 16:08:16,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 16:08:16,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 16:08:16,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:16" (1/1) ... [2024-01-31 16:08:16,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:16" (1/1) ... [2024-01-31 16:08:16,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:16" (1/1) ... [2024-01-31 16:08:16,523 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 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-01-31 16:08:16,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:16" (1/1) ... [2024-01-31 16:08:16,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:16" (1/1) ... [2024-01-31 16:08:16,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:16" (1/1) ... [2024-01-31 16:08:16,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:16" (1/1) ... [2024-01-31 16:08:16,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:16" (1/1) ... [2024-01-31 16:08:16,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:16" (1/1) ... [2024-01-31 16:08:16,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 16:08:16,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 16:08:16,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 16:08:16,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 16:08:16,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:16" (1/1) ... [2024-01-31 16:08:16,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:08:16,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:08:16,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-31 16:08:16,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-31 16:08:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 16:08:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 16:08:16,680 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 16:08:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 16:08:16,680 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 16:08:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-31 16:08:16,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-31 16:08:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 16:08:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 16:08:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 16:08:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 16:08:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 16:08:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 16:08:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 16:08:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 16:08:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 16:08:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 16:08:16,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 16:08:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 16:08:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 16:08:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 16:08:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-31 16:08:16,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 16:08:16,684 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 16:08:16,779 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 16:08:16,781 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 16:08:17,181 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 16:08:17,182 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 16:08:17,388 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 16:08:17,388 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 16:08:17,389 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:08:17 BoogieIcfgContainer [2024-01-31 16:08:17,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 16:08:17,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 16:08:17,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 16:08:17,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 16:08:17,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:08:16" (1/4) ... [2024-01-31 16:08:17,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137efa75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:08:17, skipping insertion in model container [2024-01-31 16:08:17,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:08:16" (2/4) ... [2024-01-31 16:08:17,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137efa75 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:08:17, skipping insertion in model container [2024-01-31 16:08:17,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:16" (3/4) ... [2024-01-31 16:08:17,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137efa75 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:08:17, skipping insertion in model container [2024-01-31 16:08:17,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:08:17" (4/4) ... [2024-01-31 16:08:17,398 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-match-trans.wvr.c [2024-01-31 16:08:17,411 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 16:08:17,411 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-01-31 16:08:17,411 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 16:08:17,474 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-31 16:08:17,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 71 transitions, 163 flow [2024-01-31 16:08:17,545 INFO L124 PetriNetUnfolderBase]: 0/68 cut-off events. [2024-01-31 16:08:17,545 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-31 16:08:17,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 68 events. 0/68 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 125 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-01-31 16:08:17,547 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 71 transitions, 163 flow [2024-01-31 16:08:17,551 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 67 transitions, 152 flow [2024-01-31 16:08:17,567 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 16:08:17,574 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;@73c6d7cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 16:08:17,574 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-01-31 16:08:17,576 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 16:08:17,576 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-31 16:08:17,576 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:08:17,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:17,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-31 16:08:17,578 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-01-31 16:08:17,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:17,581 INFO L85 PathProgramCache]: Analyzing trace with hash 23316, now seen corresponding path program 1 times [2024-01-31 16:08:17,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:17,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163222432] [2024-01-31 16:08:17,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:17,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:17,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:17,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163222432] [2024-01-31 16:08:17,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163222432] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:17,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:17,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:17,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061087602] [2024-01-31 16:08:17,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:17,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:17,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:17,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:17,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:17,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2024-01-31 16:08:17,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 67 transitions, 152 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-01-31 16:08:17,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:17,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2024-01-31 16:08:17,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:18,414 INFO L124 PetriNetUnfolderBase]: 1782/3261 cut-off events. [2024-01-31 16:08:18,414 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2024-01-31 16:08:18,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6151 conditions, 3261 events. 1782/3261 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19295 event pairs, 1782 based on Foata normal form. 0/3252 useless extension candidates. Maximal degree in co-relation 5456. Up to 2714 conditions per place. [2024-01-31 16:08:18,436 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 48 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-01-31 16:08:18,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 66 transitions, 250 flow [2024-01-31 16:08:18,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-01-31 16:08:18,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070422535211268 [2024-01-31 16:08:18,448 INFO L175 Difference]: Start difference. First operand has 77 places, 67 transitions, 152 flow. Second operand 3 states and 108 transitions. [2024-01-31 16:08:18,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 66 transitions, 250 flow [2024-01-31 16:08:18,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 238 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-31 16:08:18,459 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 142 flow [2024-01-31 16:08:18,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2024-01-31 16:08:18,464 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -5 predicate places. [2024-01-31 16:08:18,464 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 142 flow [2024-01-31 16:08:18,465 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-01-31 16:08:18,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:18,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-31 16:08:18,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 16:08:18,467 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-01-31 16:08:18,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:18,472 INFO L85 PathProgramCache]: Analyzing trace with hash 723551, now seen corresponding path program 1 times [2024-01-31 16:08:18,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:18,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252473592] [2024-01-31 16:08:18,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:18,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:18,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:18,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252473592] [2024-01-31 16:08:18,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252473592] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:18,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:18,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:18,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798988298] [2024-01-31 16:08:18,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:18,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:18,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:18,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:18,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:18,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-01-31 16:08:18,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:18,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:18,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-01-31 16:08:18,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:18,890 INFO L124 PetriNetUnfolderBase]: 1782/3260 cut-off events. [2024-01-31 16:08:18,890 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-01-31 16:08:18,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6035 conditions, 3260 events. 1782/3260 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19294 event pairs, 1782 based on Foata normal form. 0/3252 useless extension candidates. Maximal degree in co-relation 6026. Up to 2712 conditions per place. [2024-01-31 16:08:18,903 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 47 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-01-31 16:08:18,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 65 transitions, 238 flow [2024-01-31 16:08:18,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:18,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-01-31 16:08:18,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5164319248826291 [2024-01-31 16:08:18,907 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 142 flow. Second operand 3 states and 110 transitions. [2024-01-31 16:08:18,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 65 transitions, 238 flow [2024-01-31 16:08:18,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 65 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:18,909 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 140 flow [2024-01-31 16:08:18,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2024-01-31 16:08:18,910 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -6 predicate places. [2024-01-31 16:08:18,910 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 140 flow [2024-01-31 16:08:18,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:18,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:18,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-31 16:08:18,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 16:08:18,911 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-01-31 16:08:18,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash 22430787, now seen corresponding path program 1 times [2024-01-31 16:08:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:18,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123588082] [2024-01-31 16:08:18,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:18,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:19,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:19,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123588082] [2024-01-31 16:08:19,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123588082] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:19,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:19,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:19,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377394380] [2024-01-31 16:08:19,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:19,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:19,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:19,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:19,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:19,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 71 [2024-01-31 16:08:19,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:19,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:19,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 71 [2024-01-31 16:08:19,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:19,321 INFO L124 PetriNetUnfolderBase]: 1782/3259 cut-off events. [2024-01-31 16:08:19,321 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-01-31 16:08:19,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6033 conditions, 3259 events. 1782/3259 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19296 event pairs, 1782 based on Foata normal form. 0/3252 useless extension candidates. Maximal degree in co-relation 6022. Up to 2710 conditions per place. [2024-01-31 16:08:19,339 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 46 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-01-31 16:08:19,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 234 flow [2024-01-31 16:08:19,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-01-31 16:08:19,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5258215962441315 [2024-01-31 16:08:19,344 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 140 flow. Second operand 3 states and 112 transitions. [2024-01-31 16:08:19,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 234 flow [2024-01-31 16:08:19,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 64 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:19,345 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 138 flow [2024-01-31 16:08:19,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2024-01-31 16:08:19,347 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -7 predicate places. [2024-01-31 16:08:19,347 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 138 flow [2024-01-31 16:08:19,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:19,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:19,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-31 16:08:19,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 16:08:19,348 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-01-31 16:08:19,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:19,348 INFO L85 PathProgramCache]: Analyzing trace with hash 695355150, now seen corresponding path program 1 times [2024-01-31 16:08:19,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:19,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265034640] [2024-01-31 16:08:19,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:19,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:19,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:19,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265034640] [2024-01-31 16:08:19,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265034640] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:19,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:19,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:19,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207807674] [2024-01-31 16:08:19,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:19,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:19,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:19,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:19,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:19,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 71 [2024-01-31 16:08:19,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:19,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:19,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 71 [2024-01-31 16:08:19,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:19,713 INFO L124 PetriNetUnfolderBase]: 1782/3258 cut-off events. [2024-01-31 16:08:19,713 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-01-31 16:08:19,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6031 conditions, 3258 events. 1782/3258 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19295 event pairs, 1782 based on Foata normal form. 0/3252 useless extension candidates. Maximal degree in co-relation 6018. Up to 2708 conditions per place. [2024-01-31 16:08:19,732 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 45 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-01-31 16:08:19,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 230 flow [2024-01-31 16:08:19,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-01-31 16:08:19,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5352112676056338 [2024-01-31 16:08:19,734 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 138 flow. Second operand 3 states and 114 transitions. [2024-01-31 16:08:19,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 230 flow [2024-01-31 16:08:19,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:19,735 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 136 flow [2024-01-31 16:08:19,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2024-01-31 16:08:19,736 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -8 predicate places. [2024-01-31 16:08:19,736 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 136 flow [2024-01-31 16:08:19,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:19,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:19,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-31 16:08:19,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 16:08:19,737 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-01-31 16:08:19,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:19,737 INFO L85 PathProgramCache]: Analyzing trace with hash 81173901, now seen corresponding path program 1 times [2024-01-31 16:08:19,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:19,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196015720] [2024-01-31 16:08:19,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:19,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:19,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:19,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196015720] [2024-01-31 16:08:19,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196015720] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:19,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:19,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:19,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524580919] [2024-01-31 16:08:19,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:19,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:19,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:19,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:19,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:19,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 71 [2024-01-31 16:08:19,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:19,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:19,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 71 [2024-01-31 16:08:19,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:20,020 INFO L124 PetriNetUnfolderBase]: 1782/3257 cut-off events. [2024-01-31 16:08:20,020 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-01-31 16:08:20,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6029 conditions, 3257 events. 1782/3257 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19294 event pairs, 1782 based on Foata normal form. 0/3252 useless extension candidates. Maximal degree in co-relation 6014. Up to 2706 conditions per place. [2024-01-31 16:08:20,043 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 44 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2024-01-31 16:08:20,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 226 flow [2024-01-31 16:08:20,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-01-31 16:08:20,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5446009389671361 [2024-01-31 16:08:20,045 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 136 flow. Second operand 3 states and 116 transitions. [2024-01-31 16:08:20,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 226 flow [2024-01-31 16:08:20,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 62 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:20,048 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 134 flow [2024-01-31 16:08:20,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2024-01-31 16:08:20,050 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -9 predicate places. [2024-01-31 16:08:20,050 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 134 flow [2024-01-31 16:08:20,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:20,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:20,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:20,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 16:08:20,051 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-01-31 16:08:20,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:20,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1778575661, now seen corresponding path program 1 times [2024-01-31 16:08:20,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:20,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365422755] [2024-01-31 16:08:20,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:20,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:20,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:20,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365422755] [2024-01-31 16:08:20,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365422755] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:20,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:20,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:20,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995925985] [2024-01-31 16:08:20,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:20,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:20,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:20,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:20,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:20,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 71 [2024-01-31 16:08:20,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:20,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:20,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 71 [2024-01-31 16:08:20,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:20,329 INFO L124 PetriNetUnfolderBase]: 1782/3256 cut-off events. [2024-01-31 16:08:20,330 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-01-31 16:08:20,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6027 conditions, 3256 events. 1782/3256 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19293 event pairs, 1782 based on Foata normal form. 0/3252 useless extension candidates. Maximal degree in co-relation 6010. Up to 2704 conditions per place. [2024-01-31 16:08:20,374 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 43 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2024-01-31 16:08:20,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 222 flow [2024-01-31 16:08:20,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2024-01-31 16:08:20,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5539906103286385 [2024-01-31 16:08:20,375 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 134 flow. Second operand 3 states and 118 transitions. [2024-01-31 16:08:20,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 222 flow [2024-01-31 16:08:20,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 61 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:20,379 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 132 flow [2024-01-31 16:08:20,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2024-01-31 16:08:20,381 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -10 predicate places. [2024-01-31 16:08:20,382 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 132 flow [2024-01-31 16:08:20,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:20,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:20,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:20,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 16:08:20,382 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-01-31 16:08:20,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:20,383 INFO L85 PathProgramCache]: Analyzing trace with hash 698730106, now seen corresponding path program 1 times [2024-01-31 16:08:20,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:20,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170667270] [2024-01-31 16:08:20,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:20,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:20,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:20,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:20,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170667270] [2024-01-31 16:08:20,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170667270] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:20,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:20,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:20,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263094708] [2024-01-31 16:08:20,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:20,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:20,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:20,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:20,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:20,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 71 [2024-01-31 16:08:20,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:20,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:20,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 71 [2024-01-31 16:08:20,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:20,679 INFO L124 PetriNetUnfolderBase]: 1782/3255 cut-off events. [2024-01-31 16:08:20,679 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-01-31 16:08:20,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6025 conditions, 3255 events. 1782/3255 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19292 event pairs, 1782 based on Foata normal form. 0/3252 useless extension candidates. Maximal degree in co-relation 6006. Up to 2702 conditions per place. [2024-01-31 16:08:20,690 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 42 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-01-31 16:08:20,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 218 flow [2024-01-31 16:08:20,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:20,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:20,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-01-31 16:08:20,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5633802816901409 [2024-01-31 16:08:20,691 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 132 flow. Second operand 3 states and 120 transitions. [2024-01-31 16:08:20,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 218 flow [2024-01-31 16:08:20,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:20,692 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 130 flow [2024-01-31 16:08:20,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2024-01-31 16:08:20,693 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -11 predicate places. [2024-01-31 16:08:20,693 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 130 flow [2024-01-31 16:08:20,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:20,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:20,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:20,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 16:08:20,694 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-01-31 16:08:20,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:20,694 INFO L85 PathProgramCache]: Analyzing trace with hash 185797563, now seen corresponding path program 1 times [2024-01-31 16:08:20,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:20,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500070250] [2024-01-31 16:08:20,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:20,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:20,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:20,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500070250] [2024-01-31 16:08:20,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500070250] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:20,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:20,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:20,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89756811] [2024-01-31 16:08:20,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:20,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:20,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:20,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:20,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:20,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 71 [2024-01-31 16:08:20,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:20,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:20,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 71 [2024-01-31 16:08:20,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:20,948 INFO L124 PetriNetUnfolderBase]: 1782/3254 cut-off events. [2024-01-31 16:08:20,948 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-01-31 16:08:20,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6023 conditions, 3254 events. 1782/3254 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19291 event pairs, 1782 based on Foata normal form. 0/3252 useless extension candidates. Maximal degree in co-relation 6002. Up to 2700 conditions per place. [2024-01-31 16:08:20,959 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 41 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2024-01-31 16:08:20,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 214 flow [2024-01-31 16:08:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:20,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2024-01-31 16:08:20,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5727699530516432 [2024-01-31 16:08:20,960 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 130 flow. Second operand 3 states and 122 transitions. [2024-01-31 16:08:20,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 214 flow [2024-01-31 16:08:20,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 59 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:20,962 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 128 flow [2024-01-31 16:08:20,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2024-01-31 16:08:20,962 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -12 predicate places. [2024-01-31 16:08:20,962 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 128 flow [2024-01-31 16:08:20,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:20,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:20,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:20,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 16:08:20,963 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-01-31 16:08:20,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:20,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1464757865, now seen corresponding path program 1 times [2024-01-31 16:08:20,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:20,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763262721] [2024-01-31 16:08:20,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:20,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:20,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:20,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763262721] [2024-01-31 16:08:20,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763262721] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:20,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:20,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:20,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317930729] [2024-01-31 16:08:20,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:20,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:20,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:20,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:20,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:21,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 71 [2024-01-31 16:08:21,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:21,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:21,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 71 [2024-01-31 16:08:21,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:21,352 INFO L124 PetriNetUnfolderBase]: 1782/3253 cut-off events. [2024-01-31 16:08:21,353 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-01-31 16:08:21,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6021 conditions, 3253 events. 1782/3253 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19288 event pairs, 1782 based on Foata normal form. 0/3252 useless extension candidates. Maximal degree in co-relation 5998. Up to 2698 conditions per place. [2024-01-31 16:08:21,363 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 40 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2024-01-31 16:08:21,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 58 transitions, 210 flow [2024-01-31 16:08:21,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:21,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-01-31 16:08:21,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5821596244131455 [2024-01-31 16:08:21,364 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 128 flow. Second operand 3 states and 124 transitions. [2024-01-31 16:08:21,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 58 transitions, 210 flow [2024-01-31 16:08:21,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 58 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:21,365 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 126 flow [2024-01-31 16:08:21,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2024-01-31 16:08:21,365 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -13 predicate places. [2024-01-31 16:08:21,365 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 126 flow [2024-01-31 16:08:21,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:21,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:21,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:21,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 16:08:21,366 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-01-31 16:08:21,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:21,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1837145729, now seen corresponding path program 1 times [2024-01-31 16:08:21,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:21,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78868162] [2024-01-31 16:08:21,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:21,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:21,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:08:21,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:21,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78868162] [2024-01-31 16:08:21,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78868162] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:21,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:21,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:21,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639215146] [2024-01-31 16:08:21,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:21,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:21,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:21,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:21,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:21,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 71 [2024-01-31 16:08:21,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:21,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:21,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 71 [2024-01-31 16:08:21,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:21,745 INFO L124 PetriNetUnfolderBase]: 1782/3232 cut-off events. [2024-01-31 16:08:21,745 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-01-31 16:08:21,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5999 conditions, 3232 events. 1782/3232 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19158 event pairs, 712 based on Foata normal form. 0/3232 useless extension candidates. Maximal degree in co-relation 5974. Up to 1821 conditions per place. [2024-01-31 16:08:21,758 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 57 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2024-01-31 16:08:21,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 77 transitions, 288 flow [2024-01-31 16:08:21,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:21,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-01-31 16:08:21,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6854460093896714 [2024-01-31 16:08:21,759 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 126 flow. Second operand 3 states and 146 transitions. [2024-01-31 16:08:21,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 77 transitions, 288 flow [2024-01-31 16:08:21,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:21,761 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 144 flow [2024-01-31 16:08:21,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2024-01-31 16:08:21,761 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -13 predicate places. [2024-01-31 16:08:21,762 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 144 flow [2024-01-31 16:08:21,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:21,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:21,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:21,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 16:08:21,762 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 41 more)] === [2024-01-31 16:08:21,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:21,762 INFO L85 PathProgramCache]: Analyzing trace with hash 360633475, now seen corresponding path program 1 times [2024-01-31 16:08:21,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:21,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779044388] [2024-01-31 16:08:21,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:21,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:08:21,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 16:08:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:08:21,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 16:08:21,797 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 16:08:21,798 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 44 remaining) [2024-01-31 16:08:21,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 44 remaining) [2024-01-31 16:08:21,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 44 remaining) [2024-01-31 16:08:21,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 44 remaining) [2024-01-31 16:08:21,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 44 remaining) [2024-01-31 16:08:21,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 44 remaining) [2024-01-31 16:08:21,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 44 remaining) [2024-01-31 16:08:21,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 44 remaining) [2024-01-31 16:08:21,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 44 remaining) [2024-01-31 16:08:21,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 44 remaining) [2024-01-31 16:08:21,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 44 remaining) [2024-01-31 16:08:21,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 44 remaining) [2024-01-31 16:08:21,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 44 remaining) [2024-01-31 16:08:21,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 44 remaining) [2024-01-31 16:08:21,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 44 remaining) [2024-01-31 16:08:21,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 44 remaining) [2024-01-31 16:08:21,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 44 remaining) [2024-01-31 16:08:21,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 44 remaining) [2024-01-31 16:08:21,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 44 remaining) [2024-01-31 16:08:21,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 44 remaining) [2024-01-31 16:08:21,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 44 remaining) [2024-01-31 16:08:21,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 44 remaining) [2024-01-31 16:08:21,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 44 remaining) [2024-01-31 16:08:21,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 44 remaining) [2024-01-31 16:08:21,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 44 remaining) [2024-01-31 16:08:21,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 44 remaining) [2024-01-31 16:08:21,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (17 of 44 remaining) [2024-01-31 16:08:21,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 44 remaining) [2024-01-31 16:08:21,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 44 remaining) [2024-01-31 16:08:21,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 44 remaining) [2024-01-31 16:08:21,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 44 remaining) [2024-01-31 16:08:21,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 44 remaining) [2024-01-31 16:08:21,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 44 remaining) [2024-01-31 16:08:21,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 44 remaining) [2024-01-31 16:08:21,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 44 remaining) [2024-01-31 16:08:21,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 44 remaining) [2024-01-31 16:08:21,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 44 remaining) [2024-01-31 16:08:21,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 44 remaining) [2024-01-31 16:08:21,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 44 remaining) [2024-01-31 16:08:21,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 44 remaining) [2024-01-31 16:08:21,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 44 remaining) [2024-01-31 16:08:21,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 44 remaining) [2024-01-31 16:08:21,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 44 remaining) [2024-01-31 16:08:21,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 44 remaining) [2024-01-31 16:08:21,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-31 16:08:21,804 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:21,808 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 16:08:21,809 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 16:08:21,830 INFO L503 ceAbstractionStarter]: Automizer considered 25 witness invariants [2024-01-31 16:08:21,830 INFO L504 ceAbstractionStarter]: WitnessConsidered=25 [2024-01-31 16:08:21,831 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:08:21 BasicIcfg [2024-01-31 16:08:21,831 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 16:08:21,831 INFO L158 Benchmark]: Toolchain (without parser) took 5633.73ms. Allocated memory was 178.3MB in the beginning and 608.2MB in the end (delta: 429.9MB). Free memory was 144.5MB in the beginning and 486.9MB in the end (delta: -342.4MB). Peak memory consumption was 89.0MB. Max. memory is 16.1GB. [2024-01-31 16:08:21,831 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 178.3MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:08:21,831 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 178.3MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:08:21,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.82ms. Allocated memory is still 178.3MB. Free memory was 144.0MB in the beginning and 125.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-01-31 16:08:21,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.39ms. Allocated memory is still 178.3MB. Free memory was 125.0MB in the beginning and 122.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 16:08:21,832 INFO L158 Benchmark]: Boogie Preprocessor took 59.61ms. Allocated memory is still 178.3MB. Free memory was 122.4MB in the beginning and 119.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 16:08:21,832 INFO L158 Benchmark]: RCFGBuilder took 829.78ms. Allocated memory is still 178.3MB. Free memory was 119.3MB in the beginning and 123.8MB in the end (delta: -4.5MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. [2024-01-31 16:08:21,832 INFO L158 Benchmark]: TraceAbstraction took 4438.97ms. Allocated memory was 178.3MB in the beginning and 608.2MB in the end (delta: 429.9MB). Free memory was 123.8MB in the beginning and 486.9MB in the end (delta: -363.1MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. [2024-01-31 16:08:21,833 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 178.3MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.16ms. Allocated memory is still 178.3MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.82ms. Allocated memory is still 178.3MB. Free memory was 144.0MB in the beginning and 125.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.39ms. Allocated memory is still 178.3MB. Free memory was 125.0MB in the beginning and 122.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.61ms. Allocated memory is still 178.3MB. Free memory was 122.4MB in the beginning and 119.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 829.78ms. Allocated memory is still 178.3MB. Free memory was 119.3MB in the beginning and 123.8MB in the end (delta: -4.5MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4438.97ms. Allocated memory was 178.3MB in the beginning and 608.2MB in the end (delta: 429.9MB). Free memory was 123.8MB in the beginning and 486.9MB in the end (delta: -363.1MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 94]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] 0 int score_0, seq_1_start_1, seq_2_start_2, score_3, seq_1_start_4, seq_2_start_5, score_6, seq_1_start_7, seq_2_start_8, result_9, result_10, result_11; [L67] 0 pthread_t t1, t2, t3; VAL [result_10=0, result_11=0, result_9=0, score_0=0, score_3=0, score_6=0, seq_1_start_1=0, seq_1_start_4=0, seq_1_start_7=0, seq_2_start_2=0, seq_2_start_5=0, seq_2_start_8=0, t1={6:0}, t2={5:0}, t3={3:0}] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[score_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[score_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[score_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L69] 0 score_0 = __VERIFIER_nondet_int() [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[score_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[score_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L70] 0 seq_1_start_1 = __VERIFIER_nondet_int() [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[score_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[score_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L71] 0 seq_2_start_2 = __VERIFIER_nondet_int() [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[score_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[score_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L72] 0 score_3 = __VERIFIER_nondet_int() [L73] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[score_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L73] 0 seq_1_start_4 =__VERIFIER_nondet_int() [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[score_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L74] 0 seq_2_start_5 = __VERIFIER_nondet_int() [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[score_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L75] 0 score_6 = __VERIFIER_nondet_int() [L76] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[seq_1_start_7],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_8],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L76] 0 seq_1_start_7 =__VERIFIER_nondet_int() [L77] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_8],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L77] 0 seq_2_start_8 = __VERIFIER_nondet_int() [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]]] [L80] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [result_10=0, result_11=0, result_9=0, score_0=0, score_3=0, score_6=0, seq_1_start_1=-2, seq_1_start_4=0, seq_1_start_7=0, seq_2_start_2=0, seq_2_start_5=0, seq_2_start_8=0, t1={6:0}, t2={5:0}, t3={3:0}] [L43] CALL 1 plus(seq_1_start_1, seq_2_start_2) [L94] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IdentifierExpression[b],UnaryExpression[MINUS,IntegerLiteral[1]]],BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]]] VAL [\old(a)=-2, \old(b)=0, a=-2, b=0, result_10=0, result_11=0, result_9=0, score_0=0, score_3=0, score_6=0, seq_1_start_1=-2, seq_1_start_4=0, seq_1_start_7=0, seq_2_start_2=0, seq_2_start_5=0, seq_2_start_8=0] - UnprovableResult [Line: 95]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 80]: 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: 81]: 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: 82]: 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, 111 locations, 44 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: 4.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 903 IncrementalHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 39 mSDtfsCounter, 903 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=0, InterpolantAutomatonStates: 30, 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, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 1045 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-31 16:08:21,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE