./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-simpl-str-subst.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-subst.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 59af5db6 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-subst.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-simpl-str-subst.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-59af5db-m [2024-02-02 09:19:45,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 09:19:45,284 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-02 09:19:45,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 09:19:45,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 09:19:45,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 09:19:45,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 09:19:45,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 09:19:45,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 09:19:45,326 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 09:19:45,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 09:19:45,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 09:19:45,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 09:19:45,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 09:19:45,329 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 09:19:45,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 09:19:45,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 09:19:45,329 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 09:19:45,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 09:19:45,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 09:19:45,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 09:19:45,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 09:19:45,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 09:19:45,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 09:19:45,331 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 09:19:45,331 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 09:19:45,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 09:19:45,331 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 09:19:45,332 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 09:19:45,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 09:19:45,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 09:19:45,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 09:19:45,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:19:45,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 09:19:45,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 09:19:45,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 09:19:45,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 09:19:45,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 09:19:45,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 09:19:45,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 09:19:45,335 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 09:19:45,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 09:19:45,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 09:19:45,335 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-02 09:19:45,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 09:19:45,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 09:19:45,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 09:19:45,582 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 09:19:45,583 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 09:19:45,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c [2024-02-02 09:19:46,749 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 09:19:46,930 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 09:19:46,931 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c [2024-02-02 09:19:46,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e049ad354/4cc9499e67ee4feca12bace6446cc522/FLAG57148dd0a [2024-02-02 09:19:46,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e049ad354/4cc9499e67ee4feca12bace6446cc522 [2024-02-02 09:19:46,957 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 09:19:46,958 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 09:19:46,961 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-subst.wvr.yml/witness.yml [2024-02-02 09:19:47,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 09:19:47,066 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 09:19:47,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 09:19:47,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 09:19:47,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 09:19:47,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:19:46" (1/2) ... [2024-02-02 09:19:47,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42bbd12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:47, skipping insertion in model container [2024-02-02 09:19:47,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:19:46" (1/2) ... [2024-02-02 09:19:47,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3ca3d9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:47, skipping insertion in model container [2024-02-02 09:19:47,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:19:47" (2/2) ... [2024-02-02 09:19:47,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42bbd12b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:47, skipping insertion in model container [2024-02-02 09:19:47,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:19:47" (2/2) ... [2024-02-02 09:19:47,076 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 09:19:47,096 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 09:19:47,097 INFO L101 nessWitnessExtractor]: Location invariant before [L66-L66] ((((((length_2 == 0) && (to_int_3 == 0)) && (length_4 == 0)) && (to_int_5 == 0)) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-02-02 09:19:47,097 INFO L101 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-02-02 09:19:47,097 INFO L101 nessWitnessExtractor]: Location invariant before [L88-L88] (b <= -1) && (b != 0) [2024-02-02 09:19:47,098 INFO L101 nessWitnessExtractor]: Location invariant before [L67-L67] (((((to_int_3 == 0) && (length_4 == 0)) && (to_int_5 == 0)) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-02-02 09:19:47,098 INFO L101 nessWitnessExtractor]: Location invariant before [L72-L72] ((result_6 == 0) && (result_7 == 0)) && (result_8 == 0) [2024-02-02 09:19:47,098 INFO L101 nessWitnessExtractor]: Location invariant before [L64-L64] ((((((((length_0 == 0) && (to_int_1 == 0)) && (length_2 == 0)) && (to_int_3 == 0)) && (length_4 == 0)) && (to_int_5 == 0)) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-02-02 09:19:47,098 INFO L101 nessWitnessExtractor]: Location invariant before [L45-L45] (unsigned long )_argptr == 0UL [2024-02-02 09:19:47,098 INFO L101 nessWitnessExtractor]: Location invariant before [L87-L87] (1 <= b) && (b != 0) [2024-02-02 09:19:47,098 INFO L101 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-02-02 09:19:47,098 INFO L101 nessWitnessExtractor]: Location invariant before [L69-L69] (((to_int_5 == 0) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-02-02 09:19:47,098 INFO L101 nessWitnessExtractor]: Location invariant before [L68-L68] ((((length_4 == 0) && (to_int_5 == 0)) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-02-02 09:19:47,099 INFO L101 nessWitnessExtractor]: Location invariant before [L22-L25] (((to_int_5 == 0) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-02-02 09:19:47,099 INFO L101 nessWitnessExtractor]: Location invariant before [L65-L65] (((((((to_int_1 == 0) && (length_2 == 0)) && (to_int_3 == 0)) && (length_4 == 0)) && (to_int_5 == 0)) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-02-02 09:19:47,116 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-02 09:19:47,251 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-subst.wvr.c[2614,2627] [2024-02-02 09:19:47,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:19:47,265 INFO L202 MainTranslator]: Completed pre-run [2024-02-02 09:19:47,277 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 [2024-02-02 09:19:47,343 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-subst.wvr.c[2614,2627] Start Parsing Local Start Parsing Local [2024-02-02 09:19:47,374 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:19:47,389 INFO L206 MainTranslator]: Completed translation [2024-02-02 09:19:47,389 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:47 WrapperNode [2024-02-02 09:19:47,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 09:19:47,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 09:19:47,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 09:19:47,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 09:19:47,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:47" (1/1) ... [2024-02-02 09:19:47,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:47" (1/1) ... [2024-02-02 09:19:47,423 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 191 [2024-02-02 09:19:47,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 09:19:47,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 09:19:47,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 09:19:47,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 09:19:47,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:47" (1/1) ... [2024-02-02 09:19:47,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:47" (1/1) ... [2024-02-02 09:19:47,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:47" (1/1) ... [2024-02-02 09:19:47,456 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-02 09:19:47,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:47" (1/1) ... [2024-02-02 09:19:47,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:47" (1/1) ... [2024-02-02 09:19:47,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:47" (1/1) ... [2024-02-02 09:19:47,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:47" (1/1) ... [2024-02-02 09:19:47,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:47" (1/1) ... [2024-02-02 09:19:47,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:47" (1/1) ... [2024-02-02 09:19:47,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 09:19:47,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 09:19:47,473 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 09:19:47,473 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 09:19:47,473 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:47" (1/1) ... [2024-02-02 09:19:47,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:19:47,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:19:47,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-02 09:19:47,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-02 09:19:47,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 09:19:47,550 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-02 09:19:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-02 09:19:47,550 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-02 09:19:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-02 09:19:47,550 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-02 09:19:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-02 09:19:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 09:19:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 09:19:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 09:19:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-02 09:19:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 09:19:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 09:19:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 09:19:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 09:19:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-02 09:19:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 09:19:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 09:19:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-02 09:19:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-02 09:19:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-02 09:19:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-02 09:19:47,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 09:19:47,553 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-02 09:19:47,682 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 09:19:47,684 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 09:19:47,963 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 09:19:47,963 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 09:19:48,121 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 09:19:48,121 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-02 09:19:48,123 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:19:48 BoogieIcfgContainer [2024-02-02 09:19:48,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 09:19:48,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 09:19:48,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 09:19:48,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 09:19:48,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:19:46" (1/4) ... [2024-02-02 09:19:48,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506e1be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:19:48, skipping insertion in model container [2024-02-02 09:19:48,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:19:47" (2/4) ... [2024-02-02 09:19:48,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506e1be and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:19:48, skipping insertion in model container [2024-02-02 09:19:48,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:47" (3/4) ... [2024-02-02 09:19:48,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506e1be and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:19:48, skipping insertion in model container [2024-02-02 09:19:48,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:19:48" (4/4) ... [2024-02-02 09:19:48,130 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-subst.wvr.c [2024-02-02 09:19:48,143 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 09:19:48,143 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-02-02 09:19:48,143 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 09:19:48,216 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-02 09:19:48,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 71 transitions, 163 flow [2024-02-02 09:19:48,285 INFO L124 PetriNetUnfolderBase]: 6/68 cut-off events. [2024-02-02 09:19:48,285 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-02 09:19:48,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 68 events. 6/68 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 157 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-02-02 09:19:48,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 71 transitions, 163 flow [2024-02-02 09:19:48,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 67 transitions, 152 flow [2024-02-02 09:19:48,305 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 09:19:48,311 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;@746a3c22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 09:19:48,312 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-02-02 09:19:48,313 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 09:19:48,313 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 09:19:48,314 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:48,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:48,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 09:19:48,314 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-02-02 09:19:48,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:48,318 INFO L85 PathProgramCache]: Analyzing trace with hash 17658, now seen corresponding path program 1 times [2024-02-02 09:19:48,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:48,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366008470] [2024-02-02 09:19:48,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:48,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:48,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:48,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366008470] [2024-02-02 09:19:48,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366008470] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:48,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:48,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:48,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340201608] [2024-02-02 09:19:48,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:48,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:48,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:48,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:48,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:48,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2024-02-02 09:19:48,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:48,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:48,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2024-02-02 09:19:48,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:49,116 INFO L124 PetriNetUnfolderBase]: 3281/5193 cut-off events. [2024-02-02 09:19:49,117 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2024-02-02 09:19:49,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9850 conditions, 5193 events. 3281/5193 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 32388 event pairs, 2653 based on Foata normal form. 0/4240 useless extension candidates. Maximal degree in co-relation 8903. Up to 4433 conditions per place. [2024-02-02 09:19:49,149 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 48 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-02-02 09:19:49,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 66 transitions, 250 flow [2024-02-02 09:19:49,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-02-02 09:19:49,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070422535211268 [2024-02-02 09:19:49,163 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 152 flow. Second operand 3 states and 108 transitions. [2024-02-02 09:19:49,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 66 transitions, 250 flow [2024-02-02 09:19:49,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 238 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-02-02 09:19:49,174 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 142 flow [2024-02-02 09:19:49,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2024-02-02 09:19:49,179 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -5 predicate places. [2024-02-02 09:19:49,180 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 142 flow [2024-02-02 09:19:49,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:49,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:49,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-02 09:19:49,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 09:19:49,181 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-02-02 09:19:49,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:49,182 INFO L85 PathProgramCache]: Analyzing trace with hash 547995, now seen corresponding path program 1 times [2024-02-02 09:19:49,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:49,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403118363] [2024-02-02 09:19:49,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:49,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:49,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:49,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403118363] [2024-02-02 09:19:49,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403118363] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:49,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:49,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:49,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787256025] [2024-02-02 09:19:49,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:49,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:49,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:49,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:49,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:49,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 71 [2024-02-02 09:19:49,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:49,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:49,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 71 [2024-02-02 09:19:49,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:49,602 INFO L124 PetriNetUnfolderBase]: 2514/4006 cut-off events. [2024-02-02 09:19:49,603 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-02-02 09:19:49,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7518 conditions, 4006 events. 2514/4006 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 25838 event pairs, 2027 based on Foata normal form. 0/3461 useless extension candidates. Maximal degree in co-relation 7509. Up to 3449 conditions per place. [2024-02-02 09:19:49,624 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 45 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-02-02 09:19:49,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 234 flow [2024-02-02 09:19:49,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-02-02 09:19:49,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5352112676056338 [2024-02-02 09:19:49,627 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 142 flow. Second operand 3 states and 114 transitions. [2024-02-02 09:19:49,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 234 flow [2024-02-02 09:19:49,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 65 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:49,629 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 140 flow [2024-02-02 09:19:49,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2024-02-02 09:19:49,630 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -6 predicate places. [2024-02-02 09:19:49,630 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 140 flow [2024-02-02 09:19:49,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:49,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:49,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-02 09:19:49,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 09:19:49,631 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-02-02 09:19:49,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:49,632 INFO L85 PathProgramCache]: Analyzing trace with hash 16988402, now seen corresponding path program 1 times [2024-02-02 09:19:49,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:49,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324951696] [2024-02-02 09:19:49,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:49,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:49,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:49,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:49,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324951696] [2024-02-02 09:19:49,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324951696] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:49,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:49,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:49,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763784837] [2024-02-02 09:19:49,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:49,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:49,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:49,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:49,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:49,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 71 [2024-02-02 09:19:49,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:49,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:49,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 71 [2024-02-02 09:19:49,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:49,977 INFO L124 PetriNetUnfolderBase]: 2514/4005 cut-off events. [2024-02-02 09:19:49,977 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-02-02 09:19:49,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7516 conditions, 4005 events. 2514/4005 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 25776 event pairs, 2027 based on Foata normal form. 0/3461 useless extension candidates. Maximal degree in co-relation 7505. Up to 3447 conditions per place. [2024-02-02 09:19:50,001 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 44 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-02-02 09:19:50,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 230 flow [2024-02-02 09:19:50,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-02-02 09:19:50,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5446009389671361 [2024-02-02 09:19:50,006 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 140 flow. Second operand 3 states and 116 transitions. [2024-02-02 09:19:50,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 230 flow [2024-02-02 09:19:50,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 64 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:50,008 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 138 flow [2024-02-02 09:19:50,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2024-02-02 09:19:50,009 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -7 predicate places. [2024-02-02 09:19:50,009 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 138 flow [2024-02-02 09:19:50,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:50,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:50,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-02 09:19:50,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-02 09:19:50,011 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-02-02 09:19:50,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:50,016 INFO L85 PathProgramCache]: Analyzing trace with hash 526641033, now seen corresponding path program 1 times [2024-02-02 09:19:50,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:50,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42137607] [2024-02-02 09:19:50,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:50,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:50,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:50,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42137607] [2024-02-02 09:19:50,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42137607] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:50,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:50,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:50,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400103073] [2024-02-02 09:19:50,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:50,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:50,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:50,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:50,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:50,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 71 [2024-02-02 09:19:50,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:50,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:50,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 71 [2024-02-02 09:19:50,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:50,389 INFO L124 PetriNetUnfolderBase]: 2161/3504 cut-off events. [2024-02-02 09:19:50,389 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-02-02 09:19:50,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6625 conditions, 3504 events. 2161/3504 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 23170 event pairs, 1782 based on Foata normal form. 0/3040 useless extension candidates. Maximal degree in co-relation 6612. Up to 3056 conditions per place. [2024-02-02 09:19:50,404 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 42 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-02-02 09:19:50,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 224 flow [2024-02-02 09:19:50,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:50,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:50,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-02-02 09:19:50,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5633802816901409 [2024-02-02 09:19:50,406 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 138 flow. Second operand 3 states and 120 transitions. [2024-02-02 09:19:50,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 224 flow [2024-02-02 09:19:50,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:50,407 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 136 flow [2024-02-02 09:19:50,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2024-02-02 09:19:50,408 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -8 predicate places. [2024-02-02 09:19:50,408 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 136 flow [2024-02-02 09:19:50,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:50,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:50,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-02 09:19:50,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-02 09:19:50,408 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-02-02 09:19:50,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:50,409 INFO L85 PathProgramCache]: Analyzing trace with hash -853996580, now seen corresponding path program 1 times [2024-02-02 09:19:50,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:50,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324660542] [2024-02-02 09:19:50,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:50,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:50,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:50,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324660542] [2024-02-02 09:19:50,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324660542] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:50,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:50,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:50,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547728668] [2024-02-02 09:19:50,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:50,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:50,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:50,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:50,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:50,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 71 [2024-02-02 09:19:50,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:50,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:50,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 71 [2024-02-02 09:19:50,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:50,657 INFO L124 PetriNetUnfolderBase]: 2161/3503 cut-off events. [2024-02-02 09:19:50,657 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-02-02 09:19:50,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6623 conditions, 3503 events. 2161/3503 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 23117 event pairs, 1782 based on Foata normal form. 0/3040 useless extension candidates. Maximal degree in co-relation 6608. Up to 3054 conditions per place. [2024-02-02 09:19:50,672 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 41 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2024-02-02 09:19:50,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 62 transitions, 220 flow [2024-02-02 09:19:50,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:50,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2024-02-02 09:19:50,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5727699530516432 [2024-02-02 09:19:50,673 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 136 flow. Second operand 3 states and 122 transitions. [2024-02-02 09:19:50,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 62 transitions, 220 flow [2024-02-02 09:19:50,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 62 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:50,674 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 134 flow [2024-02-02 09:19:50,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2024-02-02 09:19:50,675 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -9 predicate places. [2024-02-02 09:19:50,675 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 134 flow [2024-02-02 09:19:50,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:50,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:50,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:50,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-02 09:19:50,675 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-02-02 09:19:50,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:50,676 INFO L85 PathProgramCache]: Analyzing trace with hash -704089664, now seen corresponding path program 1 times [2024-02-02 09:19:50,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:50,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906180624] [2024-02-02 09:19:50,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:50,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:50,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:50,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906180624] [2024-02-02 09:19:50,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906180624] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:50,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:50,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:50,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081002384] [2024-02-02 09:19:50,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:50,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:50,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:50,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:50,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:50,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 71 [2024-02-02 09:19:50,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:50,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:50,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 71 [2024-02-02 09:19:50,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:50,914 INFO L124 PetriNetUnfolderBase]: 2161/3502 cut-off events. [2024-02-02 09:19:50,915 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-02-02 09:19:50,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6621 conditions, 3502 events. 2161/3502 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 23131 event pairs, 1782 based on Foata normal form. 0/3040 useless extension candidates. Maximal degree in co-relation 6604. Up to 3052 conditions per place. [2024-02-02 09:19:50,932 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 40 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2024-02-02 09:19:50,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 61 transitions, 216 flow [2024-02-02 09:19:50,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-02-02 09:19:50,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5821596244131455 [2024-02-02 09:19:50,934 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 134 flow. Second operand 3 states and 124 transitions. [2024-02-02 09:19:50,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 61 transitions, 216 flow [2024-02-02 09:19:50,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 61 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:50,936 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 132 flow [2024-02-02 09:19:50,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2024-02-02 09:19:50,939 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -10 predicate places. [2024-02-02 09:19:50,939 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 132 flow [2024-02-02 09:19:50,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:50,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:50,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:50,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-02 09:19:50,940 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-02-02 09:19:50,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:50,941 INFO L85 PathProgramCache]: Analyzing trace with hash -351942509, now seen corresponding path program 1 times [2024-02-02 09:19:50,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:50,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188333176] [2024-02-02 09:19:50,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:50,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:50,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:50,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:50,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188333176] [2024-02-02 09:19:50,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188333176] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:50,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:50,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:50,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715813344] [2024-02-02 09:19:50,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:50,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:50,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:50,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:50,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:50,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 71 [2024-02-02 09:19:50,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:50,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:50,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 71 [2024-02-02 09:19:50,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:51,216 INFO L124 PetriNetUnfolderBase]: 2157/3518 cut-off events. [2024-02-02 09:19:51,217 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-02-02 09:19:51,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6636 conditions, 3518 events. 2157/3518 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 23801 event pairs, 712 based on Foata normal form. 0/3082 useless extension candidates. Maximal degree in co-relation 6617. Up to 2003 conditions per place. [2024-02-02 09:19:51,235 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 60 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2024-02-02 09:19:51,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 306 flow [2024-02-02 09:19:51,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:51,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2024-02-02 09:19:51,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6995305164319249 [2024-02-02 09:19:51,236 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 132 flow. Second operand 3 states and 149 transitions. [2024-02-02 09:19:51,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 306 flow [2024-02-02 09:19:51,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 83 transitions, 302 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:51,239 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 150 flow [2024-02-02 09:19:51,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2024-02-02 09:19:51,240 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -10 predicate places. [2024-02-02 09:19:51,240 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 150 flow [2024-02-02 09:19:51,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:51,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:51,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:51,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 09:19:51,240 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-02-02 09:19:51,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:51,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1733425579, now seen corresponding path program 1 times [2024-02-02 09:19:51,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:51,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781217859] [2024-02-02 09:19:51,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:51,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:19:51,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 09:19:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:19:51,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 09:19:51,296 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 09:19:51,297 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 29 remaining) [2024-02-02 09:19:51,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 29 remaining) [2024-02-02 09:19:51,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 29 remaining) [2024-02-02 09:19:51,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 29 remaining) [2024-02-02 09:19:51,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 29 remaining) [2024-02-02 09:19:51,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 29 remaining) [2024-02-02 09:19:51,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 29 remaining) [2024-02-02 09:19:51,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 29 remaining) [2024-02-02 09:19:51,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 29 remaining) [2024-02-02 09:19:51,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 29 remaining) [2024-02-02 09:19:51,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 29 remaining) [2024-02-02 09:19:51,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 29 remaining) [2024-02-02 09:19:51,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 29 remaining) [2024-02-02 09:19:51,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 29 remaining) [2024-02-02 09:19:51,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 29 remaining) [2024-02-02 09:19:51,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 29 remaining) [2024-02-02 09:19:51,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 29 remaining) [2024-02-02 09:19:51,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (11 of 29 remaining) [2024-02-02 09:19:51,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 29 remaining) [2024-02-02 09:19:51,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 29 remaining) [2024-02-02 09:19:51,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 29 remaining) [2024-02-02 09:19:51,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 29 remaining) [2024-02-02 09:19:51,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 29 remaining) [2024-02-02 09:19:51,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 29 remaining) [2024-02-02 09:19:51,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 29 remaining) [2024-02-02 09:19:51,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 29 remaining) [2024-02-02 09:19:51,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 29 remaining) [2024-02-02 09:19:51,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 29 remaining) [2024-02-02 09:19:51,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 29 remaining) [2024-02-02 09:19:51,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-02 09:19:51,305 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:51,311 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 09:19:51,311 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 09:19:51,340 INFO L503 ceAbstractionStarter]: Automizer considered 16 witness invariants [2024-02-02 09:19:51,340 INFO L504 ceAbstractionStarter]: WitnessConsidered=16 [2024-02-02 09:19:51,342 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:19:51 BasicIcfg [2024-02-02 09:19:51,342 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 09:19:51,342 INFO L158 Benchmark]: Toolchain (without parser) took 4276.20ms. Allocated memory was 117.4MB in the beginning and 736.1MB in the end (delta: 618.7MB). Free memory was 62.2MB in the beginning and 551.7MB in the end (delta: -489.5MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. [2024-02-02 09:19:51,342 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory was 85.5MB in the beginning and 85.3MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:19:51,343 INFO L158 Benchmark]: Witness Parser took 1.51ms. Allocated memory is still 117.4MB. Free memory is still 66.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:19:51,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.02ms. Allocated memory is still 117.4MB. Free memory was 61.8MB in the beginning and 90.8MB in the end (delta: -28.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-02-02 09:19:51,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.58ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 88.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:19:51,345 INFO L158 Benchmark]: Boogie Preprocessor took 46.90ms. Allocated memory is still 117.4MB. Free memory was 88.4MB in the beginning and 85.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-02 09:19:51,345 INFO L158 Benchmark]: RCFGBuilder took 650.53ms. Allocated memory is still 117.4MB. Free memory was 85.7MB in the beginning and 77.7MB in the end (delta: 8.0MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2024-02-02 09:19:51,346 INFO L158 Benchmark]: TraceAbstraction took 3216.79ms. Allocated memory was 117.4MB in the beginning and 736.1MB in the end (delta: 618.7MB). Free memory was 77.0MB in the beginning and 551.7MB in the end (delta: -474.7MB). Peak memory consumption was 145.0MB. Max. memory is 16.1GB. [2024-02-02 09:19:51,347 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory was 85.5MB in the beginning and 85.3MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 1.51ms. Allocated memory is still 117.4MB. Free memory is still 66.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.02ms. Allocated memory is still 117.4MB. Free memory was 61.8MB in the beginning and 90.8MB in the end (delta: -28.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.58ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 88.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.90ms. Allocated memory is still 117.4MB. Free memory was 88.4MB in the beginning and 85.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 650.53ms. Allocated memory is still 117.4MB. Free memory was 85.7MB in the beginning and 77.7MB in the end (delta: 8.0MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3216.79ms. Allocated memory was 117.4MB in the beginning and 736.1MB in the end (delta: 618.7MB). Free memory was 77.0MB in the beginning and 551.7MB in the end (delta: -474.7MB). Peak memory consumption was 145.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 87]: 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, length_4, to_int_5, result_6, result_7, result_8; [L61] 0 pthread_t t1, t2, t3; VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L64] 0 length_0 = __VERIFIER_nondet_int() [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L65] 0 to_int_1 = __VERIFIER_nondet_int() [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L66] 0 length_2 = __VERIFIER_nondet_int() [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L67] 0 to_int_3 = __VERIFIER_nondet_int() [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L68] 0 length_4 = __VERIFIER_nondet_int() [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L69] 0 to_int_5 = __VERIFIER_nondet_int() [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=-2, to_int_3=0, to_int_5=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, length_4=0, result_6=0, result_7=0, result_8=0, to_int_1=-2, to_int_3=0, to_int_5=0] [L43] 1 length_2 == 0 ? -1 : minus(to_int_1, to_int_3) [L43] CALL 1 minus(to_int_1, to_int_3) [L87] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]],BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]]] VAL [\old(a)=-2, \old(b)=0, a=-2, b=0, length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, to_int_1=-2, to_int_3=0, to_int_5=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: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: 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: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: 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: 74]: 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: 72]: 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: 73]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 105 locations, 29 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: 3.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 141 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 617 IncrementalHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 25 mSDtfsCounter, 617 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 448 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-02 09:19:51,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE