./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-match-symm.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-symm.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-symm.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-match-symm.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:13,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 16:08:14,023 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,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 16:08:14,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 16:08:14,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 16:08:14,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 16:08:14,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 16:08:14,056 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 16:08:14,059 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 16:08:14,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 16:08:14,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 16:08:14,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 16:08:14,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 16:08:14,062 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 16:08:14,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 16:08:14,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 16:08:14,062 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 16:08:14,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 16:08:14,063 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 16:08:14,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 16:08:14,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 16:08:14,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 16:08:14,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 16:08:14,065 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 16:08:14,065 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 16:08:14,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 16:08:14,065 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 16:08:14,066 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 16:08:14,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 16:08:14,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 16:08:14,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 16:08:14,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:08:14,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 16:08:14,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 16:08:14,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 16:08:14,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 16:08:14,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 16:08:14,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 16:08:14,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 16:08:14,068 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 16:08:14,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 16:08:14,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 16:08:14,069 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,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 16:08:14,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 16:08:14,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 16:08:14,272 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 16:08:14,273 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 16:08:14,274 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-symm.wvr.yml/witness.yml [2024-01-31 16:08:14,390 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 16:08:14,390 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 16:08:14,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-match-symm.wvr.c [2024-01-31 16:08:15,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 16:08:15,581 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 16:08:15,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-symm.wvr.c [2024-01-31 16:08:15,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0208c2ad2/8c9d8f4e0a4e4b1c8828d0ef6919437b/FLAG117b583cc [2024-01-31 16:08:15,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0208c2ad2/8c9d8f4e0a4e4b1c8828d0ef6919437b [2024-01-31 16:08:15,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 16:08:15,608 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 16:08:15,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 16:08:15,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 16:08:15,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 16:08:15,615 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:14" (1/2) ... [2024-01-31 16:08:15,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e4a50 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:15, skipping insertion in model container [2024-01-31 16:08:15,616 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:14" (1/2) ... [2024-01-31 16:08:15,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@511a56e1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:08:15, skipping insertion in model container [2024-01-31 16:08:15,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:08:15" (2/2) ... [2024-01-31 16:08:15,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e4a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:15, skipping insertion in model container [2024-01-31 16:08:15,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:08:15" (2/2) ... [2024-01-31 16:08:15,619 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 16:08:15,641 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 16:08:15,642 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((seq_2_start_5 == 0) && (result_6 == 0)) && (result_7 == 0) [2024-01-31 16:08:15,642 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:15,642 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] (unsigned long )_argptr == 0UL [2024-01-31 16:08:15,642 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (((((seq_2_start_2 == 0) && (score_3 == 0)) && (seq_1_start_4 == 0)) && (seq_2_start_5 == 0)) && (result_6 == 0)) && (result_7 == 0) [2024-01-31 16:08:15,642 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (((((((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)) && (result_6 == 0)) && (result_7 == 0) [2024-01-31 16:08:15,642 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (((seq_1_start_4 == 0) && (seq_2_start_5 == 0)) && (result_6 == 0)) && (result_7 == 0) [2024-01-31 16:08:15,642 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:15,643 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:15,643 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] (b <= -1) && (b != 0) [2024-01-31 16:08:15,643 INFO L98 nessWitnessExtractor]: Location invariant after [L52-L52] (unsigned long )_argptr == 0UL [2024-01-31 16:08:15,643 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((((score_3 == 0) && (seq_1_start_4 == 0)) && (seq_2_start_5 == 0)) && (result_6 == 0)) && (result_7 == 0) [2024-01-31 16:08:15,643 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-31 16:08:15,643 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (1 <= b) && (b != 0) [2024-01-31 16:08:15,643 INFO L98 nessWitnessExtractor]: Location invariant after [L44-L44] (unsigned long )_argptr == 0UL [2024-01-31 16:08:15,644 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] ((((((seq_1_start_1 == 0) && (seq_2_start_2 == 0)) && (score_3 == 0)) && (seq_1_start_4 == 0)) && (seq_2_start_5 == 0)) && (result_6 == 0)) && (result_7 == 0) [2024-01-31 16:08:15,644 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-31 16:08:15,644 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (result_6 == 0) && (result_7 == 0) [2024-01-31 16:08:15,644 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-31 16:08:15,644 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:15,665 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 16:08:15,816 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-symm.wvr.c[2610,2623] [2024-01-31 16:08:15,820 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:08:15,827 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 16:08:15,836 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-01-31 16:08:15,836 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:15,837 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-01-31 16:08:15,837 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:15,856 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-01-31 16:08:15,857 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:15,857 WARN L424 MainDispatcher]: Unable to annotate int with a witness entry [2024-01-31 16:08:15,857 WARN L424 MainDispatcher]: Unable to annotate s2 = plus(seq_1_start_1, seq_2_start_2) 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 [2024-01-31 16:08:15,875 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-symm.wvr.c[2610,2623] Start Parsing Local Start Parsing Local [2024-01-31 16:08:15,877 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:08:15,887 INFO L208 MainTranslator]: Completed translation [2024-01-31 16:08:15,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:15 WrapperNode [2024-01-31 16:08:15,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 16:08:15,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 16:08:15,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 16:08:15,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 16:08:15,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:15" (1/1) ... [2024-01-31 16:08:15,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:15" (1/1) ... [2024-01-31 16:08:15,921 INFO L138 Inliner]: procedures = 22, calls = 27, calls flagged for inlining = 11, calls inlined = 17, statements flattened = 172 [2024-01-31 16:08:15,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 16:08:15,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 16:08:15,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 16:08:15,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 16:08:15,930 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:15" (1/1) ... [2024-01-31 16:08:15,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:15" (1/1) ... [2024-01-31 16:08:15,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:15" (1/1) ... [2024-01-31 16:08:15,942 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-01-31 16:08:15,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:15" (1/1) ... [2024-01-31 16:08:15,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:15" (1/1) ... [2024-01-31 16:08:15,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:15" (1/1) ... [2024-01-31 16:08:15,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:15" (1/1) ... [2024-01-31 16:08:15,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:15" (1/1) ... [2024-01-31 16:08:15,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:15" (1/1) ... [2024-01-31 16:08:15,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 16:08:15,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 16:08:15,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 16:08:15,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 16:08:15,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:15" (1/1) ... [2024-01-31 16:08:15,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:08:15,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:08:16,151 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,160 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,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 16:08:16,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 16:08:16,188 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 16:08:16,188 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 16:08:16,188 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 16:08:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 16:08:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 16:08:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 16:08:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 16:08:16,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 16:08:16,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 16:08:16,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 16:08:16,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 16:08:16,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 16:08:16,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 16:08:16,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 16:08:16,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 16:08:16,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 16:08:16,193 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,295 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 16:08:16,297 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 16:08:16,572 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 16:08:16,572 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 16:08:16,726 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 16:08:16,727 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 16:08:16,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:08:16 BoogieIcfgContainer [2024-01-31 16:08:16,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 16:08:16,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 16:08:16,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 16:08:16,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 16:08:16,734 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:14" (1/4) ... [2024-01-31 16:08:16,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7bad62 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:08:16, skipping insertion in model container [2024-01-31 16:08:16,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:08:15" (2/4) ... [2024-01-31 16:08:16,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7bad62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:08:16, skipping insertion in model container [2024-01-31 16:08:16,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:08:15" (3/4) ... [2024-01-31 16:08:16,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7bad62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:08:16, skipping insertion in model container [2024-01-31 16:08:16,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:08:16" (4/4) ... [2024-01-31 16:08:16,737 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-match-symm.wvr.c [2024-01-31 16:08:16,780 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 16:08:16,780 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-01-31 16:08:16,780 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 16:08:16,841 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-31 16:08:16,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 49 transitions, 112 flow [2024-01-31 16:08:16,912 INFO L124 PetriNetUnfolderBase]: 0/47 cut-off events. [2024-01-31 16:08:16,912 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-31 16:08:16,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 47 events. 0/47 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-01-31 16:08:16,914 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 49 transitions, 112 flow [2024-01-31 16:08:16,917 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 46 transitions, 104 flow [2024-01-31 16:08:16,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 16:08:16,931 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;@35fd74f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 16:08:16,931 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2024-01-31 16:08:16,933 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 16:08:16,934 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-31 16:08:16,934 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:08:16,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:16,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-31 16:08:16,936 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-01-31 16:08:16,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:16,939 INFO L85 PathProgramCache]: Analyzing trace with hash 17708, now seen corresponding path program 1 times [2024-01-31 16:08:16,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:16,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904532692] [2024-01-31 16:08:16,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:16,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:17,212 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,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:17,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904532692] [2024-01-31 16:08:17,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904532692] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:17,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:17,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:17,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233001627] [2024-01-31 16:08:17,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:17,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:17,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:17,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:17,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:17,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-01-31 16:08:17,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:17,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-01-31 16:08:17,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:17,428 INFO L124 PetriNetUnfolderBase]: 144/366 cut-off events. [2024-01-31 16:08:17,428 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-01-31 16:08:17,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 366 events. 144/366 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1627 event pairs, 144 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 579. Up to 286 conditions per place. [2024-01-31 16:08:17,435 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 32 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2024-01-31 16:08:17,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 45 transitions, 170 flow [2024-01-31 16:08:17,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-01-31 16:08:17,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034013605442177 [2024-01-31 16:08:17,448 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 104 flow. Second operand 3 states and 74 transitions. [2024-01-31 16:08:17,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 45 transitions, 170 flow [2024-01-31 16:08:17,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 162 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-31 16:08:17,455 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 98 flow [2024-01-31 16:08:17,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2024-01-31 16:08:17,459 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-01-31 16:08:17,459 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 98 flow [2024-01-31 16:08:17,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:17,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-31 16:08:17,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 16:08:17,460 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-01-31 16:08:17,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:17,461 INFO L85 PathProgramCache]: Analyzing trace with hash 549519, now seen corresponding path program 1 times [2024-01-31 16:08:17,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:17,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979746825] [2024-01-31 16:08:17,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:17,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:17,542 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,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:17,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979746825] [2024-01-31 16:08:17,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979746825] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:17,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:17,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:17,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131868126] [2024-01-31 16:08:17,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:17,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:17,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:17,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:17,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:17,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-01-31 16:08:17,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:17,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-01-31 16:08:17,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:17,650 INFO L124 PetriNetUnfolderBase]: 144/365 cut-off events. [2024-01-31 16:08:17,651 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-31 16:08:17,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 365 events. 144/365 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1626 event pairs, 144 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 654. Up to 284 conditions per place. [2024-01-31 16:08:17,656 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 31 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2024-01-31 16:08:17,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 162 flow [2024-01-31 16:08:17,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-01-31 16:08:17,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170068027210885 [2024-01-31 16:08:17,659 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 98 flow. Second operand 3 states and 76 transitions. [2024-01-31 16:08:17,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 162 flow [2024-01-31 16:08:17,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:17,661 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 96 flow [2024-01-31 16:08:17,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2024-01-31 16:08:17,662 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2024-01-31 16:08:17,662 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 96 flow [2024-01-31 16:08:17,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:17,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-31 16:08:17,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 16:08:17,663 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-01-31 16:08:17,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:17,664 INFO L85 PathProgramCache]: Analyzing trace with hash 17035623, now seen corresponding path program 1 times [2024-01-31 16:08:17,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:17,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998079413] [2024-01-31 16:08:17,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:17,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:17,712 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,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:17,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998079413] [2024-01-31 16:08:17,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998079413] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:17,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:17,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:17,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581217976] [2024-01-31 16:08:17,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:17,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:17,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:17,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:17,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:17,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-01-31 16:08:17,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:17,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-01-31 16:08:17,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:17,841 INFO L124 PetriNetUnfolderBase]: 144/364 cut-off events. [2024-01-31 16:08:17,841 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-31 16:08:17,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 364 events. 144/364 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1625 event pairs, 144 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 650. Up to 282 conditions per place. [2024-01-31 16:08:17,844 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 30 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2024-01-31 16:08:17,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 43 transitions, 158 flow [2024-01-31 16:08:17,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-01-31 16:08:17,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2024-01-31 16:08:17,846 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 96 flow. Second operand 3 states and 78 transitions. [2024-01-31 16:08:17,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 43 transitions, 158 flow [2024-01-31 16:08:17,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:17,849 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 94 flow [2024-01-31 16:08:17,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2024-01-31 16:08:17,851 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2024-01-31 16:08:17,851 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 94 flow [2024-01-31 16:08:17,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:17,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-31 16:08:17,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 16:08:17,852 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-01-31 16:08:17,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:17,852 INFO L85 PathProgramCache]: Analyzing trace with hash 528104859, now seen corresponding path program 1 times [2024-01-31 16:08:17,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:17,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346325291] [2024-01-31 16:08:17,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:17,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:17,910 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,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:17,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346325291] [2024-01-31 16:08:17,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346325291] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:17,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:17,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:17,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815097437] [2024-01-31 16:08:17,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:17,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:17,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:17,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:17,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:17,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-01-31 16:08:17,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:17,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-01-31 16:08:17,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:17,976 INFO L124 PetriNetUnfolderBase]: 144/363 cut-off events. [2024-01-31 16:08:17,976 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-31 16:08:17,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 363 events. 144/363 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1624 event pairs, 144 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 646. Up to 280 conditions per place. [2024-01-31 16:08:17,978 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 29 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2024-01-31 16:08:17,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 154 flow [2024-01-31 16:08:17,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-01-31 16:08:17,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54421768707483 [2024-01-31 16:08:17,980 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 94 flow. Second operand 3 states and 80 transitions. [2024-01-31 16:08:17,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 154 flow [2024-01-31 16:08:17,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:17,981 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 92 flow [2024-01-31 16:08:17,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2024-01-31 16:08:17,981 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2024-01-31 16:08:17,982 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 92 flow [2024-01-31 16:08:17,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:17,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-31 16:08:17,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 16:08:17,982 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-01-31 16:08:17,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:17,983 INFO L85 PathProgramCache]: Analyzing trace with hash -808617980, now seen corresponding path program 1 times [2024-01-31 16:08:17,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:17,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531215573] [2024-01-31 16:08:17,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:17,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:18,011 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,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:18,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531215573] [2024-01-31 16:08:18,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531215573] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:18,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:18,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:18,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312566650] [2024-01-31 16:08:18,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:18,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:18,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:18,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:18,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:18,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2024-01-31 16:08:18,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:18,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:18,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2024-01-31 16:08:18,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:18,074 INFO L124 PetriNetUnfolderBase]: 144/362 cut-off events. [2024-01-31 16:08:18,074 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-31 16:08:18,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 657 conditions, 362 events. 144/362 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1623 event pairs, 144 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 642. Up to 278 conditions per place. [2024-01-31 16:08:18,076 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 28 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2024-01-31 16:08:18,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 150 flow [2024-01-31 16:08:18,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:18,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-01-31 16:08:18,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5578231292517006 [2024-01-31 16:08:18,077 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 92 flow. Second operand 3 states and 82 transitions. [2024-01-31 16:08:18,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 150 flow [2024-01-31 16:08:18,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:18,079 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 90 flow [2024-01-31 16:08:18,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2024-01-31 16:08:18,079 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -7 predicate places. [2024-01-31 16:08:18,079 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 90 flow [2024-01-31 16:08:18,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:18,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:18,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:18,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 16:08:18,080 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-01-31 16:08:18,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:18,081 INFO L85 PathProgramCache]: Analyzing trace with hash 702646951, now seen corresponding path program 1 times [2024-01-31 16:08:18,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:18,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613713794] [2024-01-31 16:08:18,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:18,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:18,120 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,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:18,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613713794] [2024-01-31 16:08:18,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613713794] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:18,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:18,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:18,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810989618] [2024-01-31 16:08:18,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:18,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:18,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:18,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:18,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:18,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-01-31 16:08:18,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:18,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:18,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-01-31 16:08:18,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:18,185 INFO L124 PetriNetUnfolderBase]: 144/361 cut-off events. [2024-01-31 16:08:18,185 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-31 16:08:18,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 361 events. 144/361 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1622 event pairs, 144 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 638. Up to 276 conditions per place. [2024-01-31 16:08:18,187 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 27 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2024-01-31 16:08:18,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 146 flow [2024-01-31 16:08:18,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:18,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-01-31 16:08:18,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-01-31 16:08:18,188 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 90 flow. Second operand 3 states and 84 transitions. [2024-01-31 16:08:18,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 146 flow [2024-01-31 16:08:18,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:18,189 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 88 flow [2024-01-31 16:08:18,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2024-01-31 16:08:18,190 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2024-01-31 16:08:18,190 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 88 flow [2024-01-31 16:08:18,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:08:18,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:18,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:18,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 16:08:18,191 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-01-31 16:08:18,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:18,191 INFO L85 PathProgramCache]: Analyzing trace with hash 307219544, now seen corresponding path program 1 times [2024-01-31 16:08:18,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:18,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306720366] [2024-01-31 16:08:18,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:18,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:08:18,210 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,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:08:18,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306720366] [2024-01-31 16:08:18,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306720366] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:08:18,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:08:18,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:08:18,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851041824] [2024-01-31 16:08:18,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:08:18,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:08:18,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:08:18,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:08:18,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:08:18,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-01-31 16:08:18,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:08:18,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-01-31 16:08:18,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:08:18,275 INFO L124 PetriNetUnfolderBase]: 144/362 cut-off events. [2024-01-31 16:08:18,276 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-31 16:08:18,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 362 events. 144/362 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1625 event pairs, 72 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 636. Up to 149 conditions per place. [2024-01-31 16:08:18,277 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 38 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2024-01-31 16:08:18,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 195 flow [2024-01-31 16:08:18,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:08:18,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:08:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-01-31 16:08:18,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2024-01-31 16:08:18,279 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 88 flow. Second operand 3 states and 99 transitions. [2024-01-31 16:08:18,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 195 flow [2024-01-31 16:08:18,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:08:18,280 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 99 flow [2024-01-31 16:08:18,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2024-01-31 16:08:18,281 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2024-01-31 16:08:18,281 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 99 flow [2024-01-31 16:08:18,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:08:18,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:18,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 16:08:18,282 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-01-31 16:08:18,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:08:18,282 INFO L85 PathProgramCache]: Analyzing trace with hash -197276477, now seen corresponding path program 1 times [2024-01-31 16:08:18,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:08:18,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350898274] [2024-01-31 16:08:18,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:08:18,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:08:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:08:18,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 16:08:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:08:18,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 16:08:18,311 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 16:08:18,311 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 30 remaining) [2024-01-31 16:08:18,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 30 remaining) [2024-01-31 16:08:18,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 30 remaining) [2024-01-31 16:08:18,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 30 remaining) [2024-01-31 16:08:18,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 30 remaining) [2024-01-31 16:08:18,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 30 remaining) [2024-01-31 16:08:18,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 30 remaining) [2024-01-31 16:08:18,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 30 remaining) [2024-01-31 16:08:18,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 30 remaining) [2024-01-31 16:08:18,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 30 remaining) [2024-01-31 16:08:18,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 30 remaining) [2024-01-31 16:08:18,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 30 remaining) [2024-01-31 16:08:18,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 30 remaining) [2024-01-31 16:08:18,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 30 remaining) [2024-01-31 16:08:18,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 30 remaining) [2024-01-31 16:08:18,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 30 remaining) [2024-01-31 16:08:18,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 30 remaining) [2024-01-31 16:08:18,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 30 remaining) [2024-01-31 16:08:18,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (11 of 30 remaining) [2024-01-31 16:08:18,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 30 remaining) [2024-01-31 16:08:18,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 30 remaining) [2024-01-31 16:08:18,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 30 remaining) [2024-01-31 16:08:18,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 30 remaining) [2024-01-31 16:08:18,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 30 remaining) [2024-01-31 16:08:18,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 30 remaining) [2024-01-31 16:08:18,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 30 remaining) [2024-01-31 16:08:18,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 30 remaining) [2024-01-31 16:08:18,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 30 remaining) [2024-01-31 16:08:18,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 30 remaining) [2024-01-31 16:08:18,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 30 remaining) [2024-01-31 16:08:18,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 16:08:18,317 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:08:18,322 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 16:08:18,322 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 16:08:18,338 INFO L503 ceAbstractionStarter]: Automizer considered 17 witness invariants [2024-01-31 16:08:18,338 INFO L504 ceAbstractionStarter]: WitnessConsidered=17 [2024-01-31 16:08:18,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:08:18 BasicIcfg [2024-01-31 16:08:18,338 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 16:08:18,339 INFO L158 Benchmark]: Toolchain (without parser) took 2730.86ms. Allocated memory was 144.7MB in the beginning and 192.9MB in the end (delta: 48.2MB). Free memory was 69.4MB in the beginning and 91.7MB in the end (delta: -22.3MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-01-31 16:08:18,339 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 144.7MB. Free memory is still 99.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:08:18,339 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 144.7MB. Free memory is still 114.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:08:18,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.70ms. Allocated memory is still 144.7MB. Free memory was 69.2MB in the beginning and 108.8MB in the end (delta: -39.6MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-01-31 16:08:18,340 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.53ms. Allocated memory is still 144.7MB. Free memory was 108.8MB in the beginning and 106.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 16:08:18,340 INFO L158 Benchmark]: Boogie Preprocessor took 39.86ms. Allocated memory is still 144.7MB. Free memory was 106.3MB in the beginning and 103.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 16:08:18,340 INFO L158 Benchmark]: RCFGBuilder took 766.67ms. Allocated memory is still 144.7MB. Free memory was 103.4MB in the beginning and 47.6MB in the end (delta: 55.8MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-01-31 16:08:18,341 INFO L158 Benchmark]: TraceAbstraction took 1607.79ms. Allocated memory was 144.7MB in the beginning and 192.9MB in the end (delta: 48.2MB). Free memory was 46.8MB in the beginning and 91.7MB in the end (delta: -45.0MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. [2024-01-31 16:08:18,342 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 144.7MB. Free memory is still 99.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 144.7MB. Free memory is still 114.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.70ms. Allocated memory is still 144.7MB. Free memory was 69.2MB in the beginning and 108.8MB in the end (delta: -39.6MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.53ms. Allocated memory is still 144.7MB. Free memory was 108.8MB in the beginning and 106.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.86ms. Allocated memory is still 144.7MB. Free memory was 106.3MB in the beginning and 103.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 766.67ms. Allocated memory is still 144.7MB. Free memory was 103.4MB in the beginning and 47.6MB in the end (delta: 55.8MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1607.79ms. Allocated memory was 144.7MB in the beginning and 192.9MB in the end (delta: 48.2MB). Free memory was 46.8MB in the beginning and 91.7MB in the end (delta: -45.0MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 83]: 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, result_6, result_7; [L59] 0 pthread_t t1, t2; VAL [result_6=0, result_7=0, score_0=0, score_3=0, seq_1_start_1=0, seq_1_start_4=0, seq_2_start_2=0, seq_2_start_5=0, t1={5:0}, t2={3:0}] [L61] 0 CodeAnnotStmt[Assertion[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[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] [L61] 0 score_0 = __VERIFIER_nondet_int() [L62] 0 CodeAnnotStmt[Assertion[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[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] [L62] 0 seq_1_start_1 = __VERIFIER_nondet_int() [L63] 0 CodeAnnotStmt[Assertion[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[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] [L63] 0 seq_2_start_2 = __VERIFIER_nondet_int() [L64] 0 CodeAnnotStmt[Assertion[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[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] [L64] 0 score_3 = __VERIFIER_nondet_int() [L65] 0 CodeAnnotStmt[Assertion[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[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] [L65] 0 seq_1_start_4 = __VERIFIER_nondet_int() [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[seq_2_start_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] [L66] 0 seq_2_start_5 = __VERIFIER_nondet_int() [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] [L69] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [result_6=0, result_7=0, score_0=0, score_3=0, seq_1_start_1=0, seq_1_start_4=0, seq_2_start_2=0, seq_2_start_5=0, t1={5:0}, t2={3:0}] [L43] CALL 1 plus(seq_1_start_1, seq_2_start_2) [L83] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IdentifierExpression[b],UnaryExpression[MINUS,IntegerLiteral[1]]],BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]]] VAL [\old(a)=0, \old(b)=0, a=0, b=0, result_6=0, result_7=0, score_0=0, score_3=0, seq_1_start_1=0, seq_1_start_4=0, seq_2_start_2=0, seq_2_start_5=0] - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: 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 a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 69]: 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: 70]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 76 locations, 30 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: 1.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 430 IncrementalHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 33 mSDtfsCounter, 430 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=0, InterpolantAutomatonStates: 21, 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.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 364 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:18,367 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