./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/security.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/security.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ab2e0ac4 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/security.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/security.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-ab2e0ac-m [2024-01-29 14:20:26,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 14:20:26,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 14:20:26,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 14:20:26,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 14:20:26,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 14:20:26,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 14:20:26,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 14:20:26,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 14:20:26,526 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 14:20:26,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 14:20:26,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 14:20:26,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 14:20:26,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 14:20:26,528 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 14:20:26,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 14:20:26,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 14:20:26,529 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 14:20:26,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 14:20:26,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 14:20:26,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 14:20:26,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 14:20:26,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 14:20:26,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 14:20:26,531 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 14:20:26,531 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 14:20:26,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 14:20:26,531 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 14:20:26,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 14:20:26,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 14:20:26,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 14:20:26,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 14:20:26,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:20:26,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 14:20:26,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 14:20:26,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 14:20:26,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 14:20:26,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 14:20:26,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 14:20:26,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 14:20:26,535 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 14:20:26,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 14:20:26,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 14:20:26,535 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 14:20:26,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 14:20:26,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 14:20:26,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 14:20:26,776 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 14:20:26,777 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 14:20:26,778 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/security.wvr.yml/witness.yml [2024-01-29 14:20:26,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 14:20:26,912 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 14:20:26,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/security.wvr.c [2024-01-29 14:20:27,888 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 14:20:28,081 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 14:20:28,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/security.wvr.c [2024-01-29 14:20:28,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1e8114af/635f3bf7198b4fc48715427f34373b30/FLAGe3be81593 [2024-01-29 14:20:28,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1e8114af/635f3bf7198b4fc48715427f34373b30 [2024-01-29 14:20:28,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 14:20:28,100 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 14:20:28,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 14:20:28,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 14:20:28,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 14:20:28,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:20:26" (1/2) ... [2024-01-29 14:20:28,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fffbabd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:20:28, skipping insertion in model container [2024-01-29 14:20:28,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:20:26" (1/2) ... [2024-01-29 14:20:28,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@68d8696e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:20:28, skipping insertion in model container [2024-01-29 14:20:28,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:20:28" (2/2) ... [2024-01-29 14:20:28,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fffbabd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:28, skipping insertion in model container [2024-01-29 14:20:28,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:20:28" (2/2) ... [2024-01-29 14:20:28,108 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 14:20:28,117 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 14:20:28,118 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-29 14:20:28,118 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L59] (unsigned long )_argptr == 0UL [2024-01-29 14:20:28,118 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] l1 == 0U [2024-01-29 14:20:28,118 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] z1 == 0U [2024-01-29 14:20:28,119 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] x2 == 0U [2024-01-29 14:20:28,119 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] x1 == 0U [2024-01-29 14:20:28,119 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] z2 == 0U [2024-01-29 14:20:28,119 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] l2 == 0U [2024-01-29 14:20:28,119 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L47] x1 == 0U [2024-01-29 14:20:28,119 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L47] y == 0U [2024-01-29 14:20:28,119 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L47] l2 == 0U [2024-01-29 14:20:28,120 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L47] (unsigned long )_argptr == 0UL [2024-01-29 14:20:28,120 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L47] l1 == 0U [2024-01-29 14:20:28,120 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L47] z1 == 0U [2024-01-29 14:20:28,120 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L47] x2 == 0U [2024-01-29 14:20:28,120 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L47] z2 == 0U [2024-01-29 14:20:28,120 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-29 14:20:28,120 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-29 14:20:28,120 INFO L98 nessWitnessExtractor]: Location invariant before [L42-L42] (unsigned long )_argptr == 0UL [2024-01-29 14:20:28,121 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] (unsigned long )_argptr == 0UL [2024-01-29 14:20:28,121 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-29 14:20:28,121 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-01-29 14:20:28,121 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] x1 == 0U [2024-01-29 14:20:28,121 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] l1 == 0U [2024-01-29 14:20:28,121 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] y == 0U [2024-01-29 14:20:28,121 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] x2 == 0U [2024-01-29 14:20:28,122 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] l2 == 0U [2024-01-29 14:20:28,122 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] z1 == 0U [2024-01-29 14:20:28,122 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] z2 == 0U [2024-01-29 14:20:28,122 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-29 14:20:28,122 INFO L98 nessWitnessExtractor]: Location invariant before [L46-L46] (unsigned long )_argptr == 0UL [2024-01-29 14:20:28,122 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (unsigned long )_argptr == 0UL [2024-01-29 14:20:28,122 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] val == (_Bool)0 || val == (_Bool)1 [2024-01-29 14:20:28,137 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 14:20:28,278 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/security.wvr.c[1957,1970] [2024-01-29 14:20:28,281 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:20:28,289 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 14:20:28,297 WARN L424 MainDispatcher]: Unable to annotate __assert_fail(const char *__assertion, const char *__file, unsigned int __line, const char *__function) with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 14:20:28,371 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/security.wvr.c[1957,1970] [2024-01-29 14:20:28,372 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:20:28,382 INFO L206 MainTranslator]: Completed translation [2024-01-29 14:20:28,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:28 WrapperNode [2024-01-29 14:20:28,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 14:20:28,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 14:20:28,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 14:20:28,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 14:20:28,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:28" (1/1) ... [2024-01-29 14:20:28,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:28" (1/1) ... [2024-01-29 14:20:28,455 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2024-01-29 14:20:28,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 14:20:28,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 14:20:28,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 14:20:28,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 14:20:28,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:28" (1/1) ... [2024-01-29 14:20:28,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:28" (1/1) ... [2024-01-29 14:20:28,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:28" (1/1) ... [2024-01-29 14:20:28,494 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-01-29 14:20:28,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:28" (1/1) ... [2024-01-29 14:20:28,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:28" (1/1) ... [2024-01-29 14:20:28,498 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:28" (1/1) ... [2024-01-29 14:20:28,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:28" (1/1) ... [2024-01-29 14:20:28,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:28" (1/1) ... [2024-01-29 14:20:28,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:28" (1/1) ... [2024-01-29 14:20:28,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 14:20:28,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 14:20:28,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 14:20:28,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 14:20:28,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:28" (1/1) ... [2024-01-29 14:20:28,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:20:28,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:20:28,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 14:20:28,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 14:20:28,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 14:20:28,614 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 14:20:28,614 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 14:20:28,614 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 14:20:28,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 14:20:28,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 14:20:28,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 14:20:28,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 14:20:28,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 14:20:28,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 14:20:28,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 14:20:28,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 14:20:28,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 14:20:28,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 14:20:28,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 14:20:28,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 14:20:28,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 14:20:28,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 14:20:28,620 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 14:20:28,720 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 14:20:28,722 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 14:20:28,941 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 14:20:28,941 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 14:20:29,016 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 14:20:29,017 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 14:20:29,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:20:29 BoogieIcfgContainer [2024-01-29 14:20:29,017 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 14:20:29,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 14:20:29,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 14:20:29,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 14:20:29,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:20:26" (1/4) ... [2024-01-29 14:20:29,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17911b57 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:20:29, skipping insertion in model container [2024-01-29 14:20:29,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 02:20:28" (2/4) ... [2024-01-29 14:20:29,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17911b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:20:29, skipping insertion in model container [2024-01-29 14:20:29,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:20:28" (3/4) ... [2024-01-29 14:20:29,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17911b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:20:29, skipping insertion in model container [2024-01-29 14:20:29,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:20:29" (4/4) ... [2024-01-29 14:20:29,024 INFO L112 eAbstractionObserver]: Analyzing ICFG security.wvr.c [2024-01-29 14:20:29,037 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 14:20:29,037 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2024-01-29 14:20:29,037 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 14:20:29,084 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 14:20:29,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 83 transitions, 180 flow [2024-01-29 14:20:29,146 INFO L124 PetriNetUnfolderBase]: 2/81 cut-off events. [2024-01-29 14:20:29,148 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 14:20:29,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 81 events. 2/81 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 115 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2024-01-29 14:20:29,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 83 transitions, 180 flow [2024-01-29 14:20:29,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 80 transitions, 172 flow [2024-01-29 14:20:29,170 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 14:20:29,175 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;@6d0a0aa7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 14:20:29,180 INFO L358 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2024-01-29 14:20:29,182 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 14:20:29,182 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 14:20:29,183 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:20:29,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:29,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 14:20:29,184 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 51 more)] === [2024-01-29 14:20:29,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:29,188 INFO L85 PathProgramCache]: Analyzing trace with hash 9481, now seen corresponding path program 1 times [2024-01-29 14:20:29,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:29,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239327668] [2024-01-29 14:20:29,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:29,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:20:29,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:29,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239327668] [2024-01-29 14:20:29,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239327668] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:29,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:29,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:20:29,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557452486] [2024-01-29 14:20:29,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:29,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:29,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:29,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:29,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:29,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 83 [2024-01-29 14:20:29,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 80 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:29,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:29,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 83 [2024-01-29 14:20:29,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:29,702 INFO L124 PetriNetUnfolderBase]: 246/574 cut-off events. [2024-01-29 14:20:29,702 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-29 14:20:29,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 574 events. 246/574 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2602 event pairs, 117 based on Foata normal form. 6/516 useless extension candidates. Maximal degree in co-relation 916. Up to 364 conditions per place. [2024-01-29 14:20:29,711 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 37 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2024-01-29 14:20:29,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 89 transitions, 271 flow [2024-01-29 14:20:29,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:29,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:29,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2024-01-29 14:20:29,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7951807228915663 [2024-01-29 14:20:29,724 INFO L175 Difference]: Start difference. First operand has 85 places, 80 transitions, 172 flow. Second operand 3 states and 198 transitions. [2024-01-29 14:20:29,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 89 transitions, 271 flow [2024-01-29 14:20:29,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 89 transitions, 261 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 14:20:29,733 INFO L231 Difference]: Finished difference. Result has 82 places, 78 transitions, 168 flow [2024-01-29 14:20:29,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=82, PETRI_TRANSITIONS=78} [2024-01-29 14:20:29,738 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -3 predicate places. [2024-01-29 14:20:29,738 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 168 flow [2024-01-29 14:20:29,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:29,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:29,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 14:20:29,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 14:20:29,739 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 51 more)] === [2024-01-29 14:20:29,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash 294228, now seen corresponding path program 1 times [2024-01-29 14:20:29,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:29,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783516286] [2024-01-29 14:20:29,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:29,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:29,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:20:29,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:29,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783516286] [2024-01-29 14:20:29,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783516286] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:29,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:29,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:20:29,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633347485] [2024-01-29 14:20:29,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:29,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:29,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:29,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:29,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:29,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 83 [2024-01-29 14:20:29,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 78 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:29,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:29,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 83 [2024-01-29 14:20:29,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:29,940 INFO L124 PetriNetUnfolderBase]: 251/788 cut-off events. [2024-01-29 14:20:29,941 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-01-29 14:20:29,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 788 events. 251/788 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4712 event pairs, 7 based on Foata normal form. 2/655 useless extension candidates. Maximal degree in co-relation 968. Up to 405 conditions per place. [2024-01-29 14:20:29,947 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 37 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2024-01-29 14:20:29,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 87 transitions, 268 flow [2024-01-29 14:20:29,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2024-01-29 14:20:29,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7911646586345381 [2024-01-29 14:20:29,953 INFO L175 Difference]: Start difference. First operand has 82 places, 78 transitions, 168 flow. Second operand 3 states and 197 transitions. [2024-01-29 14:20:29,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 87 transitions, 268 flow [2024-01-29 14:20:29,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 87 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:20:29,957 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 164 flow [2024-01-29 14:20:29,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2024-01-29 14:20:29,958 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -5 predicate places. [2024-01-29 14:20:29,958 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 164 flow [2024-01-29 14:20:29,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:29,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:29,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 14:20:29,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 14:20:29,959 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 51 more)] === [2024-01-29 14:20:29,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:29,960 INFO L85 PathProgramCache]: Analyzing trace with hash 9121356, now seen corresponding path program 1 times [2024-01-29 14:20:29,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:29,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282699401] [2024-01-29 14:20:29,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:29,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:20:30,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:30,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282699401] [2024-01-29 14:20:30,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282699401] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:30,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:30,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:20:30,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247924794] [2024-01-29 14:20:30,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:30,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:30,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:30,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:30,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:30,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 83 [2024-01-29 14:20:30,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:30,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:30,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 83 [2024-01-29 14:20:30,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:30,186 INFO L124 PetriNetUnfolderBase]: 229/534 cut-off events. [2024-01-29 14:20:30,186 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-01-29 14:20:30,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 534 events. 229/534 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2498 event pairs, 143 based on Foata normal form. 10/486 useless extension candidates. Maximal degree in co-relation 829. Up to 300 conditions per place. [2024-01-29 14:20:30,190 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 37 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2024-01-29 14:20:30,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 85 transitions, 263 flow [2024-01-29 14:20:30,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2024-01-29 14:20:30,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7951807228915663 [2024-01-29 14:20:30,191 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 164 flow. Second operand 3 states and 198 transitions. [2024-01-29 14:20:30,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 85 transitions, 263 flow [2024-01-29 14:20:30,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 85 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:20:30,193 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 164 flow [2024-01-29 14:20:30,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2024-01-29 14:20:30,194 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -6 predicate places. [2024-01-29 14:20:30,194 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 164 flow [2024-01-29 14:20:30,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:30,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:30,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 14:20:30,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 14:20:30,195 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 51 more)] === [2024-01-29 14:20:30,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:30,196 INFO L85 PathProgramCache]: Analyzing trace with hash 282762301, now seen corresponding path program 1 times [2024-01-29 14:20:30,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:30,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784124724] [2024-01-29 14:20:30,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:30,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:20:30,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:30,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784124724] [2024-01-29 14:20:30,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784124724] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:30,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:30,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:20:30,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742995691] [2024-01-29 14:20:30,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:30,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:30,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:30,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:30,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:30,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 83 [2024-01-29 14:20:30,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:30,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:30,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 83 [2024-01-29 14:20:30,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:30,360 INFO L124 PetriNetUnfolderBase]: 232/542 cut-off events. [2024-01-29 14:20:30,361 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-01-29 14:20:30,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 542 events. 232/542 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2574 event pairs, 121 based on Foata normal form. 13/501 useless extension candidates. Maximal degree in co-relation 750. Up to 238 conditions per place. [2024-01-29 14:20:30,364 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 36 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2024-01-29 14:20:30,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 83 transitions, 261 flow [2024-01-29 14:20:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2024-01-29 14:20:30,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7951807228915663 [2024-01-29 14:20:30,365 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 164 flow. Second operand 3 states and 198 transitions. [2024-01-29 14:20:30,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 83 transitions, 261 flow [2024-01-29 14:20:30,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 83 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:20:30,368 INFO L231 Difference]: Finished difference. Result has 78 places, 72 transitions, 167 flow [2024-01-29 14:20:30,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=78, PETRI_TRANSITIONS=72} [2024-01-29 14:20:30,369 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -7 predicate places. [2024-01-29 14:20:30,369 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 72 transitions, 167 flow [2024-01-29 14:20:30,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:30,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:30,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 14:20:30,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 14:20:30,370 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 51 more)] === [2024-01-29 14:20:30,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:30,370 INFO L85 PathProgramCache]: Analyzing trace with hash 175697013, now seen corresponding path program 1 times [2024-01-29 14:20:30,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:30,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319014396] [2024-01-29 14:20:30,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:30,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:30,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:20:30,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:30,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319014396] [2024-01-29 14:20:30,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319014396] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:30,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:30,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:20:30,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805329286] [2024-01-29 14:20:30,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:30,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:30,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:30,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:30,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:30,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 83 [2024-01-29 14:20:30,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 72 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:30,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:30,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 83 [2024-01-29 14:20:30,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:30,477 INFO L124 PetriNetUnfolderBase]: 251/584 cut-off events. [2024-01-29 14:20:30,478 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-01-29 14:20:30,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 584 events. 251/584 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3008 event pairs, 213 based on Foata normal form. 1/521 useless extension candidates. Maximal degree in co-relation 664. Up to 434 conditions per place. [2024-01-29 14:20:30,481 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 26 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-01-29 14:20:30,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 71 transitions, 221 flow [2024-01-29 14:20:30,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:30,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2024-01-29 14:20:30,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7550200803212851 [2024-01-29 14:20:30,483 INFO L175 Difference]: Start difference. First operand has 78 places, 72 transitions, 167 flow. Second operand 3 states and 188 transitions. [2024-01-29 14:20:30,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 71 transitions, 221 flow [2024-01-29 14:20:30,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 71 transitions, 215 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:20:30,485 INFO L231 Difference]: Finished difference. Result has 77 places, 71 transitions, 163 flow [2024-01-29 14:20:30,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=77, PETRI_TRANSITIONS=71} [2024-01-29 14:20:30,486 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -8 predicate places. [2024-01-29 14:20:30,486 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 71 transitions, 163 flow [2024-01-29 14:20:30,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:30,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:30,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:20:30,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 14:20:30,487 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 51 more)] === [2024-01-29 14:20:30,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:30,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1151640378, now seen corresponding path program 1 times [2024-01-29 14:20:30,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:30,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189238261] [2024-01-29 14:20:30,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:30,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:20:30,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:30,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189238261] [2024-01-29 14:20:30,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189238261] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:30,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:30,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:20:30,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240040349] [2024-01-29 14:20:30,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:30,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:30,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:30,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:30,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:30,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 83 [2024-01-29 14:20:30,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 71 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:30,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:30,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 83 [2024-01-29 14:20:30,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:30,591 INFO L124 PetriNetUnfolderBase]: 225/527 cut-off events. [2024-01-29 14:20:30,591 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:20:30,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 527 events. 225/527 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2489 event pairs, 127 based on Foata normal form. 16/491 useless extension candidates. Maximal degree in co-relation 992. Up to 268 conditions per place. [2024-01-29 14:20:30,594 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 36 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2024-01-29 14:20:30,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 79 transitions, 260 flow [2024-01-29 14:20:30,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:30,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2024-01-29 14:20:30,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7911646586345381 [2024-01-29 14:20:30,595 INFO L175 Difference]: Start difference. First operand has 77 places, 71 transitions, 163 flow. Second operand 3 states and 197 transitions. [2024-01-29 14:20:30,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 79 transitions, 260 flow [2024-01-29 14:20:30,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 79 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:20:30,597 INFO L231 Difference]: Finished difference. Result has 74 places, 68 transitions, 157 flow [2024-01-29 14:20:30,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=74, PETRI_TRANSITIONS=68} [2024-01-29 14:20:30,598 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -11 predicate places. [2024-01-29 14:20:30,598 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 157 flow [2024-01-29 14:20:30,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:30,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:30,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:20:30,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 14:20:30,599 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 51 more)] === [2024-01-29 14:20:30,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:30,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1341113653, now seen corresponding path program 1 times [2024-01-29 14:20:30,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:30,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811271897] [2024-01-29 14:20:30,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:30,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:30,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:20:30,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:30,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811271897] [2024-01-29 14:20:30,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811271897] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:30,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:30,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:20:30,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289276336] [2024-01-29 14:20:30,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:30,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:20:30,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:30,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:20:30,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:20:30,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 83 [2024-01-29 14:20:30,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 68 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:30,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:30,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 83 [2024-01-29 14:20:30,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:30,713 INFO L124 PetriNetUnfolderBase]: 225/524 cut-off events. [2024-01-29 14:20:30,713 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:20:30,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 524 events. 225/524 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2463 event pairs, 103 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 709. Up to 206 conditions per place. [2024-01-29 14:20:30,716 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 35 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2024-01-29 14:20:30,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 76 transitions, 254 flow [2024-01-29 14:20:30,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:20:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:20:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2024-01-29 14:20:30,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7911646586345381 [2024-01-29 14:20:30,717 INFO L175 Difference]: Start difference. First operand has 74 places, 68 transitions, 157 flow. Second operand 3 states and 197 transitions. [2024-01-29 14:20:30,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 76 transitions, 254 flow [2024-01-29 14:20:30,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 76 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:20:30,719 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 153 flow [2024-01-29 14:20:30,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2024-01-29 14:20:30,720 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -14 predicate places. [2024-01-29 14:20:30,720 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 153 flow [2024-01-29 14:20:30,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:30,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:30,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:20:30,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 14:20:30,721 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 51 more)] === [2024-01-29 14:20:30,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:30,721 INFO L85 PathProgramCache]: Analyzing trace with hash 967687493, now seen corresponding path program 1 times [2024-01-29 14:20:30,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:30,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763561712] [2024-01-29 14:20:30,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:30,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:20:30,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:30,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763561712] [2024-01-29 14:20:30,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763561712] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:30,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:30,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:20:30,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118287949] [2024-01-29 14:20:30,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:30,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:20:30,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:30,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:20:30,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:20:30,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 83 [2024-01-29 14:20:30,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:30,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:30,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 83 [2024-01-29 14:20:30,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:30,878 INFO L124 PetriNetUnfolderBase]: 251/529 cut-off events. [2024-01-29 14:20:30,878 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:20:30,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 529 events. 251/529 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2152 event pairs, 119 based on Foata normal form. 50/521 useless extension candidates. Maximal degree in co-relation 653. Up to 404 conditions per place. [2024-01-29 14:20:30,880 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 37 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2024-01-29 14:20:30,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 70 transitions, 246 flow [2024-01-29 14:20:30,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:20:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:20:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2024-01-29 14:20:30,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.713855421686747 [2024-01-29 14:20:30,882 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 153 flow. Second operand 4 states and 237 transitions. [2024-01-29 14:20:30,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 70 transitions, 246 flow [2024-01-29 14:20:30,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 70 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:20:30,884 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 139 flow [2024-01-29 14:20:30,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2024-01-29 14:20:30,884 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -19 predicate places. [2024-01-29 14:20:30,884 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 139 flow [2024-01-29 14:20:30,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:30,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:30,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:20:30,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 14:20:30,885 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 51 more)] === [2024-01-29 14:20:30,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:30,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2061150763, now seen corresponding path program 1 times [2024-01-29 14:20:30,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:30,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085767505] [2024-01-29 14:20:30,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:30,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:20:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:20:30,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:20:30,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085767505] [2024-01-29 14:20:30,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085767505] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:20:30,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:20:30,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:20:30,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630347444] [2024-01-29 14:20:30,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:20:30,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:20:30,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:20:30,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:20:30,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:20:30,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 83 [2024-01-29 14:20:30,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:30,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:30,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 83 [2024-01-29 14:20:30,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:31,028 INFO L124 PetriNetUnfolderBase]: 251/462 cut-off events. [2024-01-29 14:20:31,029 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-01-29 14:20:31,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 462 events. 251/462 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1819 event pairs, 13 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 962. Up to 372 conditions per place. [2024-01-29 14:20:31,031 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 45 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2024-01-29 14:20:31,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 260 flow [2024-01-29 14:20:31,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:20:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:20:31,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 245 transitions. [2024-01-29 14:20:31,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7379518072289156 [2024-01-29 14:20:31,032 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 139 flow. Second operand 4 states and 245 transitions. [2024-01-29 14:20:31,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 260 flow [2024-01-29 14:20:31,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 72 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:20:31,033 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 128 flow [2024-01-29 14:20:31,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2024-01-29 14:20:31,034 INFO L281 CegarLoopForPetriNet]: 85 programPoint places, -24 predicate places. [2024-01-29 14:20:31,034 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 128 flow [2024-01-29 14:20:31,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:31,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:20:31,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:20:31,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 14:20:31,035 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 51 more)] === [2024-01-29 14:20:31,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:20:31,035 INFO L85 PathProgramCache]: Analyzing trace with hash 557946925, now seen corresponding path program 1 times [2024-01-29 14:20:31,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:20:31,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458417606] [2024-01-29 14:20:31,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:20:31,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:20:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:20:31,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 14:20:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:20:31,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 14:20:31,060 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 14:20:31,061 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 54 remaining) [2024-01-29 14:20:31,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 54 remaining) [2024-01-29 14:20:31,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 54 remaining) [2024-01-29 14:20:31,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 54 remaining) [2024-01-29 14:20:31,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 54 remaining) [2024-01-29 14:20:31,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 54 remaining) [2024-01-29 14:20:31,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 54 remaining) [2024-01-29 14:20:31,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 54 remaining) [2024-01-29 14:20:31,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 54 remaining) [2024-01-29 14:20:31,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 54 remaining) [2024-01-29 14:20:31,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 54 remaining) [2024-01-29 14:20:31,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 54 remaining) [2024-01-29 14:20:31,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 54 remaining) [2024-01-29 14:20:31,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 54 remaining) [2024-01-29 14:20:31,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 54 remaining) [2024-01-29 14:20:31,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 54 remaining) [2024-01-29 14:20:31,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 54 remaining) [2024-01-29 14:20:31,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 54 remaining) [2024-01-29 14:20:31,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 54 remaining) [2024-01-29 14:20:31,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 54 remaining) [2024-01-29 14:20:31,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 54 remaining) [2024-01-29 14:20:31,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 54 remaining) [2024-01-29 14:20:31,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 54 remaining) [2024-01-29 14:20:31,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 54 remaining) [2024-01-29 14:20:31,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 54 remaining) [2024-01-29 14:20:31,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 54 remaining) [2024-01-29 14:20:31,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 54 remaining) [2024-01-29 14:20:31,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 54 remaining) [2024-01-29 14:20:31,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 54 remaining) [2024-01-29 14:20:31,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 54 remaining) [2024-01-29 14:20:31,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 54 remaining) [2024-01-29 14:20:31,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 54 remaining) [2024-01-29 14:20:31,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 54 remaining) [2024-01-29 14:20:31,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (20 of 54 remaining) [2024-01-29 14:20:31,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 54 remaining) [2024-01-29 14:20:31,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 54 remaining) [2024-01-29 14:20:31,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 54 remaining) [2024-01-29 14:20:31,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 54 remaining) [2024-01-29 14:20:31,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 54 remaining) [2024-01-29 14:20:31,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 54 remaining) [2024-01-29 14:20:31,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 54 remaining) [2024-01-29 14:20:31,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 54 remaining) [2024-01-29 14:20:31,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 54 remaining) [2024-01-29 14:20:31,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 54 remaining) [2024-01-29 14:20:31,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 54 remaining) [2024-01-29 14:20:31,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 54 remaining) [2024-01-29 14:20:31,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 54 remaining) [2024-01-29 14:20:31,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 54 remaining) [2024-01-29 14:20:31,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 54 remaining) [2024-01-29 14:20:31,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 54 remaining) [2024-01-29 14:20:31,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 54 remaining) [2024-01-29 14:20:31,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 54 remaining) [2024-01-29 14:20:31,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 54 remaining) [2024-01-29 14:20:31,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 54 remaining) [2024-01-29 14:20:31,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 14:20:31,071 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:20:31,075 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 14:20:31,075 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 14:20:31,092 INFO L503 ceAbstractionStarter]: Automizer considered 32 witness invariants [2024-01-29 14:20:31,093 INFO L504 ceAbstractionStarter]: WitnessConsidered=32 [2024-01-29 14:20:31,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 02:20:31 BasicIcfg [2024-01-29 14:20:31,093 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 14:20:31,094 INFO L158 Benchmark]: Toolchain (without parser) took 2993.37ms. Allocated memory was 192.9MB in the beginning and 302.0MB in the end (delta: 109.1MB). Free memory was 118.6MB in the beginning and 143.9MB in the end (delta: -25.3MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. [2024-01-29 14:20:31,094 INFO L158 Benchmark]: Witness Parser took 0.23ms. Allocated memory is still 192.9MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:20:31,094 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 192.9MB. Free memory is still 165.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:20:31,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.17ms. Allocated memory is still 192.9MB. Free memory was 118.3MB in the beginning and 154.4MB in the end (delta: -36.1MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-01-29 14:20:31,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.13ms. Allocated memory is still 192.9MB. Free memory was 154.4MB in the beginning and 153.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:20:31,095 INFO L158 Benchmark]: Boogie Preprocessor took 45.55ms. Allocated memory is still 192.9MB. Free memory was 153.1MB in the beginning and 151.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 14:20:31,095 INFO L158 Benchmark]: RCFGBuilder took 514.62ms. Allocated memory is still 192.9MB. Free memory was 151.0MB in the beginning and 125.1MB in the end (delta: 25.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-01-29 14:20:31,095 INFO L158 Benchmark]: TraceAbstraction took 2074.79ms. Allocated memory was 192.9MB in the beginning and 302.0MB in the end (delta: 109.1MB). Free memory was 124.4MB in the beginning and 143.9MB in the end (delta: -19.4MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. [2024-01-29 14:20:31,096 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.23ms. Allocated memory is still 192.9MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.36ms. Allocated memory is still 192.9MB. Free memory is still 165.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.17ms. Allocated memory is still 192.9MB. Free memory was 118.3MB in the beginning and 154.4MB in the end (delta: -36.1MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.13ms. Allocated memory is still 192.9MB. Free memory was 154.4MB in the beginning and 153.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.55ms. Allocated memory is still 192.9MB. Free memory was 153.1MB in the beginning and 151.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 514.62ms. Allocated memory is still 192.9MB. Free memory was 151.0MB in the beginning and 125.1MB in the end (delta: 25.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2074.79ms. Allocated memory was 192.9MB in the beginning and 302.0MB in the end (delta: 109.1MB). Free memory was 124.4MB in the beginning and 143.9MB in the end (delta: -19.4MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 43]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] 0 unsigned int y, x1, z1, l1, x2, z2, l2; [L66] 0 pthread_t t1, t2; VAL [l1=0, l2=0, t1={3:0}, t2={5:0}, x1=0, x2=0, y=0, z1=0, z2=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[z2],IntegerLiteral[0U]]]] VAL [l1=0, l2=0, t1={3:0}, t2={5:0}, x1=0, x2=0, y=0, z1=0, z2=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[z1],IntegerLiteral[0U]]]] VAL [l1=0, l2=0, t1={3:0}, t2={5:0}, x1=0, x2=0, y=0, z1=0, z2=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[l2],IntegerLiteral[0U]]]] VAL [l1=0, l2=0, t1={3:0}, t2={5:0}, x1=0, x2=0, y=0, z1=0, z2=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x2],IntegerLiteral[0U]]]] VAL [l1=0, l2=0, t1={3:0}, t2={5:0}, x1=0, x2=0, y=0, z1=0, z2=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0U]]]] VAL [l1=0, l2=0, t1={3:0}, t2={5:0}, x1=0, x2=0, y=0, z1=0, z2=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[l1],IntegerLiteral[0U]]]] VAL [l1=0, l2=0, t1={3:0}, t2={5:0}, x1=0, x2=0, y=0, z1=0, z2=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x1],IntegerLiteral[0U]]]] [L68] 0 y = __VERIFIER_nondet_uint() [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[l2],IntegerLiteral[0U]]]] VAL [l1=0, l2=0, t1={3:0}, t2={5:0}, x1=0, x2=0, z1=0, z2=0] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[z2],IntegerLiteral[0U]]]] VAL [l1=0, l2=0, t1={3:0}, t2={5:0}, x1=0, x2=0, z1=0, z2=0] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x1],IntegerLiteral[0U]]]] VAL [l1=0, l2=0, t1={3:0}, t2={5:0}, x1=0, x2=0, z1=0, z2=0] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x2],IntegerLiteral[0U]]]] VAL [l1=0, l2=0, t1={3:0}, t2={5:0}, x1=0, x2=0, z1=0, z2=0] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[z1],IntegerLiteral[0U]]]] VAL [l1=0, l2=0, t1={3:0}, t2={5:0}, x1=0, x2=0, z1=0, z2=0] [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[l1],IntegerLiteral[0U]]]] [L70] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [_argptr={0:0}, l1=0, l2=0, t1={3:0}, t2={5:0}, x1=0, x2=0, z1=0, z2=0] [L42] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] [L42] 1 z1 = 1 VAL [_argptr={0:0}, _argptr={0:0}, l1=0, l2=0, x1=0, x2=0, z1=1, z2=0] [L43] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[z2],IntegerLiteral[0U]]]] VAL [_argptr={0:0}, _argptr={0:0}, l1=0, l2=0, x1=0, x2=0, z1=1, z2=0] [L43] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x2],IntegerLiteral[0U]]]] VAL [_argptr={0:0}, _argptr={0:0}, l1=0, l2=0, x1=0, x2=0, z1=1, z2=0] [L43] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[z1],IntegerLiteral[0U]]]] VAL [_argptr={0:0}, _argptr={0:0}, l1=0, l2=0, x1=0, x2=0, z1=1, z2=0] - UnprovableResult [Line: 42]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: 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: 68]: 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: 68]: 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: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 128 locations, 54 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 316 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 249 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 533 IncrementalHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 31 mSDtfsCounter, 533 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=0, InterpolantAutomatonStates: 29, 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, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 14:20:31,127 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