./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/clever.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/clever.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b 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/clever.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/clever.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-8857f20-m [2024-01-29 22:57:15,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:57:15,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 22:57:15,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:57:15,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:57:15,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:57:15,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:57:15,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:57:15,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:57:15,981 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:57:15,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:57:15,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:57:15,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:57:15,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:57:15,991 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:57:15,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:57:15,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:57:15,992 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:57:15,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:57:15,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:57:15,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:57:15,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:57:15,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:57:15,993 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:57:15,994 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:57:15,994 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:57:15,994 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:57:15,994 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:57:15,995 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:57:15,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:57:15,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:57:15,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:57:15,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:57:15,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:57:15,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:57:15,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:57:15,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:57:15,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:57:15,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:57:15,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:57:15,999 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:57:15,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:57:15,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:57:16,000 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 22:57:16,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:57:16,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:57:16,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:57:16,310 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:57:16,311 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:57:16,312 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/clever.wvr.yml/witness.yml [2024-01-29 22:57:16,442 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:57:16,442 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:57:16,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/clever.wvr.c [2024-01-29 22:57:17,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:57:17,902 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:57:17,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c [2024-01-29 22:57:17,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/140a87adc/8c364f7f07194fbaa322268643516eb2/FLAG81cc9f963 [2024-01-29 22:57:17,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/140a87adc/8c364f7f07194fbaa322268643516eb2 [2024-01-29 22:57:17,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:57:17,923 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:57:17,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:57:17,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:57:17,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:57:17,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:57:16" (1/2) ... [2024-01-29 22:57:17,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae12b32 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:17, skipping insertion in model container [2024-01-29 22:57:17,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:57:16" (1/2) ... [2024-01-29 22:57:17,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2f73b602 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:17, skipping insertion in model container [2024-01-29 22:57:17,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:57:17" (2/2) ... [2024-01-29 22:57:17,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae12b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:17, skipping insertion in model container [2024-01-29 22:57:17,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:57:17" (2/2) ... [2024-01-29 22:57:17,934 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:57:17,955 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:57:17,956 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (j1 == 0) && (k1 == 0U) [2024-01-29 22:57:17,956 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] ((j1 == 0) && (k1 == 0U)) && (k2 == 0U) [2024-01-29 22:57:17,957 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] j1 == 0 [2024-01-29 22:57:17,957 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL) [2024-01-29 22:57:17,957 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL)) && (n == 0) [2024-01-29 22:57:17,957 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL) [2024-01-29 22:57:17,957 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL)) && ((long long )i2 - (long long )j1 >= 0LL) [2024-01-29 22:57:17,957 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (0LL - (long long )i2) + (long long )j1 >= 0LL [2024-01-29 22:57:17,958 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL)) && (i1 == 0) [2024-01-29 22:57:17,958 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL)) && (j1 == 0) [2024-01-29 22:57:17,958 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL)) && (m == 0) [2024-01-29 22:57:17,958 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL)) && (i2 == 0) [2024-01-29 22:57:17,958 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL)) && (k1 == 0U) [2024-01-29 22:57:17,958 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL)) && (k2 == 0U) [2024-01-29 22:57:17,959 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-29 22:57:17,959 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-29 22:57:17,959 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] k2 == 0U [2024-01-29 22:57:17,959 INFO L98 nessWitnessExtractor]: Loop invariant at [L41-L43] (unsigned long )_argptr == 0UL [2024-01-29 22:57:17,959 INFO L98 nessWitnessExtractor]: Location invariant after [L41-L43] k2 == 0U [2024-01-29 22:57:17,959 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-29 22:57:17,959 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && (j1 == 0) [2024-01-29 22:57:17,960 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL) [2024-01-29 22:57:17,960 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && (j1 == 0)) && (k1 == 0U) [2024-01-29 22:57:17,960 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((long long )i2 - (long long )j1 >= 0LL) [2024-01-29 22:57:17,960 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && (j1 == 0)) && (k2 == 0U) [2024-01-29 22:57:17,960 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL) [2024-01-29 22:57:17,960 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (0LL - (long long )i2) + (long long )j1 >= 0LL [2024-01-29 22:57:17,961 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && (i2 == 0) [2024-01-29 22:57:17,961 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] j1 == 0 [2024-01-29 22:57:17,961 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (j1 == 0) && (k1 == 0U) [2024-01-29 22:57:17,961 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (j1 == 0) && (k2 == 0U) [2024-01-29 22:57:17,961 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((long long )i2 - (long long )j1 >= 0LL) [2024-01-29 22:57:17,961 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((long long )i2 - (long long )j1 >= 0LL)) && (i1 == 0) [2024-01-29 22:57:17,961 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((long long )i2 - (long long )j1 >= 0LL)) && (i2 == 0) [2024-01-29 22:57:17,962 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL) [2024-01-29 22:57:17,962 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((long long )i2 - (long long )j1 >= 0LL)) && (j1 == 0) [2024-01-29 22:57:17,962 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((long long )i2 - (long long )j1 >= 0LL)) && (k2 == 0U) [2024-01-29 22:57:17,962 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL) [2024-01-29 22:57:17,962 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((long long )i2 - (long long )j1 >= 0LL)) && (k1 == 0U) [2024-01-29 22:57:17,962 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (0LL - (long long )i2) + (long long )j1 >= 0LL [2024-01-29 22:57:17,962 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (0LL - (long long )i2) + (long long )j1 >= 0LL [2024-01-29 22:57:17,963 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 - (long long )j1 >= 0LL) [2024-01-29 22:57:17,963 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((0LL - (long long )i2) + (long long )j1 >= 0LL) && (i2 == 0) [2024-01-29 22:57:17,963 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL) [2024-01-29 22:57:17,963 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((0LL - (long long )i2) + (long long )j1 >= 0LL) && (i1 == 0) [2024-01-29 22:57:17,963 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((0LL - (long long )i2) + (long long )j1 >= 0LL) && (m == 0) [2024-01-29 22:57:17,963 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((0LL - (long long )i2) + (long long )j1 >= 0LL) && (k2 == 0U) [2024-01-29 22:57:17,964 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((0LL - (long long )i2) - (long long )j1 >= 0LL) [2024-01-29 22:57:17,964 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((0LL - (long long )i2) + (long long )j1 >= 0LL) && (j1 == 0) [2024-01-29 22:57:17,964 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((0LL - (long long )i2) + (long long )j1 >= 0LL) && (k1 == 0U) [2024-01-29 22:57:17,964 INFO L98 nessWitnessExtractor]: Location invariant before [L42-L42] (unsigned long )_argptr == 0UL [2024-01-29 22:57:17,964 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] (unsigned long )_argptr == 0UL [2024-01-29 22:57:17,964 INFO L98 nessWitnessExtractor]: Loop invariant at [L51-L54] (unsigned long )_argptr == 0UL [2024-01-29 22:57:17,965 INFO L98 nessWitnessExtractor]: Loop invariant at [L40-L45] (unsigned long )_argptr == 0UL [2024-01-29 22:57:17,965 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] k1 == 0U [2024-01-29 22:57:17,965 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (k1 == 0U) && (k2 == 0U) [2024-01-29 22:57:17,965 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-29 22:57:17,984 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:57:18,186 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/clever.wvr.c[2159,2172] [2024-01-29 22:57:18,192 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:57:18,208 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 22:57:18,221 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 Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:57:18,311 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/clever.wvr.c[2159,2172] [2024-01-29 22:57:18,313 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:57:18,326 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:57:18,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:18 WrapperNode [2024-01-29 22:57:18,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:57:18,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:57:18,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:57:18,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:57:18,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:18" (1/1) ... [2024-01-29 22:57:18,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:18" (1/1) ... [2024-01-29 22:57:18,370 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2024-01-29 22:57:18,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:57:18,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:57:18,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:57:18,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:57:18,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:18" (1/1) ... [2024-01-29 22:57:18,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:18" (1/1) ... [2024-01-29 22:57:18,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:18" (1/1) ... [2024-01-29 22:57:18,424 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 22:57:18,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:18" (1/1) ... [2024-01-29 22:57:18,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:18" (1/1) ... [2024-01-29 22:57:18,430 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:18" (1/1) ... [2024-01-29 22:57:18,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:18" (1/1) ... [2024-01-29 22:57:18,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:18" (1/1) ... [2024-01-29 22:57:18,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:18" (1/1) ... [2024-01-29 22:57:18,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:57:18,440 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:57:18,440 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:57:18,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:57:18,441 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:18" (1/1) ... [2024-01-29 22:57:18,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:57:18,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:57:18,467 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 22:57:18,474 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 22:57:18,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:57:18,504 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 22:57:18,504 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 22:57:18,504 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 22:57:18,505 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 22:57:18,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:57:18,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:57:18,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:57:18,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:57:18,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:57:18,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:57:18,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:57:18,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:57:18,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:57:18,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 22:57:18,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 22:57:18,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 22:57:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:57:18,508 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 22:57:18,594 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:57:18,596 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:57:19,074 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:57:19,076 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:57:19,251 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:57:19,253 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-29 22:57:19,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:57:19 BoogieIcfgContainer [2024-01-29 22:57:19,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:57:19,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:57:19,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:57:19,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:57:19,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:57:16" (1/4) ... [2024-01-29 22:57:19,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9402cf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:57:19, skipping insertion in model container [2024-01-29 22:57:19,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:57:17" (2/4) ... [2024-01-29 22:57:19,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9402cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:57:19, skipping insertion in model container [2024-01-29 22:57:19,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:18" (3/4) ... [2024-01-29 22:57:19,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9402cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:57:19, skipping insertion in model container [2024-01-29 22:57:19,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:57:19" (4/4) ... [2024-01-29 22:57:19,264 INFO L112 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2024-01-29 22:57:19,279 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:57:19,279 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-01-29 22:57:19,280 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:57:19,334 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 22:57:19,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 135 transitions, 284 flow [2024-01-29 22:57:19,406 INFO L124 PetriNetUnfolderBase]: 3/133 cut-off events. [2024-01-29 22:57:19,406 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 22:57:19,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 133 events. 3/133 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 172 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2024-01-29 22:57:19,410 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 135 transitions, 284 flow [2024-01-29 22:57:19,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 132 transitions, 276 flow [2024-01-29 22:57:19,423 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:57:19,429 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;@1433c0fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:57:19,429 INFO L358 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2024-01-29 22:57:19,431 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:57:19,431 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:57:19,431 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:57:19,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:19,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:57:19,433 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 22:57:19,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:19,437 INFO L85 PathProgramCache]: Analyzing trace with hash 14330, now seen corresponding path program 1 times [2024-01-29 22:57:19,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:19,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205624286] [2024-01-29 22:57:19,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:19,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:19,697 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 22:57:19,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:19,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205624286] [2024-01-29 22:57:19,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205624286] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:19,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:19,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:19,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851020931] [2024-01-29 22:57:19,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:19,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:19,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:19,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:19,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:19,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 135 [2024-01-29 22:57:19,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 22:57:19,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:19,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 135 [2024-01-29 22:57:19,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:20,176 INFO L124 PetriNetUnfolderBase]: 149/419 cut-off events. [2024-01-29 22:57:20,177 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-29 22:57:20,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 419 events. 149/419 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2042 event pairs, 117 based on Foata normal form. 24/364 useless extension candidates. Maximal degree in co-relation 572. Up to 256 conditions per place. [2024-01-29 22:57:20,186 INFO L140 encePairwiseOnDemand]: 105/135 looper letters, 27 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2024-01-29 22:57:20,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 104 transitions, 278 flow [2024-01-29 22:57:20,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:20,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2024-01-29 22:57:20,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2024-01-29 22:57:20,214 INFO L175 Difference]: Start difference. First operand has 136 places, 132 transitions, 276 flow. Second operand 3 states and 288 transitions. [2024-01-29 22:57:20,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 104 transitions, 278 flow [2024-01-29 22:57:20,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 104 transitions, 270 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 22:57:20,225 INFO L231 Difference]: Finished difference. Result has 106 places, 104 transitions, 216 flow [2024-01-29 22:57:20,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=106, PETRI_TRANSITIONS=104} [2024-01-29 22:57:20,230 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -30 predicate places. [2024-01-29 22:57:20,230 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 104 transitions, 216 flow [2024-01-29 22:57:20,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 22:57:20,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:20,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 22:57:20,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:57:20,232 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 22:57:20,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:20,234 INFO L85 PathProgramCache]: Analyzing trace with hash 444645, now seen corresponding path program 1 times [2024-01-29 22:57:20,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:20,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157195166] [2024-01-29 22:57:20,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:20,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:20,398 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 22:57:20,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:20,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157195166] [2024-01-29 22:57:20,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157195166] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:20,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:20,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:20,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929982008] [2024-01-29 22:57:20,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:20,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:20,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:20,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:20,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:20,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 135 [2024-01-29 22:57:20,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 104 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 22:57:20,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:20,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 135 [2024-01-29 22:57:20,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:20,625 INFO L124 PetriNetUnfolderBase]: 130/377 cut-off events. [2024-01-29 22:57:20,625 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:57:20,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 377 events. 130/377 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1790 event pairs, 102 based on Foata normal form. 4/310 useless extension candidates. Maximal degree in co-relation 564. Up to 226 conditions per place. [2024-01-29 22:57:20,628 INFO L140 encePairwiseOnDemand]: 129/135 looper letters, 27 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2024-01-29 22:57:20,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 100 transitions, 266 flow [2024-01-29 22:57:20,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:20,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:20,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2024-01-29 22:57:20,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2024-01-29 22:57:20,630 INFO L175 Difference]: Start difference. First operand has 106 places, 104 transitions, 216 flow. Second operand 3 states and 264 transitions. [2024-01-29 22:57:20,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 100 transitions, 266 flow [2024-01-29 22:57:20,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 100 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:20,632 INFO L231 Difference]: Finished difference. Result has 102 places, 100 transitions, 208 flow [2024-01-29 22:57:20,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=102, PETRI_TRANSITIONS=100} [2024-01-29 22:57:20,633 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -34 predicate places. [2024-01-29 22:57:20,633 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 100 transitions, 208 flow [2024-01-29 22:57:20,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 22:57:20,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:20,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 22:57:20,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:57:20,634 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 22:57:20,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:20,634 INFO L85 PathProgramCache]: Analyzing trace with hash 427320310, now seen corresponding path program 1 times [2024-01-29 22:57:20,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:20,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346294527] [2024-01-29 22:57:20,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:20,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:20,706 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 22:57:20,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:20,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346294527] [2024-01-29 22:57:20,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346294527] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:20,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:20,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:20,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196465681] [2024-01-29 22:57:20,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:20,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:20,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:20,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:20,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:20,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 135 [2024-01-29 22:57:20,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 22:57:20,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:20,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 135 [2024-01-29 22:57:20,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:20,943 INFO L124 PetriNetUnfolderBase]: 171/449 cut-off events. [2024-01-29 22:57:20,944 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:57:20,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743 conditions, 449 events. 171/449 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2164 event pairs, 117 based on Foata normal form. 2/348 useless extension candidates. Maximal degree in co-relation 690. Up to 279 conditions per place. [2024-01-29 22:57:20,948 INFO L140 encePairwiseOnDemand]: 131/135 looper letters, 26 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2024-01-29 22:57:20,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 98 transitions, 260 flow [2024-01-29 22:57:20,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2024-01-29 22:57:20,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-01-29 22:57:20,951 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 208 flow. Second operand 3 states and 270 transitions. [2024-01-29 22:57:20,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 98 transitions, 260 flow [2024-01-29 22:57:20,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 98 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:20,955 INFO L231 Difference]: Finished difference. Result has 100 places, 98 transitions, 204 flow [2024-01-29 22:57:20,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=100, PETRI_TRANSITIONS=98} [2024-01-29 22:57:20,956 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -36 predicate places. [2024-01-29 22:57:20,956 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 98 transitions, 204 flow [2024-01-29 22:57:20,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 22:57:20,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:20,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:20,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:57:20,957 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 22:57:20,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:20,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1662026362, now seen corresponding path program 1 times [2024-01-29 22:57:20,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:20,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937823397] [2024-01-29 22:57:20,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:20,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:21,057 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 22:57:21,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:21,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937823397] [2024-01-29 22:57:21,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937823397] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:21,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:21,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:21,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204826194] [2024-01-29 22:57:21,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:21,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:21,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:21,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:21,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:21,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 135 [2024-01-29 22:57:21,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 98 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 22:57:21,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:21,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 135 [2024-01-29 22:57:21,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:21,284 INFO L124 PetriNetUnfolderBase]: 130/372 cut-off events. [2024-01-29 22:57:21,285 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:57:21,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 372 events. 130/372 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1772 event pairs, 102 based on Foata normal form. 3/311 useless extension candidates. Maximal degree in co-relation 581. Up to 225 conditions per place. [2024-01-29 22:57:21,287 INFO L140 encePairwiseOnDemand]: 130/135 looper letters, 25 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2024-01-29 22:57:21,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 95 transitions, 252 flow [2024-01-29 22:57:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2024-01-29 22:57:21,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-01-29 22:57:21,289 INFO L175 Difference]: Start difference. First operand has 100 places, 98 transitions, 204 flow. Second operand 3 states and 270 transitions. [2024-01-29 22:57:21,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 95 transitions, 252 flow [2024-01-29 22:57:21,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 95 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:21,291 INFO L231 Difference]: Finished difference. Result has 97 places, 95 transitions, 198 flow [2024-01-29 22:57:21,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=97, PETRI_TRANSITIONS=95} [2024-01-29 22:57:21,292 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -39 predicate places. [2024-01-29 22:57:21,292 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 95 transitions, 198 flow [2024-01-29 22:57:21,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 22:57:21,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:21,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:21,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:57:21,293 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 22:57:21,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:21,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1999776076, now seen corresponding path program 1 times [2024-01-29 22:57:21,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:21,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425425972] [2024-01-29 22:57:21,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:21,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:21,351 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 22:57:21,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:21,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425425972] [2024-01-29 22:57:21,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425425972] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:21,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:21,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:21,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161102209] [2024-01-29 22:57:21,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:21,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:21,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:21,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:21,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:21,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 135 [2024-01-29 22:57:21,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 95 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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 22:57:21,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:21,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 135 [2024-01-29 22:57:21,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:21,525 INFO L124 PetriNetUnfolderBase]: 151/394 cut-off events. [2024-01-29 22:57:21,525 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-29 22:57:21,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 394 events. 151/394 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1921 event pairs, 123 based on Foata normal form. 1/314 useless extension candidates. Maximal degree in co-relation 631. Up to 264 conditions per place. [2024-01-29 22:57:21,528 INFO L140 encePairwiseOnDemand]: 132/135 looper letters, 26 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-01-29 22:57:21,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 252 flow [2024-01-29 22:57:21,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:21,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:21,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2024-01-29 22:57:21,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.671604938271605 [2024-01-29 22:57:21,530 INFO L175 Difference]: Start difference. First operand has 97 places, 95 transitions, 198 flow. Second operand 3 states and 272 transitions. [2024-01-29 22:57:21,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 252 flow [2024-01-29 22:57:21,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 94 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:21,532 INFO L231 Difference]: Finished difference. Result has 96 places, 94 transitions, 196 flow [2024-01-29 22:57:21,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=96, PETRI_TRANSITIONS=94} [2024-01-29 22:57:21,533 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -40 predicate places. [2024-01-29 22:57:21,533 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 94 transitions, 196 flow [2024-01-29 22:57:21,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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 22:57:21,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:21,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:21,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:57:21,534 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 22:57:21,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:21,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1464371169, now seen corresponding path program 1 times [2024-01-29 22:57:21,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:21,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392364840] [2024-01-29 22:57:21,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:21,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:21,610 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 22:57:21,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:21,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392364840] [2024-01-29 22:57:21,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392364840] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:21,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:21,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:21,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616585266] [2024-01-29 22:57:21,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:21,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:21,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:21,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:21,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:21,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 135 [2024-01-29 22:57:21,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 94 transitions, 196 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 22:57:21,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:21,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 135 [2024-01-29 22:57:21,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:21,823 INFO L124 PetriNetUnfolderBase]: 232/640 cut-off events. [2024-01-29 22:57:21,823 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:57:21,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 640 events. 232/640 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3648 event pairs, 87 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 1035. Up to 205 conditions per place. [2024-01-29 22:57:21,828 INFO L140 encePairwiseOnDemand]: 130/135 looper letters, 49 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2024-01-29 22:57:21,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 110 transitions, 337 flow [2024-01-29 22:57:21,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2024-01-29 22:57:21,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2024-01-29 22:57:21,830 INFO L175 Difference]: Start difference. First operand has 96 places, 94 transitions, 196 flow. Second operand 3 states and 345 transitions. [2024-01-29 22:57:21,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 110 transitions, 337 flow [2024-01-29 22:57:21,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 110 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:21,833 INFO L231 Difference]: Finished difference. Result has 97 places, 95 transitions, 214 flow [2024-01-29 22:57:21,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=97, PETRI_TRANSITIONS=95} [2024-01-29 22:57:21,836 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -39 predicate places. [2024-01-29 22:57:21,836 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 95 transitions, 214 flow [2024-01-29 22:57:21,837 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 22:57:21,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:21,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:21,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 22:57:21,838 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 22:57:21,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:21,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1849133514, now seen corresponding path program 1 times [2024-01-29 22:57:21,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:21,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579711605] [2024-01-29 22:57:21,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:21,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:21,955 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 22:57:21,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:21,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579711605] [2024-01-29 22:57:21,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579711605] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:21,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:21,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:57:21,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21476455] [2024-01-29 22:57:21,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:21,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:57:21,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:21,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:57:21,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:57:22,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 135 [2024-01-29 22:57:22,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 95 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 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 22:57:22,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:22,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 135 [2024-01-29 22:57:22,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:22,363 INFO L124 PetriNetUnfolderBase]: 423/1047 cut-off events. [2024-01-29 22:57:22,363 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2024-01-29 22:57:22,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1915 conditions, 1047 events. 423/1047 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6330 event pairs, 117 based on Foata normal form. 1/915 useless extension candidates. Maximal degree in co-relation 409. Up to 290 conditions per place. [2024-01-29 22:57:22,370 INFO L140 encePairwiseOnDemand]: 126/135 looper letters, 78 selfloop transitions, 7 changer transitions 0/128 dead transitions. [2024-01-29 22:57:22,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 128 transitions, 462 flow [2024-01-29 22:57:22,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:57:22,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:57:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2024-01-29 22:57:22,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7451851851851852 [2024-01-29 22:57:22,372 INFO L175 Difference]: Start difference. First operand has 97 places, 95 transitions, 214 flow. Second operand 5 states and 503 transitions. [2024-01-29 22:57:22,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 128 transitions, 462 flow [2024-01-29 22:57:22,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 128 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:22,375 INFO L231 Difference]: Finished difference. Result has 99 places, 96 transitions, 237 flow [2024-01-29 22:57:22,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=99, PETRI_TRANSITIONS=96} [2024-01-29 22:57:22,376 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -37 predicate places. [2024-01-29 22:57:22,376 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 96 transitions, 237 flow [2024-01-29 22:57:22,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 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 22:57:22,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:22,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:22,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 22:57:22,377 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 22:57:22,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:22,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1099167388, now seen corresponding path program 1 times [2024-01-29 22:57:22,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:22,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032798097] [2024-01-29 22:57:22,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:22,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:22,454 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 22:57:22,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:22,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032798097] [2024-01-29 22:57:22,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032798097] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:22,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:22,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:57:22,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216458334] [2024-01-29 22:57:22,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:22,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:57:22,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:22,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:57:22,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:57:22,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 135 [2024-01-29 22:57:22,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 96 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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 22:57:22,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:22,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 135 [2024-01-29 22:57:22,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:22,706 INFO L124 PetriNetUnfolderBase]: 696/1677 cut-off events. [2024-01-29 22:57:22,707 INFO L125 PetriNetUnfolderBase]: For 701/735 co-relation queries the response was YES. [2024-01-29 22:57:22,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3403 conditions, 1677 events. 696/1677 cut-off events. For 701/735 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 11489 event pairs, 136 based on Foata normal form. 38/1578 useless extension candidates. Maximal degree in co-relation 980. Up to 487 conditions per place. [2024-01-29 22:57:22,718 INFO L140 encePairwiseOnDemand]: 124/135 looper letters, 70 selfloop transitions, 11 changer transitions 1/132 dead transitions. [2024-01-29 22:57:22,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 132 transitions, 529 flow [2024-01-29 22:57:22,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:57:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:57:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2024-01-29 22:57:22,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8296296296296296 [2024-01-29 22:57:22,720 INFO L175 Difference]: Start difference. First operand has 99 places, 96 transitions, 237 flow. Second operand 4 states and 448 transitions. [2024-01-29 22:57:22,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 132 transitions, 529 flow [2024-01-29 22:57:22,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 132 transitions, 517 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:22,726 INFO L231 Difference]: Finished difference. Result has 100 places, 100 transitions, 320 flow [2024-01-29 22:57:22,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=320, PETRI_PLACES=100, PETRI_TRANSITIONS=100} [2024-01-29 22:57:22,730 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -36 predicate places. [2024-01-29 22:57:22,730 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 100 transitions, 320 flow [2024-01-29 22:57:22,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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 22:57:22,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:22,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:22,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 22:57:22,731 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 22:57:22,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:22,732 INFO L85 PathProgramCache]: Analyzing trace with hash 656019219, now seen corresponding path program 1 times [2024-01-29 22:57:22,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:22,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066497431] [2024-01-29 22:57:22,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:22,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:22,891 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 22:57:22,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:22,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066497431] [2024-01-29 22:57:22,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066497431] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:22,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:22,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:57:22,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300464129] [2024-01-29 22:57:22,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:22,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:57:22,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:22,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:57:22,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:57:22,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 135 [2024-01-29 22:57:22,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 100 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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 22:57:22,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:22,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 135 [2024-01-29 22:57:22,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:23,078 INFO L124 PetriNetUnfolderBase]: 646/1526 cut-off events. [2024-01-29 22:57:23,079 INFO L125 PetriNetUnfolderBase]: For 1388/1394 co-relation queries the response was YES. [2024-01-29 22:57:23,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3370 conditions, 1526 events. 646/1526 cut-off events. For 1388/1394 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9960 event pairs, 222 based on Foata normal form. 195/1631 useless extension candidates. Maximal degree in co-relation 1378. Up to 1010 conditions per place. [2024-01-29 22:57:23,089 INFO L140 encePairwiseOnDemand]: 126/135 looper letters, 42 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2024-01-29 22:57:23,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 101 transitions, 421 flow [2024-01-29 22:57:23,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:57:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:57:23,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 441 transitions. [2024-01-29 22:57:23,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2024-01-29 22:57:23,091 INFO L175 Difference]: Start difference. First operand has 100 places, 100 transitions, 320 flow. Second operand 4 states and 441 transitions. [2024-01-29 22:57:23,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 101 transitions, 421 flow [2024-01-29 22:57:23,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 101 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-29 22:57:23,095 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 310 flow [2024-01-29 22:57:23,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2024-01-29 22:57:23,096 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -40 predicate places. [2024-01-29 22:57:23,096 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 310 flow [2024-01-29 22:57:23,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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 22:57:23,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:23,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:23,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 22:57:23,097 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 22:57:23,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:23,098 INFO L85 PathProgramCache]: Analyzing trace with hash -926475597, now seen corresponding path program 1 times [2024-01-29 22:57:23,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:23,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33784136] [2024-01-29 22:57:23,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:23,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:23,295 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 22:57:23,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:23,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33784136] [2024-01-29 22:57:23,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33784136] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:23,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:23,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:57:23,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339613045] [2024-01-29 22:57:23,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:23,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:57:23,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:23,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:57:23,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:57:23,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 135 [2024-01-29 22:57:23,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 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 22:57:23,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:23,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 135 [2024-01-29 22:57:23,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:23,477 INFO L124 PetriNetUnfolderBase]: 669/1374 cut-off events. [2024-01-29 22:57:23,477 INFO L125 PetriNetUnfolderBase]: For 1275/1289 co-relation queries the response was YES. [2024-01-29 22:57:23,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3169 conditions, 1374 events. 669/1374 cut-off events. For 1275/1289 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8131 event pairs, 79 based on Foata normal form. 195/1521 useless extension candidates. Maximal degree in co-relation 3093. Up to 900 conditions per place. [2024-01-29 22:57:23,484 INFO L140 encePairwiseOnDemand]: 128/135 looper letters, 59 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2024-01-29 22:57:23,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 113 transitions, 545 flow [2024-01-29 22:57:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:57:23,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:57:23,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 455 transitions. [2024-01-29 22:57:23,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8425925925925926 [2024-01-29 22:57:23,486 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 310 flow. Second operand 4 states and 455 transitions. [2024-01-29 22:57:23,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 113 transitions, 545 flow [2024-01-29 22:57:23,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 113 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:23,490 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 301 flow [2024-01-29 22:57:23,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2024-01-29 22:57:23,490 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -44 predicate places. [2024-01-29 22:57:23,491 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 301 flow [2024-01-29 22:57:23,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 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 22:57:23,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:23,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:23,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 22:57:23,492 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 22:57:23,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:23,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1658948107, now seen corresponding path program 1 times [2024-01-29 22:57:23,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:23,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175505549] [2024-01-29 22:57:23,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:23,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:23,715 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 22:57:23,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:23,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175505549] [2024-01-29 22:57:23,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175505549] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:23,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:23,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-29 22:57:23,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221667287] [2024-01-29 22:57:23,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:23,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:57:23,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:23,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:57:23,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:57:24,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 135 [2024-01-29 22:57:24,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 301 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 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 22:57:24,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:24,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 135 [2024-01-29 22:57:24,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:24,804 INFO L124 PetriNetUnfolderBase]: 1462/2853 cut-off events. [2024-01-29 22:57:24,804 INFO L125 PetriNetUnfolderBase]: For 3104/3124 co-relation queries the response was YES. [2024-01-29 22:57:24,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7149 conditions, 2853 events. 1462/2853 cut-off events. For 3104/3124 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17330 event pairs, 185 based on Foata normal form. 34/2852 useless extension candidates. Maximal degree in co-relation 7055. Up to 834 conditions per place. [2024-01-29 22:57:24,821 INFO L140 encePairwiseOnDemand]: 125/135 looper letters, 139 selfloop transitions, 18 changer transitions 1/187 dead transitions. [2024-01-29 22:57:24,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 187 transitions, 1020 flow [2024-01-29 22:57:24,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-29 22:57:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-29 22:57:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 815 transitions. [2024-01-29 22:57:24,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7546296296296297 [2024-01-29 22:57:24,825 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 301 flow. Second operand 8 states and 815 transitions. [2024-01-29 22:57:24,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 187 transitions, 1020 flow [2024-01-29 22:57:24,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 187 transitions, 1007 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:24,829 INFO L231 Difference]: Finished difference. Result has 104 places, 101 transitions, 486 flow [2024-01-29 22:57:24,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=486, PETRI_PLACES=104, PETRI_TRANSITIONS=101} [2024-01-29 22:57:24,830 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -32 predicate places. [2024-01-29 22:57:24,830 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 101 transitions, 486 flow [2024-01-29 22:57:24,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 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 22:57:24,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:24,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:24,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 22:57:24,832 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 22:57:24,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:24,833 INFO L85 PathProgramCache]: Analyzing trace with hash -150781515, now seen corresponding path program 2 times [2024-01-29 22:57:24,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:24,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030089665] [2024-01-29 22:57:24,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:24,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:25,099 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 22:57:25,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:25,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030089665] [2024-01-29 22:57:25,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030089665] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:25,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:25,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-29 22:57:25,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893621107] [2024-01-29 22:57:25,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:25,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:57:25,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:25,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:57:25,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:57:25,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 135 [2024-01-29 22:57:25,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 101 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 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 22:57:25,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:25,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 135 [2024-01-29 22:57:25,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:26,391 INFO L124 PetriNetUnfolderBase]: 1798/3475 cut-off events. [2024-01-29 22:57:26,392 INFO L125 PetriNetUnfolderBase]: For 7106/7173 co-relation queries the response was YES. [2024-01-29 22:57:26,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9884 conditions, 3475 events. 1798/3475 cut-off events. For 7106/7173 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 21990 event pairs, 171 based on Foata normal form. 32/3460 useless extension candidates. Maximal degree in co-relation 9778. Up to 1021 conditions per place. [2024-01-29 22:57:26,418 INFO L140 encePairwiseOnDemand]: 124/135 looper letters, 126 selfloop transitions, 38 changer transitions 2/195 dead transitions. [2024-01-29 22:57:26,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 195 transitions, 1218 flow [2024-01-29 22:57:26,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-29 22:57:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-29 22:57:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 820 transitions. [2024-01-29 22:57:26,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7592592592592593 [2024-01-29 22:57:26,421 INFO L175 Difference]: Start difference. First operand has 104 places, 101 transitions, 486 flow. Second operand 8 states and 820 transitions. [2024-01-29 22:57:26,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 195 transitions, 1218 flow [2024-01-29 22:57:26,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 195 transitions, 1212 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-01-29 22:57:26,440 INFO L231 Difference]: Finished difference. Result has 116 places, 118 transitions, 805 flow [2024-01-29 22:57:26,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=805, PETRI_PLACES=116, PETRI_TRANSITIONS=118} [2024-01-29 22:57:26,441 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -20 predicate places. [2024-01-29 22:57:26,441 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 118 transitions, 805 flow [2024-01-29 22:57:26,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 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 22:57:26,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:26,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:26,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 22:57:26,443 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 22:57:26,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:26,443 INFO L85 PathProgramCache]: Analyzing trace with hash -989572641, now seen corresponding path program 3 times [2024-01-29 22:57:26,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:26,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682393785] [2024-01-29 22:57:26,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:26,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:26,682 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 22:57:26,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:26,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682393785] [2024-01-29 22:57:26,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682393785] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:26,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:26,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-29 22:57:26,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882787769] [2024-01-29 22:57:26,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:26,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:57:26,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:26,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:57:26,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:57:26,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 135 [2024-01-29 22:57:26,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 118 transitions, 805 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 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 22:57:26,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:26,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 135 [2024-01-29 22:57:26,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:27,705 INFO L124 PetriNetUnfolderBase]: 2170/4195 cut-off events. [2024-01-29 22:57:27,705 INFO L125 PetriNetUnfolderBase]: For 15772/15893 co-relation queries the response was YES. [2024-01-29 22:57:27,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13413 conditions, 4195 events. 2170/4195 cut-off events. For 15772/15893 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 28133 event pairs, 279 based on Foata normal form. 68/4210 useless extension candidates. Maximal degree in co-relation 13294. Up to 1197 conditions per place. [2024-01-29 22:57:27,747 INFO L140 encePairwiseOnDemand]: 124/135 looper letters, 132 selfloop transitions, 51 changer transitions 1/213 dead transitions. [2024-01-29 22:57:27,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 213 transitions, 1656 flow [2024-01-29 22:57:27,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-29 22:57:27,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-29 22:57:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 821 transitions. [2024-01-29 22:57:27,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7601851851851852 [2024-01-29 22:57:27,751 INFO L175 Difference]: Start difference. First operand has 116 places, 118 transitions, 805 flow. Second operand 8 states and 821 transitions. [2024-01-29 22:57:27,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 213 transitions, 1656 flow [2024-01-29 22:57:27,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 213 transitions, 1630 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-01-29 22:57:27,789 INFO L231 Difference]: Finished difference. Result has 127 places, 137 transitions, 1217 flow [2024-01-29 22:57:27,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1217, PETRI_PLACES=127, PETRI_TRANSITIONS=137} [2024-01-29 22:57:27,790 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -9 predicate places. [2024-01-29 22:57:27,791 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 137 transitions, 1217 flow [2024-01-29 22:57:27,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 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 22:57:27,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:27,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:27,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 22:57:27,793 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-29 22:57:27,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:27,793 INFO L85 PathProgramCache]: Analyzing trace with hash 603254019, now seen corresponding path program 1 times [2024-01-29 22:57:27,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:27,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679128052] [2024-01-29 22:57:27,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:27,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:57:27,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 22:57:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:57:27,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 22:57:27,865 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 22:57:27,866 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 73 remaining) [2024-01-29 22:57:27,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 73 remaining) [2024-01-29 22:57:27,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 73 remaining) [2024-01-29 22:57:27,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 73 remaining) [2024-01-29 22:57:27,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 73 remaining) [2024-01-29 22:57:27,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 73 remaining) [2024-01-29 22:57:27,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 73 remaining) [2024-01-29 22:57:27,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 73 remaining) [2024-01-29 22:57:27,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 73 remaining) [2024-01-29 22:57:27,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 73 remaining) [2024-01-29 22:57:27,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 73 remaining) [2024-01-29 22:57:27,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 73 remaining) [2024-01-29 22:57:27,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 73 remaining) [2024-01-29 22:57:27,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 73 remaining) [2024-01-29 22:57:27,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 73 remaining) [2024-01-29 22:57:27,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 73 remaining) [2024-01-29 22:57:27,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 73 remaining) [2024-01-29 22:57:27,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 73 remaining) [2024-01-29 22:57:27,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 73 remaining) [2024-01-29 22:57:27,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 73 remaining) [2024-01-29 22:57:27,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 73 remaining) [2024-01-29 22:57:27,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 73 remaining) [2024-01-29 22:57:27,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 73 remaining) [2024-01-29 22:57:27,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 73 remaining) [2024-01-29 22:57:27,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 73 remaining) [2024-01-29 22:57:27,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 73 remaining) [2024-01-29 22:57:27,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 73 remaining) [2024-01-29 22:57:27,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 73 remaining) [2024-01-29 22:57:27,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 73 remaining) [2024-01-29 22:57:27,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 73 remaining) [2024-01-29 22:57:27,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 73 remaining) [2024-01-29 22:57:27,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 73 remaining) [2024-01-29 22:57:27,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 73 remaining) [2024-01-29 22:57:27,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 73 remaining) [2024-01-29 22:57:27,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 73 remaining) [2024-01-29 22:57:27,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 73 remaining) [2024-01-29 22:57:27,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 73 remaining) [2024-01-29 22:57:27,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 73 remaining) [2024-01-29 22:57:27,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 73 remaining) [2024-01-29 22:57:27,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 73 remaining) [2024-01-29 22:57:27,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 73 remaining) [2024-01-29 22:57:27,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 73 remaining) [2024-01-29 22:57:27,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 73 remaining) [2024-01-29 22:57:27,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 73 remaining) [2024-01-29 22:57:27,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 73 remaining) [2024-01-29 22:57:27,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 73 remaining) [2024-01-29 22:57:27,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 73 remaining) [2024-01-29 22:57:27,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 73 remaining) [2024-01-29 22:57:27,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 73 remaining) [2024-01-29 22:57:27,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 73 remaining) [2024-01-29 22:57:27,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 73 remaining) [2024-01-29 22:57:27,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 73 remaining) [2024-01-29 22:57:27,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 73 remaining) [2024-01-29 22:57:27,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 73 remaining) [2024-01-29 22:57:27,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 73 remaining) [2024-01-29 22:57:27,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 73 remaining) [2024-01-29 22:57:27,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 73 remaining) [2024-01-29 22:57:27,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 73 remaining) [2024-01-29 22:57:27,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION (14 of 73 remaining) [2024-01-29 22:57:27,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 73 remaining) [2024-01-29 22:57:27,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 73 remaining) [2024-01-29 22:57:27,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 73 remaining) [2024-01-29 22:57:27,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 73 remaining) [2024-01-29 22:57:27,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 73 remaining) [2024-01-29 22:57:27,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 73 remaining) [2024-01-29 22:57:27,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 73 remaining) [2024-01-29 22:57:27,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 73 remaining) [2024-01-29 22:57:27,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 73 remaining) [2024-01-29 22:57:27,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 73 remaining) [2024-01-29 22:57:27,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 73 remaining) [2024-01-29 22:57:27,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 73 remaining) [2024-01-29 22:57:27,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 73 remaining) [2024-01-29 22:57:27,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 73 remaining) [2024-01-29 22:57:27,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 22:57:27,885 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:27,893 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 22:57:27,893 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 22:57:27,965 INFO L503 ceAbstractionStarter]: Automizer considered 57 witness invariants [2024-01-29 22:57:27,965 INFO L504 ceAbstractionStarter]: WitnessConsidered=57 [2024-01-29 22:57:27,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:57:27 BasicIcfg [2024-01-29 22:57:27,966 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 22:57:27,967 INFO L158 Benchmark]: Toolchain (without parser) took 10043.77ms. Allocated memory was 151.0MB in the beginning and 406.8MB in the end (delta: 255.9MB). Free memory was 118.0MB in the beginning and 300.7MB in the end (delta: -182.7MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. [2024-01-29 22:57:27,967 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 151.0MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:57:27,967 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:57:27,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.84ms. Allocated memory is still 151.0MB. Free memory was 117.8MB in the beginning and 98.5MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-01-29 22:57:27,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.39ms. Allocated memory is still 151.0MB. Free memory was 98.5MB in the beginning and 96.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 22:57:27,968 INFO L158 Benchmark]: Boogie Preprocessor took 58.76ms. Allocated memory is still 151.0MB. Free memory was 96.1MB in the beginning and 93.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 22:57:27,968 INFO L158 Benchmark]: RCFGBuilder took 813.60ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 93.8MB in the beginning and 127.6MB in the end (delta: -33.9MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2024-01-29 22:57:27,969 INFO L158 Benchmark]: TraceAbstraction took 8709.37ms. Allocated memory was 182.5MB in the beginning and 406.8MB in the end (delta: 224.4MB). Free memory was 126.4MB in the beginning and 300.7MB in the end (delta: -174.3MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2024-01-29 22:57:27,970 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.21ms. Allocated memory is still 151.0MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.84ms. Allocated memory is still 151.0MB. Free memory was 117.8MB in the beginning and 98.5MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.39ms. Allocated memory is still 151.0MB. Free memory was 98.5MB in the beginning and 96.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.76ms. Allocated memory is still 151.0MB. Free memory was 96.1MB in the beginning and 93.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 813.60ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 93.8MB in the beginning and 127.6MB in the end (delta: -33.9MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8709.37ms. Allocated memory was 182.5MB in the beginning and 406.8MB in the end (delta: 224.4MB). Free memory was 126.4MB in the beginning and 300.7MB in the end (delta: -174.3MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 41]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L36] 0 int n, m, i1, i2, j1; [L37] 0 unsigned int k1, k2; [L60] 0 pthread_t t1, t2; VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[m],IntegerLiteral[0]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i1],IntegerLiteral[0]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]]] [L63] 0 n = __VERIFIER_nondet_int() [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[m],IntegerLiteral[0]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[i1],IntegerLiteral[0]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] [L64] 0 m = __VERIFIER_nondet_int() [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i1],IntegerLiteral[0]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]]] [L65] 0 i1 = __VERIFIER_nondet_int() [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]]]] [L66] 0 i2 = __VERIFIER_nondet_int() [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]]]] [L67] 0 j1 = __VERIFIER_nondet_int() [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]],BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]]] [L68] 0 k1 = __VERIFIER_nondet_uint() [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] [L69] 0 k2 = __VERIFIER_nondet_uint() [L72] CALL 0 assume_abort_if_not( i1 == i2 && i1 == k1 && i1 == k2 && i1 == 0 ) [L33] COND FALSE 0 !(!cond) [L72] RET 0 assume_abort_if_not( i1 == i2 && i1 == k1 && i1 == k2 && i1 == 0 ) [L73] CALL 0 assume_abort_if_not( m >= 0 ) [L33] COND FALSE 0 !(!cond) [L73] RET 0 assume_abort_if_not( m >= 0 ) [L75] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [_argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L76] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [_argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L40] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L40] COND TRUE 1 i1 < n [L41] 1 j1 = 0 VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L51] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L51] COND TRUE 2 i2 < n VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L52] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] [L52] 2 k2 = k2 + m VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=1, m=1, n=1] [L41] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=1, m=1, n=1] [L41] COND TRUE 1 j1 < m VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=1, m=1, n=1] [L42] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] [L42] 1 k1++ [L41] 1 j1++ VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=1, m=1, n=1] [L41] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=1, m=1, n=1] [L41] COND FALSE 1 !(j1 < m) VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=1, m=1, n=1] [L41] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=1, m=1, n=1] - UnprovableResult [Line: 40]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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: 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: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 76]: 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: 75]: 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, 73 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3528 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2160 mSDsluCounter, 1020 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 674 mSDsCounter, 310 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3883 IncrementalHoareTripleChecker+Invalid, 4193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 310 mSolverCounterUnsat, 346 mSDtfsCounter, 3883 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1217occurred in iteration=13, InterpolantAutomatonStates: 59, 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.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 485 NumberOfCodeBlocks, 485 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 2756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 22:57:28,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE