./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-simpl-str-trans.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/chl-simpl-str-trans.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-simpl-str-trans.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:18:09,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 14:18:09,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 14:18:09,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 14:18:09,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 14:18:09,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 14:18:09,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 14:18:09,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 14:18:09,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 14:18:09,712 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 14:18:09,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 14:18:09,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 14:18:09,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 14:18:09,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 14:18:09,715 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 14:18:09,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 14:18:09,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 14:18:09,715 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 14:18:09,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 14:18:09,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 14:18:09,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 14:18:09,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 14:18:09,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 14:18:09,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 14:18:09,717 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 14:18:09,717 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 14:18:09,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 14:18:09,717 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 14:18:09,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 14:18:09,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 14:18:09,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 14:18:09,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 14:18:09,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:18:09,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 14:18:09,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 14:18:09,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 14:18:09,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 14:18:09,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 14:18:09,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 14:18:09,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 14:18:09,721 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 14:18:09,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 14:18:09,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 14:18:09,721 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:18:09,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 14:18:09,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 14:18:09,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 14:18:09,945 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 14:18:09,945 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 14:18:09,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-simpl-str-trans.wvr.yml/witness.yml [2024-01-29 14:18:10,046 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 14:18:10,053 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 14:18:10,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2024-01-29 14:18:11,039 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 14:18:11,225 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 14:18:11,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2024-01-29 14:18:11,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a81293293/71c362b806744d3cba8bee62986a71e9/FLAGeb65beb8f [2024-01-29 14:18:11,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a81293293/71c362b806744d3cba8bee62986a71e9 [2024-01-29 14:18:11,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 14:18:11,243 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 14:18:11,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 14:18:11,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 14:18:11,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 14:18:11,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:18:10" (1/2) ... [2024-01-29 14:18:11,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ae4147 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:11, skipping insertion in model container [2024-01-29 14:18:11,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:18:10" (1/2) ... [2024-01-29 14:18:11,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3354b6b6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:11, skipping insertion in model container [2024-01-29 14:18:11,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:18:11" (2/2) ... [2024-01-29 14:18:11,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ae4147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:11, skipping insertion in model container [2024-01-29 14:18:11,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:18:11" (2/2) ... [2024-01-29 14:18:11,250 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 14:18:11,262 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 14:18:11,263 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] to_int_1 == 0 [2024-01-29 14:18:11,264 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] length_2 == 0 [2024-01-29 14:18:11,264 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_6 == 0 [2024-01-29 14:18:11,264 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_7 == 0 [2024-01-29 14:18:11,264 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] to_int_3 == 0 [2024-01-29 14:18:11,264 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] to_int_5 == 0 [2024-01-29 14:18:11,264 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_8 == 0 [2024-01-29 14:18:11,264 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] length_0 == 0 [2024-01-29 14:18:11,265 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] length_4 == 0 [2024-01-29 14:18:11,265 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] to_int_5 == 0 [2024-01-29 14:18:11,265 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_6 == 0 [2024-01-29 14:18:11,265 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_7 == 0 [2024-01-29 14:18:11,265 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_8 == 0 [2024-01-29 14:18:11,265 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_6 == 0 [2024-01-29 14:18:11,265 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] to_int_5 == 0 [2024-01-29 14:18:11,265 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_7 == 0 [2024-01-29 14:18:11,266 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] length_4 == 0 [2024-01-29 14:18:11,266 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_8 == 0 [2024-01-29 14:18:11,266 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_7 == 0 [2024-01-29 14:18:11,266 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] length_4 == 0 [2024-01-29 14:18:11,266 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_6 == 0 [2024-01-29 14:18:11,267 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_8 == 0 [2024-01-29 14:18:11,267 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] to_int_5 == 0 [2024-01-29 14:18:11,267 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] to_int_3 == 0 [2024-01-29 14:18:11,267 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] length_2 == 0 [2024-01-29 14:18:11,267 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] to_int_5 == 0 [2024-01-29 14:18:11,267 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] to_int_3 == 0 [2024-01-29 14:18:11,267 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_8 == 0 [2024-01-29 14:18:11,267 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_7 == 0 [2024-01-29 14:18:11,268 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_6 == 0 [2024-01-29 14:18:11,268 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] length_4 == 0 [2024-01-29 14:18:11,268 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_7 == 0 [2024-01-29 14:18:11,268 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_8 == 0 [2024-01-29 14:18:11,268 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] to_int_5 == 0 [2024-01-29 14:18:11,268 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_6 == 0 [2024-01-29 14:18:11,269 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] (unsigned long )_argptr == 0UL [2024-01-29 14:18:11,269 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-29 14:18:11,269 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] b != 0 [2024-01-29 14:18:11,270 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] b <= -1 [2024-01-29 14:18:11,270 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] 1 <= b [2024-01-29 14:18:11,271 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] b != 0 [2024-01-29 14:18:11,271 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_7 == 0 [2024-01-29 14:18:11,271 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] length_2 == 0 [2024-01-29 14:18:11,271 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] to_int_3 == 0 [2024-01-29 14:18:11,271 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] to_int_1 == 0 [2024-01-29 14:18:11,271 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] to_int_5 == 0 [2024-01-29 14:18:11,271 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_6 == 0 [2024-01-29 14:18:11,272 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] length_4 == 0 [2024-01-29 14:18:11,272 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_8 == 0 [2024-01-29 14:18:11,272 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_8 == 0 [2024-01-29 14:18:11,272 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_6 == 0 [2024-01-29 14:18:11,272 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_7 == 0 [2024-01-29 14:18:11,272 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-29 14:18:11,290 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 14:18:11,440 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c[2553,2566] [2024-01-29 14:18:11,453 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:18:11,460 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 14:18:11,471 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local 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:18:11,512 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c[2553,2566] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 14:18:11,517 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:18:11,527 INFO L206 MainTranslator]: Completed translation [2024-01-29 14:18:11,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:11 WrapperNode [2024-01-29 14:18:11,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 14:18:11,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 14:18:11,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 14:18:11,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 14:18:11,533 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:18:11" (1/1) ... [2024-01-29 14:18:11,539 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:18:11" (1/1) ... [2024-01-29 14:18:11,557 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 228 [2024-01-29 14:18:11,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 14:18:11,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 14:18:11,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 14:18:11,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 14:18:11,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:11" (1/1) ... [2024-01-29 14:18:11,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:11" (1/1) ... [2024-01-29 14:18:11,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:11" (1/1) ... [2024-01-29 14:18:11,579 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-29 14:18:11,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:11" (1/1) ... [2024-01-29 14:18:11,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:11" (1/1) ... [2024-01-29 14:18:11,584 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:11" (1/1) ... [2024-01-29 14:18:11,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:11" (1/1) ... [2024-01-29 14:18:11,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:11" (1/1) ... [2024-01-29 14:18:11,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:11" (1/1) ... [2024-01-29 14:18:11,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 14:18:11,594 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 14:18:11,594 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 14:18:11,594 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 14:18:11,595 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:11" (1/1) ... [2024-01-29 14:18:11,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:18:11,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:18:11,616 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:18:11,617 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:18:11,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 14:18:11,645 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 14:18:11,646 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 14:18:11,646 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 14:18:11,646 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 14:18:11,646 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-29 14:18:11,646 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-29 14:18:11,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 14:18:11,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 14:18:11,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 14:18:11,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 14:18:11,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 14:18:11,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 14:18:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 14:18:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 14:18:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 14:18:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 14:18:11,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 14:18:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 14:18:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 14:18:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 14:18:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 14:18:11,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 14:18:11,649 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:18:11,737 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 14:18:11,739 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 14:18:12,089 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 14:18:12,090 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 14:18:12,249 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 14:18:12,250 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 14:18:12,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:18:12 BoogieIcfgContainer [2024-01-29 14:18:12,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 14:18:12,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 14:18:12,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 14:18:12,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 14:18:12,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:18:10" (1/4) ... [2024-01-29 14:18:12,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a9086d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:18:12, skipping insertion in model container [2024-01-29 14:18:12,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 02:18:11" (2/4) ... [2024-01-29 14:18:12,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a9086d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:18:12, skipping insertion in model container [2024-01-29 14:18:12,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:11" (3/4) ... [2024-01-29 14:18:12,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a9086d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:18:12, skipping insertion in model container [2024-01-29 14:18:12,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:18:12" (4/4) ... [2024-01-29 14:18:12,261 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2024-01-29 14:18:12,274 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 14:18:12,274 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-01-29 14:18:12,274 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 14:18:12,335 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-29 14:18:12,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 153 transitions, 327 flow [2024-01-29 14:18:12,426 INFO L124 PetriNetUnfolderBase]: 6/150 cut-off events. [2024-01-29 14:18:12,426 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 14:18:12,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 6/150 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 252 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2024-01-29 14:18:12,430 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 153 transitions, 327 flow [2024-01-29 14:18:12,433 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 149 transitions, 316 flow [2024-01-29 14:18:12,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 14:18:12,456 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;@1866d872, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 14:18:12,456 INFO L358 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2024-01-29 14:18:12,457 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 14:18:12,458 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 14:18:12,458 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:18:12,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:12,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 14:18:12,459 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 14:18:12,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:12,465 INFO L85 PathProgramCache]: Analyzing trace with hash 20124, now seen corresponding path program 1 times [2024-01-29 14:18:12,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:12,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739513447] [2024-01-29 14:18:12,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:12,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:12,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:18:12,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:12,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739513447] [2024-01-29 14:18:12,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739513447] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:12,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:12,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:12,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104207567] [2024-01-29 14:18:12,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:12,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:12,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:12,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:12,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:12,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 153 [2024-01-29 14:18:12,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 149 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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:18:12,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:12,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 153 [2024-01-29 14:18:12,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:13,387 INFO L124 PetriNetUnfolderBase]: 3353/5664 cut-off events. [2024-01-29 14:18:13,387 INFO L125 PetriNetUnfolderBase]: For 245/245 co-relation queries the response was YES. [2024-01-29 14:18:13,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10651 conditions, 5664 events. 3353/5664 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 40542 event pairs, 1782 based on Foata normal form. 0/4965 useless extension candidates. Maximal degree in co-relation 9373. Up to 2812 conditions per place. [2024-01-29 14:18:13,420 INFO L140 encePairwiseOnDemand]: 142/153 looper letters, 70 selfloop transitions, 4 changer transitions 0/172 dead transitions. [2024-01-29 14:18:13,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 172 transitions, 522 flow [2024-01-29 14:18:13,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:13,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2024-01-29 14:18:13,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8366013071895425 [2024-01-29 14:18:13,443 INFO L175 Difference]: Start difference. First operand has 153 places, 149 transitions, 316 flow. Second operand 3 states and 384 transitions. [2024-01-29 14:18:13,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 172 transitions, 522 flow [2024-01-29 14:18:13,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 172 transitions, 502 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-29 14:18:13,461 INFO L231 Difference]: Finished difference. Result has 146 places, 146 transitions, 322 flow [2024-01-29 14:18:13,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=146, PETRI_TRANSITIONS=146} [2024-01-29 14:18:13,466 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -7 predicate places. [2024-01-29 14:18:13,466 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 146 transitions, 322 flow [2024-01-29 14:18:13,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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:18:13,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:13,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 14:18:13,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 14:18:13,468 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 14:18:13,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:13,468 INFO L85 PathProgramCache]: Analyzing trace with hash 624463, now seen corresponding path program 1 times [2024-01-29 14:18:13,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:13,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692192959] [2024-01-29 14:18:13,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:13,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:13,520 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:18:13,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:13,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692192959] [2024-01-29 14:18:13,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692192959] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:13,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:13,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:13,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328408950] [2024-01-29 14:18:13,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:13,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:13,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:13,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:13,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:13,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 153 [2024-01-29 14:18:13,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 146 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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:18:13,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:13,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 153 [2024-01-29 14:18:13,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:14,380 INFO L124 PetriNetUnfolderBase]: 5957/10241 cut-off events. [2024-01-29 14:18:14,380 INFO L125 PetriNetUnfolderBase]: For 1685/1685 co-relation queries the response was YES. [2024-01-29 14:18:14,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20302 conditions, 10241 events. 5957/10241 cut-off events. For 1685/1685 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 79264 event pairs, 3091 based on Foata normal form. 0/9332 useless extension candidates. Maximal degree in co-relation 11930. Up to 4835 conditions per place. [2024-01-29 14:18:14,438 INFO L140 encePairwiseOnDemand]: 146/153 looper letters, 76 selfloop transitions, 4 changer transitions 0/179 dead transitions. [2024-01-29 14:18:14,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 179 transitions, 569 flow [2024-01-29 14:18:14,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:14,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:14,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2024-01-29 14:18:14,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8714596949891068 [2024-01-29 14:18:14,440 INFO L175 Difference]: Start difference. First operand has 146 places, 146 transitions, 322 flow. Second operand 3 states and 400 transitions. [2024-01-29 14:18:14,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 179 transitions, 569 flow [2024-01-29 14:18:14,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 179 transitions, 557 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:14,454 INFO L231 Difference]: Finished difference. Result has 147 places, 147 transitions, 340 flow [2024-01-29 14:18:14,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=147, PETRI_TRANSITIONS=147} [2024-01-29 14:18:14,455 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -6 predicate places. [2024-01-29 14:18:14,455 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 147 transitions, 340 flow [2024-01-29 14:18:14,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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:18:14,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:14,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 14:18:14,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 14:18:14,456 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 14:18:14,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:14,456 INFO L85 PathProgramCache]: Analyzing trace with hash 19359081, now seen corresponding path program 1 times [2024-01-29 14:18:14,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:14,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091553367] [2024-01-29 14:18:14,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:14,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:14,509 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:18:14,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:14,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091553367] [2024-01-29 14:18:14,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091553367] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:14,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:14,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:14,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293584832] [2024-01-29 14:18:14,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:14,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:14,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:14,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:14,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:14,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 153 [2024-01-29 14:18:14,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 147 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:18:14,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:14,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 153 [2024-01-29 14:18:14,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:15,324 INFO L124 PetriNetUnfolderBase]: 5447/9176 cut-off events. [2024-01-29 14:18:15,324 INFO L125 PetriNetUnfolderBase]: For 2060/2251 co-relation queries the response was YES. [2024-01-29 14:18:15,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18971 conditions, 9176 events. 5447/9176 cut-off events. For 2060/2251 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 69819 event pairs, 2857 based on Foata normal form. 0/7964 useless extension candidates. Maximal degree in co-relation 9692. Up to 4922 conditions per place. [2024-01-29 14:18:15,427 INFO L140 encePairwiseOnDemand]: 144/153 looper letters, 70 selfloop transitions, 2 changer transitions 0/161 dead transitions. [2024-01-29 14:18:15,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 161 transitions, 526 flow [2024-01-29 14:18:15,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2024-01-29 14:18:15,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7995642701525054 [2024-01-29 14:18:15,430 INFO L175 Difference]: Start difference. First operand has 147 places, 147 transitions, 340 flow. Second operand 3 states and 367 transitions. [2024-01-29 14:18:15,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 161 transitions, 526 flow [2024-01-29 14:18:15,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 161 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:15,437 INFO L231 Difference]: Finished difference. Result has 140 places, 140 transitions, 322 flow [2024-01-29 14:18:15,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=140, PETRI_TRANSITIONS=140} [2024-01-29 14:18:15,439 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -13 predicate places. [2024-01-29 14:18:15,439 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 140 transitions, 322 flow [2024-01-29 14:18:15,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:18:15,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:15,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 14:18:15,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 14:18:15,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 14:18:15,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:15,440 INFO L85 PathProgramCache]: Analyzing trace with hash 600132250, now seen corresponding path program 1 times [2024-01-29 14:18:15,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:15,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46563759] [2024-01-29 14:18:15,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:15,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:15,486 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:18:15,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:15,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46563759] [2024-01-29 14:18:15,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46563759] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:15,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:15,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:15,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505304556] [2024-01-29 14:18:15,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:15,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:15,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:15,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:15,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:15,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 153 [2024-01-29 14:18:15,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 140 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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:18:15,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:15,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 153 [2024-01-29 14:18:15,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:16,113 INFO L124 PetriNetUnfolderBase]: 5447/9000 cut-off events. [2024-01-29 14:18:16,113 INFO L125 PetriNetUnfolderBase]: For 1513/1704 co-relation queries the response was YES. [2024-01-29 14:18:16,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18860 conditions, 9000 events. 5447/9000 cut-off events. For 1513/1704 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 67423 event pairs, 4501 based on Foata normal form. 0/7794 useless extension candidates. Maximal degree in co-relation 12196. Up to 7771 conditions per place. [2024-01-29 14:18:16,156 INFO L140 encePairwiseOnDemand]: 145/153 looper letters, 49 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2024-01-29 14:18:16,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 134 transitions, 412 flow [2024-01-29 14:18:16,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:16,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:16,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2024-01-29 14:18:16,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7625272331154684 [2024-01-29 14:18:16,157 INFO L175 Difference]: Start difference. First operand has 140 places, 140 transitions, 322 flow. Second operand 3 states and 350 transitions. [2024-01-29 14:18:16,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 134 transitions, 412 flow [2024-01-29 14:18:16,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 134 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:16,170 INFO L231 Difference]: Finished difference. Result has 134 places, 134 transitions, 310 flow [2024-01-29 14:18:16,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=134, PETRI_TRANSITIONS=134} [2024-01-29 14:18:16,172 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -19 predicate places. [2024-01-29 14:18:16,172 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 134 transitions, 310 flow [2024-01-29 14:18:16,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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:18:16,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:16,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 14:18:16,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 14:18:16,173 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 14:18:16,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:16,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1424231171, now seen corresponding path program 1 times [2024-01-29 14:18:16,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:16,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945838121] [2024-01-29 14:18:16,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:16,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:16,318 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:18:16,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:16,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945838121] [2024-01-29 14:18:16,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945838121] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:16,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:16,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:16,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344502278] [2024-01-29 14:18:16,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:16,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:16,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:16,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:16,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:16,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 153 [2024-01-29 14:18:16,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 134 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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:18:16,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:16,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 153 [2024-01-29 14:18:16,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:17,042 INFO L124 PetriNetUnfolderBase]: 5447/8996 cut-off events. [2024-01-29 14:18:17,042 INFO L125 PetriNetUnfolderBase]: For 1148/1339 co-relation queries the response was YES. [2024-01-29 14:18:17,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18439 conditions, 8996 events. 5447/8996 cut-off events. For 1148/1339 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 67397 event pairs, 4501 based on Foata normal form. 0/7794 useless extension candidates. Maximal degree in co-relation 18360. Up to 7773 conditions per place. [2024-01-29 14:18:17,079 INFO L140 encePairwiseOnDemand]: 147/153 looper letters, 47 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2024-01-29 14:18:17,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 130 transitions, 400 flow [2024-01-29 14:18:17,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:17,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2024-01-29 14:18:17,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7799564270152506 [2024-01-29 14:18:17,081 INFO L175 Difference]: Start difference. First operand has 134 places, 134 transitions, 310 flow. Second operand 3 states and 358 transitions. [2024-01-29 14:18:17,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 130 transitions, 400 flow [2024-01-29 14:18:17,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 130 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:17,083 INFO L231 Difference]: Finished difference. Result has 130 places, 130 transitions, 302 flow [2024-01-29 14:18:17,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=130, PETRI_TRANSITIONS=130} [2024-01-29 14:18:17,084 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -23 predicate places. [2024-01-29 14:18:17,084 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 130 transitions, 302 flow [2024-01-29 14:18:17,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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:18:17,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:17,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:17,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 14:18:17,085 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 14:18:17,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:17,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1201494048, now seen corresponding path program 1 times [2024-01-29 14:18:17,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:17,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932600688] [2024-01-29 14:18:17,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:17,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:17,100 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:18:17,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:17,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932600688] [2024-01-29 14:18:17,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932600688] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:17,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:17,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:17,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020156496] [2024-01-29 14:18:17,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:17,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:17,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:17,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:17,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:17,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 153 [2024-01-29 14:18:17,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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:18:17,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:17,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 153 [2024-01-29 14:18:17,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:17,672 INFO L124 PetriNetUnfolderBase]: 5454/9143 cut-off events. [2024-01-29 14:18:17,673 INFO L125 PetriNetUnfolderBase]: For 1172/1378 co-relation queries the response was YES. [2024-01-29 14:18:17,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18621 conditions, 9143 events. 5454/9143 cut-off events. For 1172/1378 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 70449 event pairs, 2812 based on Foata normal form. 1/8025 useless extension candidates. Maximal degree in co-relation 18564. Up to 4805 conditions per place. [2024-01-29 14:18:17,720 INFO L140 encePairwiseOnDemand]: 144/153 looper letters, 69 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2024-01-29 14:18:17,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 145 transitions, 490 flow [2024-01-29 14:18:17,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:17,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:17,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2024-01-29 14:18:17,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8082788671023965 [2024-01-29 14:18:17,722 INFO L175 Difference]: Start difference. First operand has 130 places, 130 transitions, 302 flow. Second operand 3 states and 371 transitions. [2024-01-29 14:18:17,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 145 transitions, 490 flow [2024-01-29 14:18:17,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 145 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:17,725 INFO L231 Difference]: Finished difference. Result has 123 places, 123 transitions, 288 flow [2024-01-29 14:18:17,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=123, PETRI_TRANSITIONS=123} [2024-01-29 14:18:17,725 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -30 predicate places. [2024-01-29 14:18:17,726 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 123 transitions, 288 flow [2024-01-29 14:18:17,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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:18:17,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:17,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:17,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 14:18:17,726 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 14:18:17,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:17,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1408389541, now seen corresponding path program 1 times [2024-01-29 14:18:17,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:17,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248729931] [2024-01-29 14:18:17,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:17,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:17,741 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:18:17,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:17,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248729931] [2024-01-29 14:18:17,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248729931] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:17,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:17,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:17,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639672412] [2024-01-29 14:18:17,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:17,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:17,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:17,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:17,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:17,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 153 [2024-01-29 14:18:17,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 123 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:18:17,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:17,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 153 [2024-01-29 14:18:17,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:18,256 INFO L124 PetriNetUnfolderBase]: 5405/8899 cut-off events. [2024-01-29 14:18:18,257 INFO L125 PetriNetUnfolderBase]: For 1540/1758 co-relation queries the response was YES. [2024-01-29 14:18:18,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18808 conditions, 8899 events. 5405/8899 cut-off events. For 1540/1758 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 67003 event pairs, 2351 based on Foata normal form. 1/7886 useless extension candidates. Maximal degree in co-relation 11619. Up to 4032 conditions per place. [2024-01-29 14:18:18,304 INFO L140 encePairwiseOnDemand]: 144/153 looper letters, 71 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2024-01-29 14:18:18,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 138 transitions, 484 flow [2024-01-29 14:18:18,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2024-01-29 14:18:18,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7995642701525054 [2024-01-29 14:18:18,306 INFO L175 Difference]: Start difference. First operand has 123 places, 123 transitions, 288 flow. Second operand 3 states and 367 transitions. [2024-01-29 14:18:18,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 138 transitions, 484 flow [2024-01-29 14:18:18,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 138 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:18,312 INFO L231 Difference]: Finished difference. Result has 116 places, 116 transitions, 274 flow [2024-01-29 14:18:18,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=116, PETRI_TRANSITIONS=116} [2024-01-29 14:18:18,312 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -37 predicate places. [2024-01-29 14:18:18,313 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 116 transitions, 274 flow [2024-01-29 14:18:18,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:18:18,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:18,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:18,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 14:18:18,313 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 14:18:18,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:18,314 INFO L85 PathProgramCache]: Analyzing trace with hash -710402159, now seen corresponding path program 1 times [2024-01-29 14:18:18,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:18,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588458277] [2024-01-29 14:18:18,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:18,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:18,329 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:18:18,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:18,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588458277] [2024-01-29 14:18:18,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588458277] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:18,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:18,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:18,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383549517] [2024-01-29 14:18:18,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:18,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:18,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:18,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:18,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:18,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 153 [2024-01-29 14:18:18,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 116 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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:18:18,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:18,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 153 [2024-01-29 14:18:18,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:19,389 INFO L124 PetriNetUnfolderBase]: 8724/14719 cut-off events. [2024-01-29 14:18:19,390 INFO L125 PetriNetUnfolderBase]: For 2480/2926 co-relation queries the response was YES. [2024-01-29 14:18:19,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30608 conditions, 14719 events. 8724/14719 cut-off events. For 2480/2926 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 116937 event pairs, 4832 based on Foata normal form. 0/12902 useless extension candidates. Maximal degree in co-relation 14044. Up to 7572 conditions per place. [2024-01-29 14:18:19,452 INFO L140 encePairwiseOnDemand]: 144/153 looper letters, 79 selfloop transitions, 4 changer transitions 0/148 dead transitions. [2024-01-29 14:18:19,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 148 transitions, 531 flow [2024-01-29 14:18:19,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2024-01-29 14:18:19,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8605664488017429 [2024-01-29 14:18:19,454 INFO L175 Difference]: Start difference. First operand has 116 places, 116 transitions, 274 flow. Second operand 3 states and 395 transitions. [2024-01-29 14:18:19,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 148 transitions, 531 flow [2024-01-29 14:18:19,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 148 transitions, 525 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:19,479 INFO L231 Difference]: Finished difference. Result has 115 places, 115 transitions, 292 flow [2024-01-29 14:18:19,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=115, PETRI_TRANSITIONS=115} [2024-01-29 14:18:19,480 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -38 predicate places. [2024-01-29 14:18:19,480 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 115 transitions, 292 flow [2024-01-29 14:18:19,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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:18:19,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:19,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:19,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 14:18:19,481 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 14:18:19,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:19,481 INFO L85 PathProgramCache]: Analyzing trace with hash -547629719, now seen corresponding path program 1 times [2024-01-29 14:18:19,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:19,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863362120] [2024-01-29 14:18:19,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:19,496 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:18:19,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:19,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863362120] [2024-01-29 14:18:19,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863362120] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:19,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:19,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:19,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148091198] [2024-01-29 14:18:19,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:19,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:19,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:19,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:19,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:19,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 153 [2024-01-29 14:18:19,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 115 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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:18:19,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:19,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 153 [2024-01-29 14:18:19,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:20,484 INFO L124 PetriNetUnfolderBase]: 8542/14336 cut-off events. [2024-01-29 14:18:20,485 INFO L125 PetriNetUnfolderBase]: For 3801/4298 co-relation queries the response was YES. [2024-01-29 14:18:20,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30800 conditions, 14336 events. 8542/14336 cut-off events. For 3801/4298 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 114324 event pairs, 7157 based on Foata normal form. 1/12698 useless extension candidates. Maximal degree in co-relation 17757. Up to 12313 conditions per place. [2024-01-29 14:18:20,542 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 46 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2024-01-29 14:18:20,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 113 transitions, 384 flow [2024-01-29 14:18:20,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2024-01-29 14:18:20,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8017429193899782 [2024-01-29 14:18:20,543 INFO L175 Difference]: Start difference. First operand has 115 places, 115 transitions, 292 flow. Second operand 3 states and 368 transitions. [2024-01-29 14:18:20,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 113 transitions, 384 flow [2024-01-29 14:18:20,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 113 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:20,549 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 284 flow [2024-01-29 14:18:20,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2024-01-29 14:18:20,549 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, -40 predicate places. [2024-01-29 14:18:20,550 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 284 flow [2024-01-29 14:18:20,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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:18:20,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:20,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:20,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 14:18:20,550 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 73 more)] === [2024-01-29 14:18:20,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:20,551 INFO L85 PathProgramCache]: Analyzing trace with hash -169595958, now seen corresponding path program 1 times [2024-01-29 14:18:20,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:20,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059741615] [2024-01-29 14:18:20,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:20,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:18:20,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 14:18:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:18:20,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 14:18:20,611 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 14:18:20,612 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 76 remaining) [2024-01-29 14:18:20,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 76 remaining) [2024-01-29 14:18:20,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 76 remaining) [2024-01-29 14:18:20,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 76 remaining) [2024-01-29 14:18:20,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 76 remaining) [2024-01-29 14:18:20,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 76 remaining) [2024-01-29 14:18:20,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 76 remaining) [2024-01-29 14:18:20,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 76 remaining) [2024-01-29 14:18:20,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 76 remaining) [2024-01-29 14:18:20,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 76 remaining) [2024-01-29 14:18:20,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 76 remaining) [2024-01-29 14:18:20,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 76 remaining) [2024-01-29 14:18:20,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 76 remaining) [2024-01-29 14:18:20,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 76 remaining) [2024-01-29 14:18:20,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 76 remaining) [2024-01-29 14:18:20,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 76 remaining) [2024-01-29 14:18:20,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 76 remaining) [2024-01-29 14:18:20,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 76 remaining) [2024-01-29 14:18:20,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 76 remaining) [2024-01-29 14:18:20,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 76 remaining) [2024-01-29 14:18:20,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 76 remaining) [2024-01-29 14:18:20,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 76 remaining) [2024-01-29 14:18:20,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 76 remaining) [2024-01-29 14:18:20,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 76 remaining) [2024-01-29 14:18:20,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 76 remaining) [2024-01-29 14:18:20,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 76 remaining) [2024-01-29 14:18:20,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 76 remaining) [2024-01-29 14:18:20,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 76 remaining) [2024-01-29 14:18:20,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 76 remaining) [2024-01-29 14:18:20,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 76 remaining) [2024-01-29 14:18:20,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 76 remaining) [2024-01-29 14:18:20,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 76 remaining) [2024-01-29 14:18:20,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 76 remaining) [2024-01-29 14:18:20,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 76 remaining) [2024-01-29 14:18:20,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 76 remaining) [2024-01-29 14:18:20,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 76 remaining) [2024-01-29 14:18:20,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 76 remaining) [2024-01-29 14:18:20,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 76 remaining) [2024-01-29 14:18:20,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 76 remaining) [2024-01-29 14:18:20,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 76 remaining) [2024-01-29 14:18:20,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 76 remaining) [2024-01-29 14:18:20,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 76 remaining) [2024-01-29 14:18:20,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 76 remaining) [2024-01-29 14:18:20,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 76 remaining) [2024-01-29 14:18:20,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 76 remaining) [2024-01-29 14:18:20,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 76 remaining) [2024-01-29 14:18:20,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 76 remaining) [2024-01-29 14:18:20,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 76 remaining) [2024-01-29 14:18:20,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 76 remaining) [2024-01-29 14:18:20,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 76 remaining) [2024-01-29 14:18:20,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 76 remaining) [2024-01-29 14:18:20,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 76 remaining) [2024-01-29 14:18:20,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 76 remaining) [2024-01-29 14:18:20,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 76 remaining) [2024-01-29 14:18:20,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 76 remaining) [2024-01-29 14:18:20,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 76 remaining) [2024-01-29 14:18:20,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 76 remaining) [2024-01-29 14:18:20,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 76 remaining) [2024-01-29 14:18:20,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION (17 of 76 remaining) [2024-01-29 14:18:20,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 76 remaining) [2024-01-29 14:18:20,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 76 remaining) [2024-01-29 14:18:20,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 76 remaining) [2024-01-29 14:18:20,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 76 remaining) [2024-01-29 14:18:20,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 76 remaining) [2024-01-29 14:18:20,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 76 remaining) [2024-01-29 14:18:20,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 76 remaining) [2024-01-29 14:18:20,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 76 remaining) [2024-01-29 14:18:20,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 76 remaining) [2024-01-29 14:18:20,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 76 remaining) [2024-01-29 14:18:20,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 76 remaining) [2024-01-29 14:18:20,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 76 remaining) [2024-01-29 14:18:20,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 76 remaining) [2024-01-29 14:18:20,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 76 remaining) [2024-01-29 14:18:20,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 76 remaining) [2024-01-29 14:18:20,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 76 remaining) [2024-01-29 14:18:20,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 76 remaining) [2024-01-29 14:18:20,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 14:18:20,628 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:20,634 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 14:18:20,635 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 14:18:20,693 INFO L503 ceAbstractionStarter]: Automizer considered 57 witness invariants [2024-01-29 14:18:20,696 INFO L504 ceAbstractionStarter]: WitnessConsidered=57 [2024-01-29 14:18:20,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 02:18:20 BasicIcfg [2024-01-29 14:18:20,697 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 14:18:20,698 INFO L158 Benchmark]: Toolchain (without parser) took 9454.95ms. Allocated memory was 130.0MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 102.3MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 601.3MB. Max. memory is 16.1GB. [2024-01-29 14:18:20,698 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 130.0MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:18:20,698 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:18:20,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.05ms. Allocated memory is still 130.0MB. Free memory was 101.8MB in the beginning and 84.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-01-29 14:18:20,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.05ms. Allocated memory is still 130.0MB. Free memory was 84.5MB in the beginning and 81.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 14:18:20,699 INFO L158 Benchmark]: Boogie Preprocessor took 35.72ms. Allocated memory is still 130.0MB. Free memory was 81.8MB in the beginning and 79.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 14:18:20,699 INFO L158 Benchmark]: RCFGBuilder took 657.51ms. Allocated memory is still 130.0MB. Free memory was 79.3MB in the beginning and 86.9MB in the end (delta: -7.6MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. [2024-01-29 14:18:20,699 INFO L158 Benchmark]: TraceAbstraction took 8444.52ms. Allocated memory was 130.0MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 86.1MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 582.4MB. Max. memory is 16.1GB. [2024-01-29 14:18:20,700 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.14ms. Allocated memory is still 130.0MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.05ms. Allocated memory is still 130.0MB. Free memory was 101.8MB in the beginning and 84.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.05ms. Allocated memory is still 130.0MB. Free memory was 84.5MB in the beginning and 81.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.72ms. Allocated memory is still 130.0MB. Free memory was 81.8MB in the beginning and 79.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 657.51ms. Allocated memory is still 130.0MB. Free memory was 79.3MB in the beginning and 86.9MB in the end (delta: -7.6MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8444.52ms. Allocated memory was 130.0MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 86.1MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 582.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 86]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] 0 int length_0, to_int_1, length_2, to_int_3, length_4, to_int_5, result_6, result_7, result_8; [L61] 0 pthread_t t1, t2, t3; VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]]] VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]]]] [L64] 0 length_0 = __VERIFIER_nondet_int() [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] [L65] 0 to_int_1 = __VERIFIER_nondet_int() [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]] VAL [length_0=1, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]]] [L66] 0 length_2 = __VERIFIER_nondet_int() [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] [L67] 0 to_int_3 = __VERIFIER_nondet_int() [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] [L68] 0 length_4 = __VERIFIER_nondet_int() [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] [L69] 0 to_int_5 = __VERIFIER_nondet_int() [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L43] 1 length_0 == 0 ? (length_2 == 0 ? 0 : 1) : (length_2 == 0 ? -1 : minus(to_int_1, to_int_3)) VAL [_argptr={0:0}, _argptr={0:0}, length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, to_int_1=0, to_int_3=0, to_int_5=0] [L43] 1 length_2 == 0 ? -1 : minus(to_int_1, to_int_3) [L43] CALL 1 minus(to_int_1, to_int_3) [L86] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]] VAL [\old(a)=0, \old(b)=0, a=0, b=0, length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, to_int_1=0, to_int_3=0, to_int_5=0] - UnprovableResult [Line: 45]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: 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: 73]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 199 locations, 76 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: 8.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 357 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 249 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 807 IncrementalHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 44 mSDtfsCounter, 807 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=340occurred in iteration=2, InterpolantAutomatonStates: 27, 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.3s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 45 ConstructedInterpolants, 0 QuantifiedInterpolants, 135 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:18:20,736 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