./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-simpl-str-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-simpl-str-symm.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b 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-simpl-str-symm.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-simpl-str-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-dev-8857f20-m [2024-01-29 22:56:59,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:56:59,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 22:56:59,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:56:59,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:56:59,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:56:59,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:56:59,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:56:59,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:56:59,889 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:56:59,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:56:59,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:56:59,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:56:59,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:56:59,892 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:56:59,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:56:59,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:56:59,892 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:56:59,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:56:59,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:56:59,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:56:59,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:56:59,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:56:59,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:56:59,894 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:56:59,894 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:56:59,895 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:56:59,895 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:56:59,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:56:59,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:56:59,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:56:59,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:56:59,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:56:59,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:56:59,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:56:59,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:56:59,897 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:56:59,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:56:59,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:56:59,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:56:59,898 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:56:59,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:56:59,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:56:59,899 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-29 22:57:00,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:57:00,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:57:00,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:57:00,123 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:57:00,124 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:57:00,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-symm.wvr.c [2024-01-29 22:57:01,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:57:01,322 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:57:01,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-symm.wvr.c [2024-01-29 22:57:01,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41230c89a/cd304ed824934ef5964f7781233eaab5/FLAGedcc4fd49 [2024-01-29 22:57:01,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41230c89a/cd304ed824934ef5964f7781233eaab5 [2024-01-29 22:57:01,341 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:57:01,343 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:57:01,344 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-simpl-str-symm.wvr.yml/witness.yml [2024-01-29 22:57:01,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:57:01,448 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:57:01,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:57:01,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:57:01,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:57:01,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:57:01" (1/2) ... [2024-01-29 22:57:01,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f26f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:01, skipping insertion in model container [2024-01-29 22:57:01,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:57:01" (1/2) ... [2024-01-29 22:57:01,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@14a5184e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:01, skipping insertion in model container [2024-01-29 22:57:01,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:57:01" (2/2) ... [2024-01-29 22:57:01,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f26f2c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:01, skipping insertion in model container [2024-01-29 22:57:01,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:57:01" (2/2) ... [2024-01-29 22:57:01,457 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:57:01,476 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:57:01,477 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_4 == 0 [2024-01-29 22:57:01,477 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (result_4 == 0) && (result_5 == 0) [2024-01-29 22:57:01,477 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] 1 <= b [2024-01-29 22:57:01,477 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (1 <= b) && (b != 0) [2024-01-29 22:57:01,478 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-29 22:57:01,479 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (b <= -1) && (b != 0) [2024-01-29 22:57:01,479 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] b <= -1 [2024-01-29 22:57:01,479 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] (unsigned long )_argptr == 0UL [2024-01-29 22:57:01,479 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] ((to_int_1 == 0) && (to_int_3 == 0)) && (result_5 == 0) [2024-01-29 22:57:01,479 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (to_int_1 == 0) && (to_int_3 == 0) [2024-01-29 22:57:01,479 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] to_int_1 == 0 [2024-01-29 22:57:01,479 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] ((to_int_1 == 0) && (to_int_3 == 0)) && (result_4 == 0) [2024-01-29 22:57:01,480 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (to_int_1 == 0) && (length_2 == 0) [2024-01-29 22:57:01,480 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (to_int_3 == 0) && (result_5 == 0) [2024-01-29 22:57:01,480 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] to_int_3 == 0 [2024-01-29 22:57:01,480 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (to_int_3 == 0) && (result_4 == 0) [2024-01-29 22:57:01,480 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (to_int_3 == 0) && (result_4 == 0) [2024-01-29 22:57:01,480 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] to_int_3 == 0 [2024-01-29 22:57:01,480 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] ((to_int_3 == 0) && (result_4 == 0)) && (result_5 == 0) [2024-01-29 22:57:01,481 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (length_0 == 0) && (to_int_1 == 0) [2024-01-29 22:57:01,481 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] ((length_0 == 0) && (to_int_1 == 0)) && (result_4 == 0) [2024-01-29 22:57:01,481 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] ((length_0 == 0) && (to_int_1 == 0)) && (to_int_3 == 0) [2024-01-29 22:57:01,481 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] ((length_0 == 0) && (to_int_1 == 0)) && (length_2 == 0) [2024-01-29 22:57:01,481 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] ((length_0 == 0) && (to_int_1 == 0)) && (result_5 == 0) [2024-01-29 22:57:01,482 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] length_0 == 0 [2024-01-29 22:57:01,482 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] (length_2 == 0) && (result_5 == 0) [2024-01-29 22:57:01,482 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] length_2 == 0 [2024-01-29 22:57:01,482 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] (length_2 == 0) && (to_int_3 == 0) [2024-01-29 22:57:01,482 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] (length_2 == 0) && (result_4 == 0) [2024-01-29 22:57:01,499 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:57:01,637 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-simpl-str-symm.wvr.c[2329,2342] [2024-01-29 22:57:01,642 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:57:01,649 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 22:57:01,657 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:57:01,688 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-simpl-str-symm.wvr.c[2329,2342] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:57:01,692 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:57:01,703 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:57:01,712 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:01 WrapperNode [2024-01-29 22:57:01,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:57:01,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:57:01,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:57:01,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:57:01,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:01" (1/1) ... [2024-01-29 22:57:01,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:01" (1/1) ... [2024-01-29 22:57:01,768 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 157 [2024-01-29 22:57:01,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:57:01,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:57:01,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:57:01,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:57:01,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:01" (1/1) ... [2024-01-29 22:57:01,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:01" (1/1) ... [2024-01-29 22:57:01,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:01" (1/1) ... [2024-01-29 22:57:01,814 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-29 22:57:01,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:01" (1/1) ... [2024-01-29 22:57:01,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:01" (1/1) ... [2024-01-29 22:57:01,835 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:01" (1/1) ... [2024-01-29 22:57:01,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:01" (1/1) ... [2024-01-29 22:57:01,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:01" (1/1) ... [2024-01-29 22:57:01,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:01" (1/1) ... [2024-01-29 22:57:01,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:57:01,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:57:01,846 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:57:01,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:57:01,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:01" (1/1) ... [2024-01-29 22:57:01,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:57:01,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:57:01,880 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-29 22:57:01,884 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-29 22:57:01,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:57:01,906 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 22:57:01,906 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 22:57:01,906 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 22:57:01,906 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 22:57:01,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:57:01,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:57:01,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:57:01,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:57:01,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:57:01,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:57:01,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:57:01,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:57:01,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:57:01,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 22:57:01,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 22:57:01,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 22:57:01,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:57:01,935 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 22:57:02,018 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:57:02,020 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:57:02,241 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:57:02,241 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:57:02,400 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:57:02,400 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 22:57:02,400 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:57:02 BoogieIcfgContainer [2024-01-29 22:57:02,401 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:57:02,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:57:02,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:57:02,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:57:02,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:57:01" (1/4) ... [2024-01-29 22:57:02,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc94220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:57:02, skipping insertion in model container [2024-01-29 22:57:02,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:57:01" (2/4) ... [2024-01-29 22:57:02,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc94220 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:57:02, skipping insertion in model container [2024-01-29 22:57:02,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:01" (3/4) ... [2024-01-29 22:57:02,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc94220 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:57:02, skipping insertion in model container [2024-01-29 22:57:02,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:57:02" (4/4) ... [2024-01-29 22:57:02,421 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-symm.wvr.c [2024-01-29 22:57:02,433 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:57:02,445 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2024-01-29 22:57:02,445 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:57:02,503 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 22:57:02,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 87 transitions, 188 flow [2024-01-29 22:57:02,579 INFO L124 PetriNetUnfolderBase]: 4/85 cut-off events. [2024-01-29 22:57:02,579 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 22:57:02,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 85 events. 4/85 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2024-01-29 22:57:02,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 87 transitions, 188 flow [2024-01-29 22:57:02,586 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 84 transitions, 180 flow [2024-01-29 22:57:02,594 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:57:02,599 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;@61aa101d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:57:02,599 INFO L358 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2024-01-29 22:57:02,600 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:57:02,600 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:57:02,601 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:57:02,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:02,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:57:02,602 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-29 22:57:02,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:02,605 INFO L85 PathProgramCache]: Analyzing trace with hash 15551, now seen corresponding path program 1 times [2024-01-29 22:57:02,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:02,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165628167] [2024-01-29 22:57:02,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:02,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:02,821 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-29 22:57:02,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:02,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165628167] [2024-01-29 22:57:02,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165628167] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:02,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:02,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:02,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639637754] [2024-01-29 22:57:02,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:02,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:02,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:02,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:02,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 87 [2024-01-29 22:57:02,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:02,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:02,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 87 [2024-01-29 22:57:02,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:03,229 INFO L124 PetriNetUnfolderBase]: 298/682 cut-off events. [2024-01-29 22:57:03,229 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-01-29 22:57:03,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 682 events. 298/682 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3859 event pairs, 150 based on Foata normal form. 0/568 useless extension candidates. Maximal degree in co-relation 1056. Up to 294 conditions per place. [2024-01-29 22:57:03,238 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 50 selfloop transitions, 4 changer transitions 0/103 dead transitions. [2024-01-29 22:57:03,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 103 transitions, 335 flow [2024-01-29 22:57:03,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2024-01-29 22:57:03,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8045977011494253 [2024-01-29 22:57:03,250 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 180 flow. Second operand 3 states and 210 transitions. [2024-01-29 22:57:03,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 103 transitions, 335 flow [2024-01-29 22:57:03,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 103 transitions, 321 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 22:57:03,255 INFO L231 Difference]: Finished difference. Result has 86 places, 85 transitions, 198 flow [2024-01-29 22:57:03,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=86, PETRI_TRANSITIONS=85} [2024-01-29 22:57:03,260 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -1 predicate places. [2024-01-29 22:57:03,260 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 85 transitions, 198 flow [2024-01-29 22:57:03,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:03,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:03,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 22:57:03,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:57:03,261 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-29 22:57:03,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:03,261 INFO L85 PathProgramCache]: Analyzing trace with hash 482576, now seen corresponding path program 1 times [2024-01-29 22:57:03,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:03,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448070220] [2024-01-29 22:57:03,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:03,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:03,301 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-29 22:57:03,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:03,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448070220] [2024-01-29 22:57:03,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448070220] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:03,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:03,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:03,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9677358] [2024-01-29 22:57:03,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:03,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:03,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:03,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:03,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:03,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 87 [2024-01-29 22:57:03,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 85 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-29 22:57:03,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:03,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 87 [2024-01-29 22:57:03,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:03,429 INFO L124 PetriNetUnfolderBase]: 291/671 cut-off events. [2024-01-29 22:57:03,430 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2024-01-29 22:57:03,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 671 events. 291/671 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3899 event pairs, 242 based on Foata normal form. 1/565 useless extension candidates. Maximal degree in co-relation 739. Up to 515 conditions per place. [2024-01-29 22:57:03,433 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 31 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-01-29 22:57:03,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 83 transitions, 260 flow [2024-01-29 22:57:03,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:03,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2024-01-29 22:57:03,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7241379310344828 [2024-01-29 22:57:03,435 INFO L175 Difference]: Start difference. First operand has 86 places, 85 transitions, 198 flow. Second operand 3 states and 189 transitions. [2024-01-29 22:57:03,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 83 transitions, 260 flow [2024-01-29 22:57:03,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 83 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:03,437 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 190 flow [2024-01-29 22:57:03,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2024-01-29 22:57:03,438 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -3 predicate places. [2024-01-29 22:57:03,439 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 190 flow [2024-01-29 22:57:03,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-29 22:57:03,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:03,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 22:57:03,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:57:03,439 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-29 22:57:03,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:03,440 INFO L85 PathProgramCache]: Analyzing trace with hash 14960313, now seen corresponding path program 1 times [2024-01-29 22:57:03,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:03,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623342588] [2024-01-29 22:57:03,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:03,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:03,474 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-29 22:57:03,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:03,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623342588] [2024-01-29 22:57:03,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623342588] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:03,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:03,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:03,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936169575] [2024-01-29 22:57:03,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:03,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:03,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:03,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:03,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:03,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2024-01-29 22:57:03,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-29 22:57:03,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:03,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2024-01-29 22:57:03,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:03,622 INFO L124 PetriNetUnfolderBase]: 346/808 cut-off events. [2024-01-29 22:57:03,622 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-01-29 22:57:03,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1491 conditions, 808 events. 346/808 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4818 event pairs, 274 based on Foata normal form. 0/663 useless extension candidates. Maximal degree in co-relation 1471. Up to 581 conditions per place. [2024-01-29 22:57:03,625 INFO L140 encePairwiseOnDemand]: 84/87 looper letters, 34 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2024-01-29 22:57:03,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 82 transitions, 260 flow [2024-01-29 22:57:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2024-01-29 22:57:03,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6973180076628352 [2024-01-29 22:57:03,627 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 190 flow. Second operand 3 states and 182 transitions. [2024-01-29 22:57:03,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 82 transitions, 260 flow [2024-01-29 22:57:03,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 82 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:03,629 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 188 flow [2024-01-29 22:57:03,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2024-01-29 22:57:03,630 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -4 predicate places. [2024-01-29 22:57:03,630 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 188 flow [2024-01-29 22:57:03,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-29 22:57:03,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:03,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 22:57:03,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:57:03,631 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-29 22:57:03,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:03,631 INFO L85 PathProgramCache]: Analyzing trace with hash 463770167, now seen corresponding path program 1 times [2024-01-29 22:57:03,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:03,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973834352] [2024-01-29 22:57:03,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:03,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:03,682 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-29 22:57:03,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:03,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973834352] [2024-01-29 22:57:03,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973834352] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:03,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:03,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:03,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562826442] [2024-01-29 22:57:03,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:03,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:03,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:03,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:03,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:03,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 87 [2024-01-29 22:57:03,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:03,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:03,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 87 [2024-01-29 22:57:03,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:03,780 INFO L124 PetriNetUnfolderBase]: 291/669 cut-off events. [2024-01-29 22:57:03,780 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-01-29 22:57:03,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 669 events. 291/669 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3894 event pairs, 242 based on Foata normal form. 0/540 useless extension candidates. Maximal degree in co-relation 1265. Up to 517 conditions per place. [2024-01-29 22:57:03,784 INFO L140 encePairwiseOnDemand]: 84/87 looper letters, 33 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2024-01-29 22:57:03,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 81 transitions, 256 flow [2024-01-29 22:57:03,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2024-01-29 22:57:03,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7049808429118773 [2024-01-29 22:57:03,786 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 188 flow. Second operand 3 states and 184 transitions. [2024-01-29 22:57:03,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 81 transitions, 256 flow [2024-01-29 22:57:03,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 81 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:03,789 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 186 flow [2024-01-29 22:57:03,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2024-01-29 22:57:03,791 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -5 predicate places. [2024-01-29 22:57:03,791 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 186 flow [2024-01-29 22:57:03,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:03,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:03,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 22:57:03,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:57:03,792 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-29 22:57:03,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:03,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1491973789, now seen corresponding path program 1 times [2024-01-29 22:57:03,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:03,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578005127] [2024-01-29 22:57:03,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:03,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:03,824 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-29 22:57:03,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:03,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578005127] [2024-01-29 22:57:03,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578005127] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:03,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:03,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:03,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115608195] [2024-01-29 22:57:03,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:03,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:03,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:03,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:03,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:03,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 87 [2024-01-29 22:57:03,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:03,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:03,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 87 [2024-01-29 22:57:03,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:03,920 INFO L124 PetriNetUnfolderBase]: 291/668 cut-off events. [2024-01-29 22:57:03,920 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-01-29 22:57:03,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1282 conditions, 668 events. 291/668 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3906 event pairs, 242 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 1264. Up to 516 conditions per place. [2024-01-29 22:57:03,923 INFO L140 encePairwiseOnDemand]: 84/87 looper letters, 32 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2024-01-29 22:57:03,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 80 transitions, 252 flow [2024-01-29 22:57:03,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:03,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2024-01-29 22:57:03,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2024-01-29 22:57:03,925 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 186 flow. Second operand 3 states and 186 transitions. [2024-01-29 22:57:03,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 80 transitions, 252 flow [2024-01-29 22:57:03,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 80 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:03,926 INFO L231 Difference]: Finished difference. Result has 81 places, 80 transitions, 184 flow [2024-01-29 22:57:03,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=81, PETRI_TRANSITIONS=80} [2024-01-29 22:57:03,927 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -6 predicate places. [2024-01-29 22:57:03,927 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 184 flow [2024-01-29 22:57:03,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:03,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:03,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:03,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:57:03,928 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-29 22:57:03,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:03,928 INFO L85 PathProgramCache]: Analyzing trace with hash -732249953, now seen corresponding path program 1 times [2024-01-29 22:57:03,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:03,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876354176] [2024-01-29 22:57:03,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:03,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:03,950 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-29 22:57:03,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:03,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876354176] [2024-01-29 22:57:03,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876354176] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:03,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:03,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:03,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650572769] [2024-01-29 22:57:03,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:03,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:03,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:03,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:03,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:03,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 87 [2024-01-29 22:57:03,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 80 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-29 22:57:03,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:03,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 87 [2024-01-29 22:57:03,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:04,069 INFO L124 PetriNetUnfolderBase]: 322/722 cut-off events. [2024-01-29 22:57:04,070 INFO L125 PetriNetUnfolderBase]: For 48/62 co-relation queries the response was YES. [2024-01-29 22:57:04,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 722 events. 322/722 cut-off events. For 48/62 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4178 event pairs, 252 based on Foata normal form. 1/620 useless extension candidates. Maximal degree in co-relation 1330. Up to 538 conditions per place. [2024-01-29 22:57:04,072 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 32 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2024-01-29 22:57:04,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 248 flow [2024-01-29 22:57:04,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2024-01-29 22:57:04,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7279693486590039 [2024-01-29 22:57:04,074 INFO L175 Difference]: Start difference. First operand has 81 places, 80 transitions, 184 flow. Second operand 3 states and 190 transitions. [2024-01-29 22:57:04,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 248 flow [2024-01-29 22:57:04,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 78 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:04,076 INFO L231 Difference]: Finished difference. Result has 79 places, 78 transitions, 180 flow [2024-01-29 22:57:04,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=79, PETRI_TRANSITIONS=78} [2024-01-29 22:57:04,076 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -8 predicate places. [2024-01-29 22:57:04,076 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 180 flow [2024-01-29 22:57:04,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-29 22:57:04,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:04,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:04,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 22:57:04,077 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-29 22:57:04,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:04,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1224911601, now seen corresponding path program 1 times [2024-01-29 22:57:04,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:04,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901175977] [2024-01-29 22:57:04,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:04,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:04,115 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-29 22:57:04,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:04,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901175977] [2024-01-29 22:57:04,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901175977] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:04,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:04,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:04,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262473893] [2024-01-29 22:57:04,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:04,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:04,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:04,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:04,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:04,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 87 [2024-01-29 22:57:04,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 78 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-29 22:57:04,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:04,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 87 [2024-01-29 22:57:04,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:04,221 INFO L124 PetriNetUnfolderBase]: 288/628 cut-off events. [2024-01-29 22:57:04,221 INFO L125 PetriNetUnfolderBase]: For 50/62 co-relation queries the response was YES. [2024-01-29 22:57:04,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 628 events. 288/628 cut-off events. For 50/62 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3552 event pairs, 228 based on Foata normal form. 1/530 useless extension candidates. Maximal degree in co-relation 1188. Up to 501 conditions per place. [2024-01-29 22:57:04,224 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 32 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2024-01-29 22:57:04,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 76 transitions, 244 flow [2024-01-29 22:57:04,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2024-01-29 22:57:04,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164750957854407 [2024-01-29 22:57:04,225 INFO L175 Difference]: Start difference. First operand has 79 places, 78 transitions, 180 flow. Second operand 3 states and 187 transitions. [2024-01-29 22:57:04,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 76 transitions, 244 flow [2024-01-29 22:57:04,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 76 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:04,227 INFO L231 Difference]: Finished difference. Result has 77 places, 76 transitions, 176 flow [2024-01-29 22:57:04,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=77, PETRI_TRANSITIONS=76} [2024-01-29 22:57:04,227 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -10 predicate places. [2024-01-29 22:57:04,227 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 76 transitions, 176 flow [2024-01-29 22:57:04,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-29 22:57:04,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:04,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:04,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 22:57:04,228 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-29 22:57:04,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:04,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1298850899, now seen corresponding path program 1 times [2024-01-29 22:57:04,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:04,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035912276] [2024-01-29 22:57:04,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:04,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:04,255 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-29 22:57:04,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:04,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035912276] [2024-01-29 22:57:04,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035912276] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:04,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:04,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:04,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75832676] [2024-01-29 22:57:04,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:04,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:04,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:04,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:04,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:04,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 87 [2024-01-29 22:57:04,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 76 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-29 22:57:04,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:04,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 87 [2024-01-29 22:57:04,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:04,355 INFO L124 PetriNetUnfolderBase]: 288/627 cut-off events. [2024-01-29 22:57:04,355 INFO L125 PetriNetUnfolderBase]: For 50/62 co-relation queries the response was YES. [2024-01-29 22:57:04,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 627 events. 288/627 cut-off events. For 50/62 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3534 event pairs, 228 based on Foata normal form. 1/531 useless extension candidates. Maximal degree in co-relation 1186. Up to 499 conditions per place. [2024-01-29 22:57:04,357 INFO L140 encePairwiseOnDemand]: 84/87 looper letters, 29 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2024-01-29 22:57:04,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 75 transitions, 236 flow [2024-01-29 22:57:04,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:04,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2024-01-29 22:57:04,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.735632183908046 [2024-01-29 22:57:04,359 INFO L175 Difference]: Start difference. First operand has 77 places, 76 transitions, 176 flow. Second operand 3 states and 192 transitions. [2024-01-29 22:57:04,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 75 transitions, 236 flow [2024-01-29 22:57:04,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:04,360 INFO L231 Difference]: Finished difference. Result has 76 places, 75 transitions, 174 flow [2024-01-29 22:57:04,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=76, PETRI_TRANSITIONS=75} [2024-01-29 22:57:04,361 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -11 predicate places. [2024-01-29 22:57:04,361 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 174 flow [2024-01-29 22:57:04,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-29 22:57:04,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:04,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:04,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 22:57:04,361 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-29 22:57:04,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:04,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1609671682, now seen corresponding path program 1 times [2024-01-29 22:57:04,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:04,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559116343] [2024-01-29 22:57:04,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:04,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:04,380 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-29 22:57:04,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:04,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559116343] [2024-01-29 22:57:04,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559116343] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:04,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:04,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:04,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336437758] [2024-01-29 22:57:04,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:04,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:04,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:04,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:04,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:04,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 87 [2024-01-29 22:57:04,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-29 22:57:04,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:04,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 87 [2024-01-29 22:57:04,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:04,463 INFO L124 PetriNetUnfolderBase]: 322/717 cut-off events. [2024-01-29 22:57:04,464 INFO L125 PetriNetUnfolderBase]: For 47/61 co-relation queries the response was YES. [2024-01-29 22:57:04,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 717 events. 322/717 cut-off events. For 47/61 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4156 event pairs, 252 based on Foata normal form. 1/617 useless extension candidates. Maximal degree in co-relation 1319. Up to 537 conditions per place. [2024-01-29 22:57:04,467 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 31 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2024-01-29 22:57:04,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 73 transitions, 236 flow [2024-01-29 22:57:04,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2024-01-29 22:57:04,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.735632183908046 [2024-01-29 22:57:04,468 INFO L175 Difference]: Start difference. First operand has 76 places, 75 transitions, 174 flow. Second operand 3 states and 192 transitions. [2024-01-29 22:57:04,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 73 transitions, 236 flow [2024-01-29 22:57:04,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 73 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:04,469 INFO L231 Difference]: Finished difference. Result has 74 places, 73 transitions, 170 flow [2024-01-29 22:57:04,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=74, PETRI_TRANSITIONS=73} [2024-01-29 22:57:04,470 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -13 predicate places. [2024-01-29 22:57:04,470 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 73 transitions, 170 flow [2024-01-29 22:57:04,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-29 22:57:04,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:04,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:04,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 22:57:04,471 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-29 22:57:04,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:04,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1639785907, now seen corresponding path program 1 times [2024-01-29 22:57:04,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:04,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358342740] [2024-01-29 22:57:04,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:04,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:04,490 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-29 22:57:04,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:04,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358342740] [2024-01-29 22:57:04,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358342740] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:04,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:04,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:04,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569658896] [2024-01-29 22:57:04,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:04,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:04,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:04,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:04,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:04,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 87 [2024-01-29 22:57:04,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 73 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-29 22:57:04,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:04,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 87 [2024-01-29 22:57:04,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:04,583 INFO L124 PetriNetUnfolderBase]: 322/716 cut-off events. [2024-01-29 22:57:04,583 INFO L125 PetriNetUnfolderBase]: For 47/61 co-relation queries the response was YES. [2024-01-29 22:57:04,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 716 events. 322/716 cut-off events. For 47/61 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4168 event pairs, 252 based on Foata normal form. 0/618 useless extension candidates. Maximal degree in co-relation 1311. Up to 537 conditions per place. [2024-01-29 22:57:04,586 INFO L140 encePairwiseOnDemand]: 84/87 looper letters, 31 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2024-01-29 22:57:04,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 72 transitions, 234 flow [2024-01-29 22:57:04,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:04,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2024-01-29 22:57:04,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7318007662835249 [2024-01-29 22:57:04,587 INFO L175 Difference]: Start difference. First operand has 74 places, 73 transitions, 170 flow. Second operand 3 states and 191 transitions. [2024-01-29 22:57:04,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 72 transitions, 234 flow [2024-01-29 22:57:04,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 72 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:04,589 INFO L231 Difference]: Finished difference. Result has 73 places, 72 transitions, 168 flow [2024-01-29 22:57:04,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=73, PETRI_TRANSITIONS=72} [2024-01-29 22:57:04,589 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -14 predicate places. [2024-01-29 22:57:04,589 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 168 flow [2024-01-29 22:57:04,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-29 22:57:04,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:04,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:04,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 22:57:04,590 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-29 22:57:04,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:04,591 INFO L85 PathProgramCache]: Analyzing trace with hash -418725732, now seen corresponding path program 1 times [2024-01-29 22:57:04,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:04,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161145801] [2024-01-29 22:57:04,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:04,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:04,610 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-29 22:57:04,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:04,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161145801] [2024-01-29 22:57:04,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161145801] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:04,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:04,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:04,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6751412] [2024-01-29 22:57:04,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:04,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:04,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:04,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:04,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:04,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 87 [2024-01-29 22:57:04,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-29 22:57:04,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:04,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 87 [2024-01-29 22:57:04,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:04,689 INFO L124 PetriNetUnfolderBase]: 322/715 cut-off events. [2024-01-29 22:57:04,689 INFO L125 PetriNetUnfolderBase]: For 47/61 co-relation queries the response was YES. [2024-01-29 22:57:04,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 715 events. 322/715 cut-off events. For 47/61 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4177 event pairs, 252 based on Foata normal form. 1/617 useless extension candidates. Maximal degree in co-relation 1310. Up to 536 conditions per place. [2024-01-29 22:57:04,692 INFO L140 encePairwiseOnDemand]: 84/87 looper letters, 29 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-01-29 22:57:04,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 71 transitions, 228 flow [2024-01-29 22:57:04,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2024-01-29 22:57:04,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7471264367816092 [2024-01-29 22:57:04,693 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 168 flow. Second operand 3 states and 195 transitions. [2024-01-29 22:57:04,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 71 transitions, 228 flow [2024-01-29 22:57:04,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 71 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:04,694 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 166 flow [2024-01-29 22:57:04,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2024-01-29 22:57:04,695 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -15 predicate places. [2024-01-29 22:57:04,695 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 166 flow [2024-01-29 22:57:04,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-29 22:57:04,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:04,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:04,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 22:57:04,696 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-29 22:57:04,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:04,696 INFO L85 PathProgramCache]: Analyzing trace with hash -95595356, now seen corresponding path program 1 times [2024-01-29 22:57:04,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:04,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100351953] [2024-01-29 22:57:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:04,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:04,720 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-29 22:57:04,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:04,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100351953] [2024-01-29 22:57:04,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100351953] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:04,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:04,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:04,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989016613] [2024-01-29 22:57:04,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:04,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:04,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:04,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:04,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:04,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 87 [2024-01-29 22:57:04,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-29 22:57:04,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:04,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 87 [2024-01-29 22:57:04,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:04,799 INFO L124 PetriNetUnfolderBase]: 288/620 cut-off events. [2024-01-29 22:57:04,800 INFO L125 PetriNetUnfolderBase]: For 50/62 co-relation queries the response was YES. [2024-01-29 22:57:04,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 620 events. 288/620 cut-off events. For 50/62 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3550 event pairs, 228 based on Foata normal form. 1/528 useless extension candidates. Maximal degree in co-relation 1176. Up to 498 conditions per place. [2024-01-29 22:57:04,802 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 31 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-01-29 22:57:04,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 68 transitions, 226 flow [2024-01-29 22:57:04,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2024-01-29 22:57:04,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7279693486590039 [2024-01-29 22:57:04,803 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 166 flow. Second operand 3 states and 190 transitions. [2024-01-29 22:57:04,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 68 transitions, 226 flow [2024-01-29 22:57:04,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 68 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:04,804 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 160 flow [2024-01-29 22:57:04,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2024-01-29 22:57:04,805 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -18 predicate places. [2024-01-29 22:57:04,805 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 160 flow [2024-01-29 22:57:04,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-29 22:57:04,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:04,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:04,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 22:57:04,806 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-29 22:57:04,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:04,807 INFO L85 PathProgramCache]: Analyzing trace with hash -317434706, now seen corresponding path program 1 times [2024-01-29 22:57:04,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:04,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423343395] [2024-01-29 22:57:04,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:04,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:04,826 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-29 22:57:04,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:04,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423343395] [2024-01-29 22:57:04,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423343395] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:04,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:04,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:04,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923158283] [2024-01-29 22:57:04,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:04,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:04,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:04,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:04,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:04,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 87 [2024-01-29 22:57:04,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-29 22:57:04,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:04,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 87 [2024-01-29 22:57:04,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:04,904 INFO L124 PetriNetUnfolderBase]: 290/631 cut-off events. [2024-01-29 22:57:04,904 INFO L125 PetriNetUnfolderBase]: For 51/63 co-relation queries the response was YES. [2024-01-29 22:57:04,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 631 events. 290/631 cut-off events. For 51/63 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3629 event pairs, 98 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 1181. Up to 323 conditions per place. [2024-01-29 22:57:04,906 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 46 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2024-01-29 22:57:04,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 83 transitions, 299 flow [2024-01-29 22:57:04,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:04,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2024-01-29 22:57:04,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8007662835249042 [2024-01-29 22:57:04,908 INFO L175 Difference]: Start difference. First operand has 69 places, 68 transitions, 160 flow. Second operand 3 states and 209 transitions. [2024-01-29 22:57:04,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 83 transitions, 299 flow [2024-01-29 22:57:04,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 83 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:04,909 INFO L231 Difference]: Finished difference. Result has 68 places, 68 transitions, 169 flow [2024-01-29 22:57:04,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=68, PETRI_TRANSITIONS=68} [2024-01-29 22:57:04,910 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -19 predicate places. [2024-01-29 22:57:04,910 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 169 flow [2024-01-29 22:57:04,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-29 22:57:04,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:04,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:04,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 22:57:04,911 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-29 22:57:04,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:04,911 INFO L85 PathProgramCache]: Analyzing trace with hash -503135134, now seen corresponding path program 1 times [2024-01-29 22:57:04,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:04,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323796757] [2024-01-29 22:57:04,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:04,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:57:04,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 22:57:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:57:04,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 22:57:04,939 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 22:57:04,940 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 43 remaining) [2024-01-29 22:57:04,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 43 remaining) [2024-01-29 22:57:04,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 43 remaining) [2024-01-29 22:57:04,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 43 remaining) [2024-01-29 22:57:04,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 43 remaining) [2024-01-29 22:57:04,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 43 remaining) [2024-01-29 22:57:04,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 43 remaining) [2024-01-29 22:57:04,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 43 remaining) [2024-01-29 22:57:04,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 43 remaining) [2024-01-29 22:57:04,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 43 remaining) [2024-01-29 22:57:04,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 43 remaining) [2024-01-29 22:57:04,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 43 remaining) [2024-01-29 22:57:04,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 43 remaining) [2024-01-29 22:57:04,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 43 remaining) [2024-01-29 22:57:04,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 43 remaining) [2024-01-29 22:57:04,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 43 remaining) [2024-01-29 22:57:04,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 43 remaining) [2024-01-29 22:57:04,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 43 remaining) [2024-01-29 22:57:04,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 43 remaining) [2024-01-29 22:57:04,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 43 remaining) [2024-01-29 22:57:04,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 43 remaining) [2024-01-29 22:57:04,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 43 remaining) [2024-01-29 22:57:04,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 43 remaining) [2024-01-29 22:57:04,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 43 remaining) [2024-01-29 22:57:04,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 43 remaining) [2024-01-29 22:57:04,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 43 remaining) [2024-01-29 22:57:04,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 43 remaining) [2024-01-29 22:57:04,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 43 remaining) [2024-01-29 22:57:04,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 43 remaining) [2024-01-29 22:57:04,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 43 remaining) [2024-01-29 22:57:04,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 43 remaining) [2024-01-29 22:57:04,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (11 of 43 remaining) [2024-01-29 22:57:04,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 43 remaining) [2024-01-29 22:57:04,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 43 remaining) [2024-01-29 22:57:04,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 43 remaining) [2024-01-29 22:57:04,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 43 remaining) [2024-01-29 22:57:04,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 43 remaining) [2024-01-29 22:57:04,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 43 remaining) [2024-01-29 22:57:04,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 43 remaining) [2024-01-29 22:57:04,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 43 remaining) [2024-01-29 22:57:04,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 43 remaining) [2024-01-29 22:57:04,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 43 remaining) [2024-01-29 22:57:04,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 43 remaining) [2024-01-29 22:57:04,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 22:57:04,947 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:04,952 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 22:57:04,952 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 22:57:04,973 INFO L503 ceAbstractionStarter]: Automizer considered 30 witness invariants [2024-01-29 22:57:04,973 INFO L504 ceAbstractionStarter]: WitnessConsidered=30 [2024-01-29 22:57:04,974 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:57:04 BasicIcfg [2024-01-29 22:57:04,974 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 22:57:04,974 INFO L158 Benchmark]: Toolchain (without parser) took 3542.38ms. Allocated memory was 224.4MB in the beginning and 310.4MB in the end (delta: 86.0MB). Free memory was 151.9MB in the beginning and 124.2MB in the end (delta: 27.6MB). Peak memory consumption was 115.6MB. Max. memory is 16.1GB. [2024-01-29 22:57:04,974 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:57:04,974 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 224.4MB. Free memory was 155.2MB in the beginning and 154.9MB in the end (delta: 293.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:57:04,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.87ms. Allocated memory is still 224.4MB. Free memory was 151.6MB in the beginning and 136.0MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-01-29 22:57:04,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.58ms. Allocated memory is still 224.4MB. Free memory was 135.7MB in the beginning and 133.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:57:04,975 INFO L158 Benchmark]: Boogie Preprocessor took 69.52ms. Allocated memory is still 224.4MB. Free memory was 133.6MB in the beginning and 131.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 22:57:04,975 INFO L158 Benchmark]: RCFGBuilder took 554.99ms. Allocated memory is still 224.4MB. Free memory was 131.2MB in the beginning and 157.4MB in the end (delta: -26.2MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-01-29 22:57:04,975 INFO L158 Benchmark]: TraceAbstraction took 2571.67ms. Allocated memory was 224.4MB in the beginning and 310.4MB in the end (delta: 86.0MB). Free memory was 156.3MB in the beginning and 124.2MB in the end (delta: 32.1MB). Peak memory consumption was 119.1MB. Max. memory is 16.1GB. [2024-01-29 22:57:04,976 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 224.4MB. Free memory was 155.2MB in the beginning and 154.9MB in the end (delta: 293.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.87ms. Allocated memory is still 224.4MB. Free memory was 151.6MB in the beginning and 136.0MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.58ms. Allocated memory is still 224.4MB. Free memory was 135.7MB in the beginning and 133.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.52ms. Allocated memory is still 224.4MB. Free memory was 133.6MB in the beginning and 131.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 554.99ms. Allocated memory is still 224.4MB. Free memory was 131.2MB in the beginning and 157.4MB in the end (delta: -26.2MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2571.67ms. Allocated memory was 224.4MB in the beginning and 310.4MB in the end (delta: 86.0MB). Free memory was 156.3MB in the beginning and 124.2MB in the end (delta: 32.1MB). Peak memory consumption was 119.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 78]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] 0 int length_0, to_int_1, length_2, to_int_3, result_4, result_5; [L55] 0 pthread_t t1, t2; VAL [length_0=0, length_2=0, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=0, to_int_3=0] [L58] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]]]] VAL [length_0=0, length_2=0, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=0, to_int_3=0] [L58] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_5],IntegerLiteral[0]]]]] VAL [length_0=0, length_2=0, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=0, to_int_3=0] [L58] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]]]] VAL [length_0=0, length_2=0, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=0, to_int_3=0] [L58] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]]]] VAL [length_0=0, length_2=0, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=0, to_int_3=0] [L58] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_4],IntegerLiteral[0]]]]] VAL [length_0=0, length_2=0, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=0, to_int_3=0] [L58] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]]]]] [L58] 0 length_0 = __VERIFIER_nondet_int() [L59] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=0, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=0, to_int_3=0] [L59] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_4],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=0, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=0, to_int_3=0] [L59] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=0, to_int_3=0] [L59] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=0, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=0, to_int_3=0] [L59] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_5],IntegerLiteral[0]]]]] [L59] 0 to_int_1 = __VERIFIER_nondet_int() [L60] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_4],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=0, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=-2, to_int_3=0] [L60] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=0, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=-2, to_int_3=0] [L60] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=-2, to_int_3=0] [L60] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_5],IntegerLiteral[0]]]]] [L60] 0 length_2 = __VERIFIER_nondet_int() [L61] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_5],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=1, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=-2, to_int_3=0] [L61] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=-2, to_int_3=0] [L61] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_4],IntegerLiteral[0]]]]] [L61] 0 to_int_3 = __VERIFIER_nondet_int() [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_5],IntegerLiteral[0]]]]] VAL [length_0=1, length_2=1, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=-2, to_int_3=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_4],IntegerLiteral[0]]]] [L64] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [length_0=1, length_2=1, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=-2, to_int_3=0] [L43] 1 length_0 == 0 ? (length_2 == 0 ? 0 : 1) : (length_2 == 0 ? -1 : minus(to_int_1, to_int_3)) VAL [_argptr={0:0}, _argptr={0:0}, length_0=1, length_2=1, result_4=0, result_5=0, to_int_1=-2, to_int_3=0] [L43] 1 length_2 == 0 ? -1 : minus(to_int_1, to_int_3) [L43] CALL 1 minus(to_int_1, to_int_3) [L78] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]],BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]]] VAL [\old(a)=-2, \old(b)=0, a=-2, b=0, length_0=1, length_2=1, result_4=0, result_5=0, to_int_1=-2, to_int_3=0] - UnprovableResult [Line: 45]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: 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: 64]: 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: 72]: 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: 65]: 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: 64]: 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, 118 locations, 43 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: 2.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 817 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 268 mSDsluCounter, 112 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1244 IncrementalHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 112 mSDtfsCounter, 1244 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=1, InterpolantAutomatonStates: 39, 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.3s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 955 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 22:57:04,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE