./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 27552612 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-2755261-m [2024-01-26 15:20:29,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 15:20:29,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-26 15:20:29,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 15:20:29,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 15:20:29,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 15:20:29,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 15:20:29,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 15:20:29,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-26 15:20:29,530 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-26 15:20:29,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 15:20:29,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 15:20:29,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 15:20:29,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 15:20:29,532 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 15:20:29,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 15:20:29,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 15:20:29,533 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 15:20:29,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 15:20:29,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 15:20:29,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 15:20:29,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 15:20:29,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 15:20:29,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 15:20:29,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-26 15:20:29,535 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 15:20:29,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 15:20:29,535 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 15:20:29,536 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 15:20:29,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 15:20:29,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-26 15:20:29,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 15:20:29,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-26 15:20:29,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 15:20:29,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 15:20:29,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-26 15:20:29,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 15:20:29,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 15:20:29,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 15:20:29,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-26 15:20:29,542 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 15:20:29,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-26 15:20:29,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-26 15:20:29,543 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-26 15:20:29,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 15:20:29,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 15:20:29,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 15:20:29,737 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-26 15:20:29,737 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-26 15:20:29,738 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-26 15:20:29,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 15:20:29,831 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 15:20:29,831 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-26 15:20:30,882 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 15:20:31,021 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 15:20:31,022 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-symm.wvr.c [2024-01-26 15:20:31,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e4472ec/8a87fb8fd6de46de9ade1989dcd1d478/FLAGbb36105c1 [2024-01-26 15:20:31,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e4472ec/8a87fb8fd6de46de9ade1989dcd1d478 [2024-01-26 15:20:31,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 15:20:31,044 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 15:20:31,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 15:20:31,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 15:20:31,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 15:20:31,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 26.01 03:20:29" (1/2) ... [2024-01-26 15:20:31,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64932d2e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 26.01 03:20:31, skipping insertion in model container [2024-01-26 15:20:31,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 26.01 03:20:29" (1/2) ... [2024-01-26 15:20:31,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7785d6cb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 26.01 03:20:31, skipping insertion in model container [2024-01-26 15:20:31,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 03:20:31" (2/2) ... [2024-01-26 15:20:31,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64932d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:31, skipping insertion in model container [2024-01-26 15:20:31,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 03:20:31" (2/2) ... [2024-01-26 15:20:31,054 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-26 15:20:31,068 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-26 15:20:31,070 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_5 == 0 [2024-01-26 15:20:31,071 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_4 == 0 [2024-01-26 15:20:31,071 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_5 == 0 [2024-01-26 15:20:31,071 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] to_int_3 == 0 [2024-01-26 15:20:31,071 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_4 == 0 [2024-01-26 15:20:31,071 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] result_5 == 0 [2024-01-26 15:20:31,071 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] length_0 == 0 [2024-01-26 15:20:31,071 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] to_int_3 == 0 [2024-01-26 15:20:31,071 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] to_int_1 == 0 [2024-01-26 15:20:31,072 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] length_2 == 0 [2024-01-26 15:20:31,072 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] result_4 == 0 [2024-01-26 15:20:31,072 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-26 15:20:31,072 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] result_5 == 0 [2024-01-26 15:20:31,072 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] to_int_3 == 0 [2024-01-26 15:20:31,072 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] result_4 == 0 [2024-01-26 15:20:31,072 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] b != 0 [2024-01-26 15:20:31,073 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] 1 <= b [2024-01-26 15:20:31,073 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] (unsigned long )_argptr == 0UL [2024-01-26 15:20:31,073 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] to_int_3 == 0 [2024-01-26 15:20:31,073 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] result_4 == 0 [2024-01-26 15:20:31,073 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] length_2 == 0 [2024-01-26 15:20:31,074 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] result_5 == 0 [2024-01-26 15:20:31,074 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] to_int_1 == 0 [2024-01-26 15:20:31,074 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] b <= -1 [2024-01-26 15:20:31,074 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] b != 0 [2024-01-26 15:20:31,074 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] result_4 == 0 [2024-01-26 15:20:31,074 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] result_5 == 0 [2024-01-26 15:20:31,074 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] to_int_3 == 0 [2024-01-26 15:20:31,074 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] length_2 == 0 [2024-01-26 15:20:31,090 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 15:20:31,214 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-26 15:20:31,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 15:20:31,227 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 15:20:31,236 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-26 15:20:31,289 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-26 15:20:31,298 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 15:20:31,318 INFO L206 MainTranslator]: Completed translation [2024-01-26 15:20:31,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:31 WrapperNode [2024-01-26 15:20:31,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 15:20:31,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 15:20:31,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 15:20:31,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 15:20:31,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:31" (1/1) ... [2024-01-26 15:20:31,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:31" (1/1) ... [2024-01-26 15:20:31,364 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 157 [2024-01-26 15:20:31,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 15:20:31,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 15:20:31,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 15:20:31,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 15:20:31,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:31" (1/1) ... [2024-01-26 15:20:31,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:31" (1/1) ... [2024-01-26 15:20:31,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:31" (1/1) ... [2024-01-26 15:20:31,403 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-26 15:20:31,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:31" (1/1) ... [2024-01-26 15:20:31,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:31" (1/1) ... [2024-01-26 15:20:31,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:31" (1/1) ... [2024-01-26 15:20:31,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:31" (1/1) ... [2024-01-26 15:20:31,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:31" (1/1) ... [2024-01-26 15:20:31,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:31" (1/1) ... [2024-01-26 15:20:31,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 15:20:31,431 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 15:20:31,431 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 15:20:31,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 15:20:31,432 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:31" (1/1) ... [2024-01-26 15:20:31,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-26 15:20:31,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-26 15:20:31,461 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-26 15:20:31,479 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-26 15:20:31,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 15:20:31,496 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 15:20:31,496 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 15:20:31,496 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 15:20:31,497 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 15:20:31,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-26 15:20:31,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-26 15:20:31,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-26 15:20:31,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 15:20:31,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-26 15:20:31,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-26 15:20:31,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-26 15:20:31,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 15:20:31,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 15:20:31,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-26 15:20:31,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-26 15:20:31,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-26 15:20:31,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 15:20:31,502 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 15:20:31,605 INFO L244 CfgBuilder]: Building ICFG [2024-01-26 15:20:31,606 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 15:20:31,880 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-26 15:20:31,880 INFO L293 CfgBuilder]: Performing block encoding [2024-01-26 15:20:32,077 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 15:20:32,078 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-26 15:20:32,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 03:20:32 BoogieIcfgContainer [2024-01-26 15:20:32,078 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 15:20:32,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 15:20:32,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 15:20:32,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 15:20:32,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 26.01 03:20:29" (1/4) ... [2024-01-26 15:20:32,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ff1420 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 26.01 03:20:32, skipping insertion in model container [2024-01-26 15:20:32,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 03:20:31" (2/4) ... [2024-01-26 15:20:32,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ff1420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 03:20:32, skipping insertion in model container [2024-01-26 15:20:32,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:31" (3/4) ... [2024-01-26 15:20:32,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ff1420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 03:20:32, skipping insertion in model container [2024-01-26 15:20:32,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 03:20:32" (4/4) ... [2024-01-26 15:20:32,085 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-symm.wvr.c [2024-01-26 15:20:32,097 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 15:20:32,098 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2024-01-26 15:20:32,098 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 15:20:32,154 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-26 15:20:32,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 87 transitions, 188 flow [2024-01-26 15:20:32,231 INFO L124 PetriNetUnfolderBase]: 4/85 cut-off events. [2024-01-26 15:20:32,231 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-26 15:20:32,234 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-26 15:20:32,235 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 87 transitions, 188 flow [2024-01-26 15:20:32,239 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 84 transitions, 180 flow [2024-01-26 15:20:32,248 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-26 15:20:32,254 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;@726bbfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 15:20:32,255 INFO L358 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2024-01-26 15:20:32,256 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-26 15:20:32,257 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-26 15:20:32,257 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-26 15:20:32,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:32,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-26 15:20:32,258 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-26 15:20:32,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:32,262 INFO L85 PathProgramCache]: Analyzing trace with hash 15551, now seen corresponding path program 1 times [2024-01-26 15:20:32,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:32,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82245405] [2024-01-26 15:20:32,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:32,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:20:32,402 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-26 15:20:32,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:20:32,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82245405] [2024-01-26 15:20:32,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82245405] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:20:32,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:20:32,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:20:32,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35623643] [2024-01-26 15:20:32,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:20:32,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:20:32,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:20:32,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:20:32,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:20:32,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2024-01-26 15:20:32,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 180 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-26 15:20:32,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:20:32,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2024-01-26 15:20:32,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:20:32,581 INFO L124 PetriNetUnfolderBase]: 182/421 cut-off events. [2024-01-26 15:20:32,582 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-01-26 15:20:32,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 421 events. 182/421 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2194 event pairs, 90 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 640. Up to 206 conditions per place. [2024-01-26 15:20:32,586 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 40 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2024-01-26 15:20:32,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 89 transitions, 277 flow [2024-01-26 15:20:32,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:20:32,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:20:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2024-01-26 15:20:32,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7432950191570882 [2024-01-26 15:20:32,599 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 180 flow. Second operand 3 states and 194 transitions. [2024-01-26 15:20:32,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 89 transitions, 277 flow [2024-01-26 15:20:32,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 89 transitions, 267 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-26 15:20:32,605 INFO L231 Difference]: Finished difference. Result has 80 places, 79 transitions, 166 flow [2024-01-26 15:20:32,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=80, PETRI_TRANSITIONS=79} [2024-01-26 15:20:32,612 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -7 predicate places. [2024-01-26 15:20:32,612 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 166 flow [2024-01-26 15:20:32,613 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-26 15:20:32,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:32,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-26 15:20:32,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 15:20:32,613 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-26 15:20:32,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:32,614 INFO L85 PathProgramCache]: Analyzing trace with hash 482576, now seen corresponding path program 1 times [2024-01-26 15:20:32,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:32,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266457620] [2024-01-26 15:20:32,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:32,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:20:32,637 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-26 15:20:32,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:20:32,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266457620] [2024-01-26 15:20:32,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266457620] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:20:32,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:20:32,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:20:32,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52727788] [2024-01-26 15:20:32,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:20:32,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:20:32,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:20:32,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:20:32,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:20:32,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 87 [2024-01-26 15:20:32,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 166 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-26 15:20:32,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:20:32,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 87 [2024-01-26 15:20:32,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:20:32,810 INFO L124 PetriNetUnfolderBase]: 303/731 cut-off events. [2024-01-26 15:20:32,810 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-01-26 15:20:32,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 731 events. 303/731 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4381 event pairs, 144 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 731. Up to 292 conditions per place. [2024-01-26 15:20:32,817 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 48 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2024-01-26 15:20:32,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 96 transitions, 309 flow [2024-01-26 15:20:32,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:20:32,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:20:32,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2024-01-26 15:20:32,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8045977011494253 [2024-01-26 15:20:32,823 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 166 flow. Second operand 3 states and 210 transitions. [2024-01-26 15:20:32,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 96 transitions, 309 flow [2024-01-26 15:20:32,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 96 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:20:32,827 INFO L231 Difference]: Finished difference. Result has 79 places, 78 transitions, 184 flow [2024-01-26 15:20:32,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=156, 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=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=79, PETRI_TRANSITIONS=78} [2024-01-26 15:20:32,828 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -8 predicate places. [2024-01-26 15:20:32,829 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 184 flow [2024-01-26 15:20:32,829 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-26 15:20:32,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:32,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-26 15:20:32,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-26 15:20:32,830 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-26 15:20:32,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:32,832 INFO L85 PathProgramCache]: Analyzing trace with hash 14960313, now seen corresponding path program 1 times [2024-01-26 15:20:32,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:32,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660104604] [2024-01-26 15:20:32,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:32,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:20:32,872 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-26 15:20:32,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:20:32,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660104604] [2024-01-26 15:20:32,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660104604] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:20:32,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:20:32,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:20:32,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356512435] [2024-01-26 15:20:32,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:20:32,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:20:32,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:20:32,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:20:32,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:20:32,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 87 [2024-01-26 15:20:32,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 78 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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-26 15:20:32,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:20:32,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 87 [2024-01-26 15:20:32,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:20:32,956 INFO L124 PetriNetUnfolderBase]: 295/673 cut-off events. [2024-01-26 15:20:32,956 INFO L125 PetriNetUnfolderBase]: For 134/137 co-relation queries the response was YES. [2024-01-26 15:20:32,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 673 events. 295/673 cut-off events. For 134/137 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3953 event pairs, 226 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 660. Up to 508 conditions per place. [2024-01-26 15:20:32,961 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 30 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2024-01-26 15:20:32,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 76 transitions, 244 flow [2024-01-26 15:20:32,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:20:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:20:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2024-01-26 15:20:32,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7432950191570882 [2024-01-26 15:20:32,962 INFO L175 Difference]: Start difference. First operand has 79 places, 78 transitions, 184 flow. Second operand 3 states and 194 transitions. [2024-01-26 15:20:32,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 76 transitions, 244 flow [2024-01-26 15:20:32,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 76 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:20:32,966 INFO L231 Difference]: Finished difference. Result has 77 places, 76 transitions, 176 flow [2024-01-26 15:20:32,966 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-26 15:20:32,967 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -10 predicate places. [2024-01-26 15:20:32,967 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 76 transitions, 176 flow [2024-01-26 15:20:32,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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-26 15:20:32,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:32,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-26 15:20:32,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-26 15:20:32,968 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-26 15:20:32,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:32,969 INFO L85 PathProgramCache]: Analyzing trace with hash 463770167, now seen corresponding path program 1 times [2024-01-26 15:20:32,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:32,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337997945] [2024-01-26 15:20:32,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:32,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:20:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 15:20:33,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:20:33,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337997945] [2024-01-26 15:20:33,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337997945] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:20:33,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:20:33,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:20:33,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205753509] [2024-01-26 15:20:33,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:20:33,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:20:33,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:20:33,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:20:33,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:20:33,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 87 [2024-01-26 15:20:33,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 76 transitions, 176 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-26 15:20:33,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:20:33,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 87 [2024-01-26 15:20:33,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:20:33,123 INFO L124 PetriNetUnfolderBase]: 295/669 cut-off events. [2024-01-26 15:20:33,124 INFO L125 PetriNetUnfolderBase]: For 53/56 co-relation queries the response was YES. [2024-01-26 15:20:33,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 669 events. 295/669 cut-off events. For 53/56 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3969 event pairs, 226 based on Foata normal form. 1/560 useless extension candidates. Maximal degree in co-relation 1241. Up to 506 conditions per place. [2024-01-26 15:20:33,127 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 31 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2024-01-26 15:20:33,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 72 transitions, 234 flow [2024-01-26 15:20:33,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:20:33,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:20:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2024-01-26 15:20:33,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7203065134099617 [2024-01-26 15:20:33,128 INFO L175 Difference]: Start difference. First operand has 77 places, 76 transitions, 176 flow. Second operand 3 states and 188 transitions. [2024-01-26 15:20:33,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 72 transitions, 234 flow [2024-01-26 15:20:33,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 72 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:20:33,131 INFO L231 Difference]: Finished difference. Result has 73 places, 72 transitions, 168 flow [2024-01-26 15:20:33,131 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-26 15:20:33,132 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -14 predicate places. [2024-01-26 15:20:33,133 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 168 flow [2024-01-26 15:20:33,133 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-26 15:20:33,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:33,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-26 15:20:33,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-26 15:20:33,133 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-26 15:20:33,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:33,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1491973789, now seen corresponding path program 1 times [2024-01-26 15:20:33,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:33,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470826579] [2024-01-26 15:20:33,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:33,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:20:33,184 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-26 15:20:33,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:20:33,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470826579] [2024-01-26 15:20:33,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470826579] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:20:33,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:20:33,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:20:33,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930498158] [2024-01-26 15:20:33,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:20:33,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:20:33,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:20:33,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:20:33,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:20:33,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 87 [2024-01-26 15:20:33,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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-26 15:20:33,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:20:33,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 87 [2024-01-26 15:20:33,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:20:33,315 INFO L124 PetriNetUnfolderBase]: 428/1013 cut-off events. [2024-01-26 15:20:33,315 INFO L125 PetriNetUnfolderBase]: For 65/78 co-relation queries the response was YES. [2024-01-26 15:20:33,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1894 conditions, 1013 events. 428/1013 cut-off events. For 65/78 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6360 event pairs, 243 based on Foata normal form. 0/878 useless extension candidates. Maximal degree in co-relation 1857. Up to 474 conditions per place. [2024-01-26 15:20:33,320 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 48 selfloop transitions, 4 changer transitions 0/91 dead transitions. [2024-01-26 15:20:33,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 319 flow [2024-01-26 15:20:33,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:20:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:20:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2024-01-26 15:20:33,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8352490421455939 [2024-01-26 15:20:33,322 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 168 flow. Second operand 3 states and 218 transitions. [2024-01-26 15:20:33,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 319 flow [2024-01-26 15:20:33,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 91 transitions, 315 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:20:33,324 INFO L231 Difference]: Finished difference. Result has 74 places, 73 transitions, 190 flow [2024-01-26 15:20:33,324 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=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=74, PETRI_TRANSITIONS=73} [2024-01-26 15:20:33,326 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -13 predicate places. [2024-01-26 15:20:33,326 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 73 transitions, 190 flow [2024-01-26 15:20:33,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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-26 15:20:33,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:33,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:20:33,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-26 15:20:33,327 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-26 15:20:33,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:33,327 INFO L85 PathProgramCache]: Analyzing trace with hash -993452307, now seen corresponding path program 1 times [2024-01-26 15:20:33,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:33,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884642212] [2024-01-26 15:20:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:33,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:20:33,366 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-26 15:20:33,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:20:33,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884642212] [2024-01-26 15:20:33,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884642212] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:20:33,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:20:33,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:20:33,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066162801] [2024-01-26 15:20:33,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:20:33,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:20:33,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:20:33,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:20:33,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:20:33,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 87 [2024-01-26 15:20:33,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 73 transitions, 190 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-26 15:20:33,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:20:33,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 87 [2024-01-26 15:20:33,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:20:33,502 INFO L124 PetriNetUnfolderBase]: 421/941 cut-off events. [2024-01-26 15:20:33,502 INFO L125 PetriNetUnfolderBase]: For 287/309 co-relation queries the response was YES. [2024-01-26 15:20:33,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1953 conditions, 941 events. 421/941 cut-off events. For 287/309 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5782 event pairs, 211 based on Foata normal form. 1/837 useless extension candidates. Maximal degree in co-relation 1143. Up to 457 conditions per place. [2024-01-26 15:20:33,506 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 44 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2024-01-26 15:20:33,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 80 transitions, 309 flow [2024-01-26 15:20:33,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:20:33,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:20:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2024-01-26 15:20:33,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7586206896551724 [2024-01-26 15:20:33,508 INFO L175 Difference]: Start difference. First operand has 74 places, 73 transitions, 190 flow. Second operand 3 states and 198 transitions. [2024-01-26 15:20:33,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 80 transitions, 309 flow [2024-01-26 15:20:33,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 80 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:20:33,511 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 176 flow [2024-01-26 15:20:33,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=172, 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=176, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2024-01-26 15:20:33,513 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -18 predicate places. [2024-01-26 15:20:33,514 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 176 flow [2024-01-26 15:20:33,514 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-26 15:20:33,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:33,514 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-26 15:20:33,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-26 15:20:33,514 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 40 more)] === [2024-01-26 15:20:33,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:33,515 INFO L85 PathProgramCache]: Analyzing trace with hash -503135134, now seen corresponding path program 1 times [2024-01-26 15:20:33,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:33,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920675889] [2024-01-26 15:20:33,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:33,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-26 15:20:33,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-26 15:20:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-26 15:20:33,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-26 15:20:33,576 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-26 15:20:33,577 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 43 remaining) [2024-01-26 15:20:33,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 43 remaining) [2024-01-26 15:20:33,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 43 remaining) [2024-01-26 15:20:33,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 43 remaining) [2024-01-26 15:20:33,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 43 remaining) [2024-01-26 15:20:33,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 43 remaining) [2024-01-26 15:20:33,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 43 remaining) [2024-01-26 15:20:33,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 43 remaining) [2024-01-26 15:20:33,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 43 remaining) [2024-01-26 15:20:33,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 43 remaining) [2024-01-26 15:20:33,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 43 remaining) [2024-01-26 15:20:33,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 43 remaining) [2024-01-26 15:20:33,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 43 remaining) [2024-01-26 15:20:33,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 43 remaining) [2024-01-26 15:20:33,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 43 remaining) [2024-01-26 15:20:33,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 43 remaining) [2024-01-26 15:20:33,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 43 remaining) [2024-01-26 15:20:33,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 43 remaining) [2024-01-26 15:20:33,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 43 remaining) [2024-01-26 15:20:33,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 43 remaining) [2024-01-26 15:20:33,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 43 remaining) [2024-01-26 15:20:33,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 43 remaining) [2024-01-26 15:20:33,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 43 remaining) [2024-01-26 15:20:33,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 43 remaining) [2024-01-26 15:20:33,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 43 remaining) [2024-01-26 15:20:33,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 43 remaining) [2024-01-26 15:20:33,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 43 remaining) [2024-01-26 15:20:33,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 43 remaining) [2024-01-26 15:20:33,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 43 remaining) [2024-01-26 15:20:33,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 43 remaining) [2024-01-26 15:20:33,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 43 remaining) [2024-01-26 15:20:33,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (11 of 43 remaining) [2024-01-26 15:20:33,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 43 remaining) [2024-01-26 15:20:33,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 43 remaining) [2024-01-26 15:20:33,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 43 remaining) [2024-01-26 15:20:33,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 43 remaining) [2024-01-26 15:20:33,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 43 remaining) [2024-01-26 15:20:33,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 43 remaining) [2024-01-26 15:20:33,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 43 remaining) [2024-01-26 15:20:33,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 43 remaining) [2024-01-26 15:20:33,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 43 remaining) [2024-01-26 15:20:33,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 43 remaining) [2024-01-26 15:20:33,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 43 remaining) [2024-01-26 15:20:33,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-26 15:20:33,587 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:20:33,592 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 15:20:33,593 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 15:20:33,630 INFO L503 ceAbstractionStarter]: Automizer considered 30 witness invariants [2024-01-26 15:20:33,632 INFO L504 ceAbstractionStarter]: WitnessConsidered=30 [2024-01-26 15:20:33,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 03:20:33 BasicIcfg [2024-01-26 15:20:33,634 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 15:20:33,634 INFO L158 Benchmark]: Toolchain (without parser) took 2590.00ms. Allocated memory was 155.2MB in the beginning and 209.7MB in the end (delta: 54.5MB). Free memory was 96.8MB in the beginning and 150.7MB in the end (delta: -53.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-26 15:20:33,635 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-26 15:20:33,635 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 155.2MB. Free memory was 118.9MB in the beginning and 118.7MB in the end (delta: 153.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-26 15:20:33,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.02ms. Allocated memory is still 155.2MB. Free memory was 96.8MB in the beginning and 81.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-01-26 15:20:33,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.54ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 78.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-26 15:20:33,635 INFO L158 Benchmark]: Boogie Preprocessor took 63.28ms. Allocated memory is still 155.2MB. Free memory was 78.9MB in the beginning and 76.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-26 15:20:33,637 INFO L158 Benchmark]: RCFGBuilder took 647.67ms. Allocated memory is still 155.2MB. Free memory was 76.8MB in the beginning and 115.7MB in the end (delta: -38.9MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2024-01-26 15:20:33,638 INFO L158 Benchmark]: TraceAbstraction took 1554.29ms. Allocated memory was 155.2MB in the beginning and 209.7MB in the end (delta: 54.5MB). Free memory was 115.0MB in the beginning and 150.7MB in the end (delta: -35.7MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-01-26 15:20:33,642 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.08ms. Allocated memory is still 155.2MB. Free memory was 118.9MB in the beginning and 118.7MB in the end (delta: 153.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.02ms. Allocated memory is still 155.2MB. Free memory was 96.8MB in the beginning and 81.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.54ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 78.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.28ms. Allocated memory is still 155.2MB. Free memory was 78.9MB in the beginning and 76.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 647.67ms. Allocated memory is still 155.2MB. Free memory was 76.8MB in the beginning and 115.7MB in the end (delta: -38.9MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1554.29ms. Allocated memory was 155.2MB in the beginning and 209.7MB in the end (delta: 54.5MB). Free memory was 115.0MB in the beginning and 150.7MB in the end (delta: -35.7MB). Peak memory consumption was 19.6MB. 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[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[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[COMPEQ,IdentifierExpression[to_int_1],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[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[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[COMPEQ,IdentifierExpression[result_5],IntegerLiteral[0]]]] [L58] 0 length_0 = __VERIFIER_nondet_int() [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[COMPEQ,IdentifierExpression[result_5],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[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[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_3],IntegerLiteral[0]]]] [L59] 0 to_int_1 = __VERIFIER_nondet_int() [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=0, to_int_3=0] [L60] 0 CodeAnnotStmt[Assertion[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] [L60] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_5],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] [L60] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_4],IntegerLiteral[0]]]] [L60] 0 length_2 = __VERIFIER_nondet_int() [L61] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_4],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=0, 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=0, to_int_3=0] [L61] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_5],IntegerLiteral[0]]]] [L61] 0 to_int_3 = __VERIFIER_nondet_int() [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_4],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, result_4=0, result_5=0, t1={3:0}, t2={5:0}, to_int_1=0, to_int_3=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_5],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=0, 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=0, 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[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]]]] VAL [\old(a)=0, \old(b)=0, a=0, b=0, length_0=1, length_2=1, result_4=0, result_5=0, to_int_1=0, 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: 1.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 359 IncrementalHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 11 mSDtfsCounter, 359 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 63 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-26 15:20:33,676 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