./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-file-item-symm.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-file-item-symm.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-file-item-symm.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-file-item-symm.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-ab2e0ac-m [2024-01-29 14:17:48,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 14:17:48,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 14:17:48,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 14:17:48,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 14:17:48,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 14:17:48,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 14:17:48,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 14:17:48,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 14:17:48,533 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 14:17:48,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 14:17:48,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 14:17:48,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 14:17:48,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 14:17:48,535 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 14:17:48,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 14:17:48,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 14:17:48,535 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 14:17:48,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 14:17:48,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 14:17:48,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 14:17:48,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 14:17:48,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 14:17:48,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 14:17:48,537 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 14:17:48,537 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 14:17:48,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 14:17:48,537 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 14:17:48,538 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 14:17:48,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 14:17:48,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 14:17:48,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 14:17:48,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:17:48,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 14:17:48,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 14:17:48,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 14:17:48,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 14:17:48,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 14:17:48,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 14:17:48,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 14:17:48,541 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 14:17:48,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 14:17:48,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 14:17:48,541 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:17:48,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 14:17:48,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 14:17:48,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 14:17:48,734 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 14:17:48,735 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 14:17:48,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-file-item-symm.wvr.c [2024-01-29 14:17:49,666 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 14:17:49,843 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 14:17:49,845 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-symm.wvr.c [2024-01-29 14:17:49,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ddba66f/4f3a7fb4c2dd4947921f8239e384b8e2/FLAGe25fa0034 [2024-01-29 14:17:49,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ddba66f/4f3a7fb4c2dd4947921f8239e384b8e2 [2024-01-29 14:17:49,872 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 14:17:49,872 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 14:17:49,874 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-file-item-symm.wvr.yml/witness.yml [2024-01-29 14:17:49,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 14:17:49,969 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 14:17:49,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 14:17:49,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 14:17:49,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 14:17:49,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:17:49" (1/2) ... [2024-01-29 14:17:49,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15943f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:49, skipping insertion in model container [2024-01-29 14:17:49,978 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:17:49" (1/2) ... [2024-01-29 14:17:49,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6f83654f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:49, skipping insertion in model container [2024-01-29 14:17:49,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:17:49" (2/2) ... [2024-01-29 14:17:49,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15943f2e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:49, skipping insertion in model container [2024-01-29 14:17:49,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:17:49" (2/2) ... [2024-01-29 14:17:49,980 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 14:17:49,995 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 14:17:49,997 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] b != 0 [2024-01-29 14:17:49,997 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] b <= -1 [2024-01-29 14:17:49,997 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] isNull_3 == (_Bool)0 || isNull_3 == (_Bool)1 [2024-01-29 14:17:49,997 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] isNull_0 == (_Bool)0 || isNull_0 == (_Bool)1 [2024-01-29 14:17:49,997 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] filename_5 == (_Bool)0 || filename_5 == (_Bool)1 [2024-01-29 14:17:49,998 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] filename_2 == (_Bool)0 || filename_2 == (_Bool)1 [2024-01-29 14:17:49,998 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_7 == 0 [2024-01-29 14:17:49,998 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_6 == 0 [2024-01-29 14:17:49,998 INFO L98 nessWitnessExtractor]: Location invariant before [L46-L46] (unsigned long )_argptr == 0UL [2024-01-29 14:17:49,998 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] result_7 == 0 [2024-01-29 14:17:49,998 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] filename_5 == (_Bool)0 [2024-01-29 14:17:49,998 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] isNull_3 == (_Bool)0 [2024-01-29 14:17:49,998 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] filename_1 == 0 [2024-01-29 14:17:49,999 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] result_6 == 0 [2024-01-29 14:17:49,999 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] filename_2 == (_Bool)0 [2024-01-29 14:17:49,999 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] filename_4 == 0 [2024-01-29 14:17:49,999 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] isNull_0 == (_Bool)0 [2024-01-29 14:17:49,999 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] filename_2 == (_Bool)0 [2024-01-29 14:17:49,999 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] filename_4 == 0 [2024-01-29 14:17:49,999 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] isNull_3 == (_Bool)0 [2024-01-29 14:17:50,000 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] isNull_0 == (_Bool)0 [2024-01-29 14:17:50,000 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] result_6 == 0 [2024-01-29 14:17:50,000 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] filename_5 == (_Bool)0 [2024-01-29 14:17:50,001 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] result_7 == 0 [2024-01-29 14:17:50,001 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] isNull_0 == (_Bool)0 || isNull_0 == (_Bool)1 [2024-01-29 14:17:50,001 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] val == (_Bool)0 || val == (_Bool)1 [2024-01-29 14:17:50,001 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] result_6 == 0 [2024-01-29 14:17:50,001 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] filename_5 == (_Bool)0 [2024-01-29 14:17:50,001 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] filename_2 == (_Bool)0 || filename_2 == (_Bool)1 [2024-01-29 14:17:50,002 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] result_7 == 0 [2024-01-29 14:17:50,002 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] isNull_3 == (_Bool)0 || isNull_3 == (_Bool)1 [2024-01-29 14:17:50,002 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] isNull_0 == (_Bool)0 || isNull_0 == (_Bool)1 [2024-01-29 14:17:50,002 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] result_7 == 0 [2024-01-29 14:17:50,002 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] isNull_3 == (_Bool)0 || isNull_3 == (_Bool)1 [2024-01-29 14:17:50,002 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] result_6 == 0 [2024-01-29 14:17:50,003 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] filename_2 == (_Bool)0 || filename_2 == (_Bool)1 [2024-01-29 14:17:50,003 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] filename_5 == (_Bool)0 [2024-01-29 14:17:50,003 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] isNull_0 == (_Bool)0 [2024-01-29 14:17:50,004 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] result_7 == 0 [2024-01-29 14:17:50,004 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] isNull_3 == (_Bool)0 [2024-01-29 14:17:50,004 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] filename_2 == (_Bool)0 [2024-01-29 14:17:50,004 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] result_6 == 0 [2024-01-29 14:17:50,004 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] filename_5 == (_Bool)0 [2024-01-29 14:17:50,004 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] isNull_3 == (_Bool)0 [2024-01-29 14:17:50,005 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] filename_5 == (_Bool)0 [2024-01-29 14:17:50,005 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_6 == 0 [2024-01-29 14:17:50,005 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] filename_4 == 0 [2024-01-29 14:17:50,005 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] isNull_0 == (_Bool)0 [2024-01-29 14:17:50,005 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] filename_2 == (_Bool)0 [2024-01-29 14:17:50,006 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_7 == 0 [2024-01-29 14:17:50,006 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-29 14:17:50,026 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] result_7 == 0 [2024-01-29 14:17:50,026 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] isNull_3 == (_Bool)0 [2024-01-29 14:17:50,026 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] isNull_0 == (_Bool)0 || isNull_0 == (_Bool)1 [2024-01-29 14:17:50,026 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] result_6 == 0 [2024-01-29 14:17:50,026 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] filename_2 == (_Bool)0 [2024-01-29 14:17:50,026 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] filename_5 == (_Bool)0 [2024-01-29 14:17:50,026 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] result_6 == 0 [2024-01-29 14:17:50,027 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] filename_2 == (_Bool)0 [2024-01-29 14:17:50,027 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] filename_5 == (_Bool)0 [2024-01-29 14:17:50,027 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] result_7 == 0 [2024-01-29 14:17:50,027 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] isNull_0 == (_Bool)0 || isNull_0 == (_Bool)1 [2024-01-29 14:17:50,027 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] isNull_3 == (_Bool)0 || isNull_3 == (_Bool)1 [2024-01-29 14:17:50,043 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 14:17:50,174 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-file-item-symm.wvr.c[2521,2534] [2024-01-29 14:17:50,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:17:50,189 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 14:17:50,200 WARN L424 MainDispatcher]: Unable to annotate __assert_fail(const char *__assertion, const char *__file, unsigned int __line, const char *__function) with a witness entry [2024-01-29 14:17:50,207 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 Start Parsing Local Start Parsing Local [2024-01-29 14:17:50,270 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-file-item-symm.wvr.c[2521,2534] Start Parsing Local Start Parsing Local [2024-01-29 14:17:50,273 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:17:50,283 INFO L206 MainTranslator]: Completed translation [2024-01-29 14:17:50,283 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:50 WrapperNode [2024-01-29 14:17:50,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 14:17:50,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 14:17:50,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 14:17:50,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 14:17:50,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:50" (1/1) ... [2024-01-29 14:17:50,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:50" (1/1) ... [2024-01-29 14:17:50,332 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 200 [2024-01-29 14:17:50,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 14:17:50,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 14:17:50,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 14:17:50,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 14:17:50,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:50" (1/1) ... [2024-01-29 14:17:50,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:50" (1/1) ... [2024-01-29 14:17:50,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:50" (1/1) ... [2024-01-29 14:17:50,383 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-01-29 14:17:50,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:50" (1/1) ... [2024-01-29 14:17:50,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:50" (1/1) ... [2024-01-29 14:17:50,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:50" (1/1) ... [2024-01-29 14:17:50,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:50" (1/1) ... [2024-01-29 14:17:50,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:50" (1/1) ... [2024-01-29 14:17:50,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:50" (1/1) ... [2024-01-29 14:17:50,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 14:17:50,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 14:17:50,408 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 14:17:50,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 14:17:50,409 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:50" (1/1) ... [2024-01-29 14:17:50,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:17:50,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:17:50,438 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:17:50,456 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:17:50,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 14:17:50,475 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 14:17:50,475 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 14:17:50,475 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 14:17:50,475 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 14:17:50,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 14:17:50,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 14:17:50,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 14:17:50,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 14:17:50,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 14:17:50,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 14:17:50,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 14:17:50,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 14:17:50,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 14:17:50,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 14:17:50,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 14:17:50,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 14:17:50,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 14:17:50,479 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:17:50,575 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 14:17:50,577 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 14:17:50,833 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 14:17:50,834 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 14:17:50,999 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 14:17:51,000 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 14:17:51,000 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:17:51 BoogieIcfgContainer [2024-01-29 14:17:51,000 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 14:17:51,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 14:17:51,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 14:17:51,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 14:17:51,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 02:17:49" (1/4) ... [2024-01-29 14:17:51,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34abb5f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:17:51, skipping insertion in model container [2024-01-29 14:17:51,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:17:49" (2/4) ... [2024-01-29 14:17:51,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34abb5f8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:17:51, skipping insertion in model container [2024-01-29 14:17:51,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:50" (3/4) ... [2024-01-29 14:17:51,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34abb5f8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:17:51, skipping insertion in model container [2024-01-29 14:17:51,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:17:51" (4/4) ... [2024-01-29 14:17:51,006 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-symm.wvr.c [2024-01-29 14:17:51,019 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 14:17:51,020 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2024-01-29 14:17:51,020 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 14:17:51,094 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 14:17:51,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 141 transitions, 296 flow [2024-01-29 14:17:51,194 INFO L124 PetriNetUnfolderBase]: 8/139 cut-off events. [2024-01-29 14:17:51,195 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 14:17:51,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 139 events. 8/139 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 168 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2024-01-29 14:17:51,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 141 transitions, 296 flow [2024-01-29 14:17:51,209 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 138 transitions, 288 flow [2024-01-29 14:17:51,220 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 14:17:51,227 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;@74e0a6a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 14:17:51,231 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-01-29 14:17:51,233 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 14:17:51,233 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 14:17:51,233 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:17:51,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:51,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 14:17:51,234 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 14:17:51,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:51,242 INFO L85 PathProgramCache]: Analyzing trace with hash 18184, now seen corresponding path program 1 times [2024-01-29 14:17:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:51,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312054903] [2024-01-29 14:17:51,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:51,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:51,452 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:17:51,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:51,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312054903] [2024-01-29 14:17:51,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312054903] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:51,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:51,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:51,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035024472] [2024-01-29 14:17:51,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:51,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:51,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:51,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:51,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:51,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 141 [2024-01-29 14:17:51,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 138 transitions, 288 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:17:51,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:51,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 141 [2024-01-29 14:17:51,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:51,699 INFO L124 PetriNetUnfolderBase]: 246/570 cut-off events. [2024-01-29 14:17:51,702 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-01-29 14:17:51,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 570 events. 246/570 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3038 event pairs, 189 based on Foata normal form. 2/444 useless extension candidates. Maximal degree in co-relation 814. Up to 397 conditions per place. [2024-01-29 14:17:51,709 INFO L140 encePairwiseOnDemand]: 136/141 looper letters, 34 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2024-01-29 14:17:51,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 135 transitions, 354 flow [2024-01-29 14:17:51,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2024-01-29 14:17:51,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8085106382978723 [2024-01-29 14:17:51,720 INFO L175 Difference]: Start difference. First operand has 137 places, 138 transitions, 288 flow. Second operand 3 states and 342 transitions. [2024-01-29 14:17:51,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 135 transitions, 354 flow [2024-01-29 14:17:51,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 135 transitions, 346 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 14:17:51,727 INFO L231 Difference]: Finished difference. Result has 132 places, 135 transitions, 278 flow [2024-01-29 14:17:51,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=132, PETRI_TRANSITIONS=135} [2024-01-29 14:17:51,731 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -5 predicate places. [2024-01-29 14:17:51,732 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 135 transitions, 278 flow [2024-01-29 14:17:51,733 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:17:51,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:51,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 14:17:51,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 14:17:51,733 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 14:17:51,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:51,734 INFO L85 PathProgramCache]: Analyzing trace with hash 564281, now seen corresponding path program 1 times [2024-01-29 14:17:51,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:51,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487634163] [2024-01-29 14:17:51,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:51,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:51,775 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:17:51,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:51,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487634163] [2024-01-29 14:17:51,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487634163] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:51,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:51,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:51,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764800159] [2024-01-29 14:17:51,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:51,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:51,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:51,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:51,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:51,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 141 [2024-01-29 14:17:51,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 135 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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:17:51,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:51,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 141 [2024-01-29 14:17:51,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:51,873 INFO L124 PetriNetUnfolderBase]: 246/568 cut-off events. [2024-01-29 14:17:51,873 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 14:17:51,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 568 events. 246/568 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3052 event pairs, 189 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 930. Up to 394 conditions per place. [2024-01-29 14:17:51,879 INFO L140 encePairwiseOnDemand]: 137/141 looper letters, 32 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2024-01-29 14:17:51,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 133 transitions, 342 flow [2024-01-29 14:17:51,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2024-01-29 14:17:51,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8226950354609929 [2024-01-29 14:17:51,884 INFO L175 Difference]: Start difference. First operand has 132 places, 135 transitions, 278 flow. Second operand 3 states and 348 transitions. [2024-01-29 14:17:51,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 133 transitions, 342 flow [2024-01-29 14:17:51,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 133 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:51,888 INFO L231 Difference]: Finished difference. Result has 130 places, 133 transitions, 274 flow [2024-01-29 14:17:51,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=130, PETRI_TRANSITIONS=133} [2024-01-29 14:17:51,889 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -7 predicate places. [2024-01-29 14:17:51,889 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 133 transitions, 274 flow [2024-01-29 14:17:51,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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:17:51,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:51,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 14:17:51,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 14:17:51,892 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 14:17:51,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:51,893 INFO L85 PathProgramCache]: Analyzing trace with hash 17493257, now seen corresponding path program 1 times [2024-01-29 14:17:51,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:51,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436521980] [2024-01-29 14:17:51,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:51,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:52,029 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:17:52,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:52,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436521980] [2024-01-29 14:17:52,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436521980] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:52,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:52,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:52,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148040485] [2024-01-29 14:17:52,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:52,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:52,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:52,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:52,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:52,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 141 [2024-01-29 14:17:52,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 133 transitions, 274 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:17:52,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:52,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 141 [2024-01-29 14:17:52,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:52,149 INFO L124 PetriNetUnfolderBase]: 246/563 cut-off events. [2024-01-29 14:17:52,149 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 14:17:52,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 563 events. 246/563 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3040 event pairs, 189 based on Foata normal form. 5/446 useless extension candidates. Maximal degree in co-relation 941. Up to 393 conditions per place. [2024-01-29 14:17:52,153 INFO L140 encePairwiseOnDemand]: 134/141 looper letters, 32 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2024-01-29 14:17:52,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 128 transitions, 332 flow [2024-01-29 14:17:52,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:52,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2024-01-29 14:17:52,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8085106382978723 [2024-01-29 14:17:52,154 INFO L175 Difference]: Start difference. First operand has 130 places, 133 transitions, 274 flow. Second operand 3 states and 342 transitions. [2024-01-29 14:17:52,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 128 transitions, 332 flow [2024-01-29 14:17:52,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 128 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:52,158 INFO L231 Difference]: Finished difference. Result has 125 places, 128 transitions, 264 flow [2024-01-29 14:17:52,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=125, PETRI_TRANSITIONS=128} [2024-01-29 14:17:52,159 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -12 predicate places. [2024-01-29 14:17:52,159 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 128 transitions, 264 flow [2024-01-29 14:17:52,160 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:17:52,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:52,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 14:17:52,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 14:17:52,160 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 14:17:52,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:52,161 INFO L85 PathProgramCache]: Analyzing trace with hash 542291517, now seen corresponding path program 1 times [2024-01-29 14:17:52,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:52,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112636134] [2024-01-29 14:17:52,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:52,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:52,198 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:17:52,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:52,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112636134] [2024-01-29 14:17:52,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112636134] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:52,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:52,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:52,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641573015] [2024-01-29 14:17:52,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:52,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:52,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:52,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:52,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:52,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 141 [2024-01-29 14:17:52,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 128 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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:17:52,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:52,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 141 [2024-01-29 14:17:52,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:52,300 INFO L124 PetriNetUnfolderBase]: 246/562 cut-off events. [2024-01-29 14:17:52,300 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:52,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 562 events. 246/562 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 3108 event pairs, 127 based on Foata normal form. 1/450 useless extension candidates. Maximal degree in co-relation 910. Up to 279 conditions per place. [2024-01-29 14:17:52,304 INFO L140 encePairwiseOnDemand]: 132/141 looper letters, 47 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2024-01-29 14:17:52,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 132 transitions, 371 flow [2024-01-29 14:17:52,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2024-01-29 14:17:52,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.806146572104019 [2024-01-29 14:17:52,306 INFO L175 Difference]: Start difference. First operand has 125 places, 128 transitions, 264 flow. Second operand 3 states and 341 transitions. [2024-01-29 14:17:52,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 132 transitions, 371 flow [2024-01-29 14:17:52,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 132 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:52,308 INFO L231 Difference]: Finished difference. Result has 118 places, 121 transitions, 250 flow [2024-01-29 14:17:52,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=118, PETRI_TRANSITIONS=121} [2024-01-29 14:17:52,309 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -19 predicate places. [2024-01-29 14:17:52,310 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 121 transitions, 250 flow [2024-01-29 14:17:52,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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:17:52,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:52,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 14:17:52,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 14:17:52,310 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 14:17:52,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:52,311 INFO L85 PathProgramCache]: Analyzing trace with hash -368831574, now seen corresponding path program 1 times [2024-01-29 14:17:52,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:52,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185798142] [2024-01-29 14:17:52,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:52,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:52,354 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:17:52,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:52,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185798142] [2024-01-29 14:17:52,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185798142] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:52,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:52,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:52,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659940129] [2024-01-29 14:17:52,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:52,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:52,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:52,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:52,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:52,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 141 [2024-01-29 14:17:52,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 121 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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:17:52,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:52,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 141 [2024-01-29 14:17:52,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:52,442 INFO L124 PetriNetUnfolderBase]: 246/555 cut-off events. [2024-01-29 14:17:52,443 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-01-29 14:17:52,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 555 events. 246/555 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3019 event pairs, 189 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 699. Up to 395 conditions per place. [2024-01-29 14:17:52,446 INFO L140 encePairwiseOnDemand]: 138/141 looper letters, 31 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2024-01-29 14:17:52,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 120 transitions, 314 flow [2024-01-29 14:17:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2024-01-29 14:17:52,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8321513002364066 [2024-01-29 14:17:52,447 INFO L175 Difference]: Start difference. First operand has 118 places, 121 transitions, 250 flow. Second operand 3 states and 352 transitions. [2024-01-29 14:17:52,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 120 transitions, 314 flow [2024-01-29 14:17:52,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 120 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:52,450 INFO L231 Difference]: Finished difference. Result has 117 places, 120 transitions, 248 flow [2024-01-29 14:17:52,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=117, PETRI_TRANSITIONS=120} [2024-01-29 14:17:52,452 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -20 predicate places. [2024-01-29 14:17:52,453 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 120 transitions, 248 flow [2024-01-29 14:17:52,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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:17:52,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:52,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:52,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 14:17:52,454 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 14:17:52,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:52,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1451123667, now seen corresponding path program 1 times [2024-01-29 14:17:52,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:52,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958006310] [2024-01-29 14:17:52,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:52,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:52,505 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:17:52,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:52,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958006310] [2024-01-29 14:17:52,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958006310] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:52,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:52,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:52,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725932362] [2024-01-29 14:17:52,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:52,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:52,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:52,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:52,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:52,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 141 [2024-01-29 14:17:52,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 120 transitions, 248 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:17:52,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:52,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 141 [2024-01-29 14:17:52,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:52,617 INFO L124 PetriNetUnfolderBase]: 246/551 cut-off events. [2024-01-29 14:17:52,617 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 14:17:52,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 551 events. 246/551 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3037 event pairs, 189 based on Foata normal form. 4/443 useless extension candidates. Maximal degree in co-relation 945. Up to 395 conditions per place. [2024-01-29 14:17:52,620 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 33 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2024-01-29 14:17:52,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 116 transitions, 310 flow [2024-01-29 14:17:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2024-01-29 14:17:52,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8085106382978723 [2024-01-29 14:17:52,621 INFO L175 Difference]: Start difference. First operand has 117 places, 120 transitions, 248 flow. Second operand 3 states and 342 transitions. [2024-01-29 14:17:52,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 116 transitions, 310 flow [2024-01-29 14:17:52,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 116 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:52,622 INFO L231 Difference]: Finished difference. Result has 113 places, 116 transitions, 240 flow [2024-01-29 14:17:52,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=111, 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=240, PETRI_PLACES=113, PETRI_TRANSITIONS=116} [2024-01-29 14:17:52,625 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -24 predicate places. [2024-01-29 14:17:52,625 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 116 transitions, 240 flow [2024-01-29 14:17:52,625 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:17:52,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:52,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:52,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 14:17:52,625 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 14:17:52,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:52,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2035161315, now seen corresponding path program 1 times [2024-01-29 14:17:52,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:52,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290831608] [2024-01-29 14:17:52,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:52,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:52,679 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:17:52,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:52,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290831608] [2024-01-29 14:17:52,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290831608] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:52,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:52,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:52,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030356858] [2024-01-29 14:17:52,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:52,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:52,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:52,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:52,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:52,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 141 [2024-01-29 14:17:52,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 116 transitions, 240 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:17:52,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:52,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 141 [2024-01-29 14:17:52,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:52,769 INFO L124 PetriNetUnfolderBase]: 246/545 cut-off events. [2024-01-29 14:17:52,769 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 14:17:52,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 545 events. 246/545 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3033 event pairs, 189 based on Foata normal form. 6/445 useless extension candidates. Maximal degree in co-relation 912. Up to 391 conditions per place. [2024-01-29 14:17:52,772 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 31 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2024-01-29 14:17:52,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 110 transitions, 294 flow [2024-01-29 14:17:52,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:52,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2024-01-29 14:17:52,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8085106382978723 [2024-01-29 14:17:52,773 INFO L175 Difference]: Start difference. First operand has 113 places, 116 transitions, 240 flow. Second operand 3 states and 342 transitions. [2024-01-29 14:17:52,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 110 transitions, 294 flow [2024-01-29 14:17:52,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 110 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:52,775 INFO L231 Difference]: Finished difference. Result has 107 places, 110 transitions, 228 flow [2024-01-29 14:17:52,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=107, PETRI_TRANSITIONS=110} [2024-01-29 14:17:52,776 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -30 predicate places. [2024-01-29 14:17:52,776 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 110 transitions, 228 flow [2024-01-29 14:17:52,776 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:17:52,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:52,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:52,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 14:17:52,776 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 14:17:52,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:52,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1334508123, now seen corresponding path program 1 times [2024-01-29 14:17:52,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:52,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407509994] [2024-01-29 14:17:52,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:52,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:52,794 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:17:52,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:52,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407509994] [2024-01-29 14:17:52,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407509994] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:52,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:52,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:52,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282351993] [2024-01-29 14:17:52,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:52,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:52,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:52,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:52,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:52,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 141 [2024-01-29 14:17:52,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 110 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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:17:52,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:52,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 141 [2024-01-29 14:17:52,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:52,877 INFO L124 PetriNetUnfolderBase]: 246/540 cut-off events. [2024-01-29 14:17:52,877 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 14:17:52,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 540 events. 246/540 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3056 event pairs, 141 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 892. Up to 310 conditions per place. [2024-01-29 14:17:52,880 INFO L140 encePairwiseOnDemand]: 132/141 looper letters, 46 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2024-01-29 14:17:52,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 114 transitions, 333 flow [2024-01-29 14:17:52,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2024-01-29 14:17:52,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8108747044917257 [2024-01-29 14:17:52,881 INFO L175 Difference]: Start difference. First operand has 107 places, 110 transitions, 228 flow. Second operand 3 states and 343 transitions. [2024-01-29 14:17:52,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 114 transitions, 333 flow [2024-01-29 14:17:52,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 114 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:52,883 INFO L231 Difference]: Finished difference. Result has 100 places, 103 transitions, 214 flow [2024-01-29 14:17:52,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=100, PETRI_TRANSITIONS=103} [2024-01-29 14:17:52,884 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -37 predicate places. [2024-01-29 14:17:52,884 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 103 transitions, 214 flow [2024-01-29 14:17:52,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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:17:52,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:52,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:52,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 14:17:52,884 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 14:17:52,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:52,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1097874739, now seen corresponding path program 1 times [2024-01-29 14:17:52,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:52,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368558366] [2024-01-29 14:17:52,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:52,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:17:52,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 14:17:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:17:52,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 14:17:52,911 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 14:17:52,911 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 60 remaining) [2024-01-29 14:17:52,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 60 remaining) [2024-01-29 14:17:52,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 60 remaining) [2024-01-29 14:17:52,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 60 remaining) [2024-01-29 14:17:52,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 60 remaining) [2024-01-29 14:17:52,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 60 remaining) [2024-01-29 14:17:52,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 60 remaining) [2024-01-29 14:17:52,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 60 remaining) [2024-01-29 14:17:52,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 60 remaining) [2024-01-29 14:17:52,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 60 remaining) [2024-01-29 14:17:52,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 60 remaining) [2024-01-29 14:17:52,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 60 remaining) [2024-01-29 14:17:52,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 60 remaining) [2024-01-29 14:17:52,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 60 remaining) [2024-01-29 14:17:52,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 60 remaining) [2024-01-29 14:17:52,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 60 remaining) [2024-01-29 14:17:52,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 60 remaining) [2024-01-29 14:17:52,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 60 remaining) [2024-01-29 14:17:52,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 60 remaining) [2024-01-29 14:17:52,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 60 remaining) [2024-01-29 14:17:52,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 60 remaining) [2024-01-29 14:17:52,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 60 remaining) [2024-01-29 14:17:52,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 60 remaining) [2024-01-29 14:17:52,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 60 remaining) [2024-01-29 14:17:52,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 60 remaining) [2024-01-29 14:17:52,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 60 remaining) [2024-01-29 14:17:52,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 60 remaining) [2024-01-29 14:17:52,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 60 remaining) [2024-01-29 14:17:52,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 60 remaining) [2024-01-29 14:17:52,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 60 remaining) [2024-01-29 14:17:52,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 60 remaining) [2024-01-29 14:17:52,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 60 remaining) [2024-01-29 14:17:52,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 60 remaining) [2024-01-29 14:17:52,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 60 remaining) [2024-01-29 14:17:52,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 60 remaining) [2024-01-29 14:17:52,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 60 remaining) [2024-01-29 14:17:52,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 60 remaining) [2024-01-29 14:17:52,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 60 remaining) [2024-01-29 14:17:52,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 60 remaining) [2024-01-29 14:17:52,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 60 remaining) [2024-01-29 14:17:52,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 60 remaining) [2024-01-29 14:17:52,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 60 remaining) [2024-01-29 14:17:52,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 60 remaining) [2024-01-29 14:17:52,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 60 remaining) [2024-01-29 14:17:52,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 60 remaining) [2024-01-29 14:17:52,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 60 remaining) [2024-01-29 14:17:52,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 60 remaining) [2024-01-29 14:17:52,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 60 remaining) [2024-01-29 14:17:52,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 60 remaining) [2024-01-29 14:17:52,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 60 remaining) [2024-01-29 14:17:52,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 60 remaining) [2024-01-29 14:17:52,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION (8 of 60 remaining) [2024-01-29 14:17:52,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 60 remaining) [2024-01-29 14:17:52,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 60 remaining) [2024-01-29 14:17:52,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 60 remaining) [2024-01-29 14:17:52,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 60 remaining) [2024-01-29 14:17:52,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 60 remaining) [2024-01-29 14:17:52,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 60 remaining) [2024-01-29 14:17:52,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 60 remaining) [2024-01-29 14:17:52,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 60 remaining) [2024-01-29 14:17:52,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 14:17:52,919 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:52,924 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 14:17:52,924 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 14:17:52,946 INFO L503 ceAbstractionStarter]: Automizer considered 51 witness invariants [2024-01-29 14:17:52,946 INFO L504 ceAbstractionStarter]: WitnessConsidered=51 [2024-01-29 14:17:52,946 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 02:17:52 BasicIcfg [2024-01-29 14:17:52,947 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 14:17:52,947 INFO L158 Benchmark]: Toolchain (without parser) took 2977.62ms. Allocated memory was 172.0MB in the beginning and 255.9MB in the end (delta: 83.9MB). Free memory was 98.4MB in the beginning and 111.1MB in the end (delta: -12.7MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. [2024-01-29 14:17:52,947 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 172.0MB. Free memory was 132.9MB in the beginning and 132.8MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:17:52,947 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 172.0MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:17:52,947 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.86ms. Allocated memory is still 172.0MB. Free memory was 98.2MB in the beginning and 129.0MB in the end (delta: -30.8MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2024-01-29 14:17:52,948 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.47ms. Allocated memory is still 172.0MB. Free memory was 129.0MB in the beginning and 126.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 14:17:52,948 INFO L158 Benchmark]: Boogie Preprocessor took 73.99ms. Allocated memory is still 172.0MB. Free memory was 126.9MB in the beginning and 124.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 14:17:52,948 INFO L158 Benchmark]: RCFGBuilder took 592.79ms. Allocated memory is still 172.0MB. Free memory was 124.4MB in the beginning and 76.6MB in the end (delta: 47.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-01-29 14:17:52,948 INFO L158 Benchmark]: TraceAbstraction took 1944.89ms. Allocated memory was 172.0MB in the beginning and 255.9MB in the end (delta: 83.9MB). Free memory was 76.6MB in the beginning and 111.1MB in the end (delta: -34.5MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2024-01-29 14:17:52,949 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 172.0MB. Free memory was 132.9MB in the beginning and 132.8MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 172.0MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.86ms. Allocated memory is still 172.0MB. Free memory was 98.2MB in the beginning and 129.0MB in the end (delta: -30.8MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.47ms. Allocated memory is still 172.0MB. Free memory was 129.0MB in the beginning and 126.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.99ms. Allocated memory is still 172.0MB. Free memory was 126.9MB in the beginning and 124.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 592.79ms. Allocated memory is still 172.0MB. Free memory was 124.4MB in the beginning and 76.6MB in the end (delta: 47.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1944.89ms. Allocated memory was 172.0MB in the beginning and 255.9MB in the end (delta: 83.9MB). Free memory was 76.6MB in the beginning and 111.1MB in the end (delta: -34.5MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 61]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] int filename_1, filename_4, result_6, result_7; [L39] _Bool isNull_0, isNull_3, filename_2, filename_5; [L56] pthread_t t1, t2; VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L58] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[isNull_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L58] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_4],IntegerLiteral[0]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L58] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L58] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L58] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_1],IntegerLiteral[0]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L58] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[isNull_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L58] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L58] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] [L58] filename_1 = __VERIFIER_nondet_int() [L59] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L59] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L59] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L59] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[isNull_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L59] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[isNull_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L59] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_4],IntegerLiteral[0]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L59] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] [L59] filename_4 = __VERIFIER_nondet_int() [L60] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L60] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L60] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L60] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[isNull_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L60] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L60] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[isNull_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] [L60] isNull_0 = __VERIFIER_nondet_bool() [L61] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L61] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L61] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L61] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[isNull_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[isNull_0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=2, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] - UnprovableResult [Line: 46]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: 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: 74]: 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: 67]: 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: 66]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 168 locations, 60 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 566 IncrementalHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 34 mSDtfsCounter, 566 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:17:52,970 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