./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-file-item-subst.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-file-item-subst.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ab2e0ac4 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/chl-file-item-subst.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-file-item-subst.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-ab2e0ac-m [2024-01-29 14:17:40,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 14:17:40,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 14:17:40,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 14:17:40,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 14:17:40,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 14:17:40,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 14:17:40,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 14:17:40,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 14:17:40,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 14:17:40,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 14:17:40,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 14:17:40,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 14:17:40,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 14:17:40,950 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 14:17:40,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 14:17:40,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 14:17:40,951 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 14:17:40,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 14:17:40,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 14:17:40,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 14:17:40,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 14:17:40,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 14:17:40,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 14:17:40,953 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 14:17:40,953 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 14:17:40,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 14:17:40,954 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 14:17:40,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 14:17:40,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 14:17:40,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 14:17:40,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 14:17:40,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:17:40,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 14:17:40,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 14:17:40,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 14:17:40,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 14:17:40,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 14:17:40,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 14:17:40,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 14:17:40,957 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 14:17:40,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 14:17:40,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 14:17:40,957 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 14:17:41,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 14:17:41,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 14:17:41,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 14:17:41,243 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 14:17:41,244 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 14:17:41,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-file-item-subst.wvr.c [2024-01-29 14:17:42,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 14:17:42,411 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 14:17:42,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-subst.wvr.c [2024-01-29 14:17:42,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5beb612bc/f27f55acb2c04322a6d8a0451a22f7e0/FLAG492e2d5eb [2024-01-29 14:17:42,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5beb612bc/f27f55acb2c04322a6d8a0451a22f7e0 [2024-01-29 14:17:42,429 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 14:17:42,429 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 14:17:42,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-file-item-subst.wvr.yml/witness.yml [2024-01-29 14:17:42,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 14:17:42,525 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 14:17:42,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 14:17:42,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 14:17:42,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 14:17:42,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:17:42" (1/2) ... [2024-01-29 14:17:42,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15abd75f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:42, skipping insertion in model container [2024-01-29 14:17:42,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:17:42" (1/2) ... [2024-01-29 14:17:42,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4bc86544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:42, skipping insertion in model container [2024-01-29 14:17:42,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:17:42" (2/2) ... [2024-01-29 14:17:42,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15abd75f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:42, skipping insertion in model container [2024-01-29 14:17:42,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:17:42" (2/2) ... [2024-01-29 14:17:42,532 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 14:17:42,550 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 14:17:42,551 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-29 14:17:42,551 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] filename_is_null_8 == (_Bool)0 [2024-01-29 14:17:42,551 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] filename_is_null_5 == (_Bool)0 || filename_is_null_5 == (_Bool)1 [2024-01-29 14:17:42,552 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] is_null_3 == (_Bool)0 || is_null_3 == (_Bool)1 [2024-01-29 14:17:42,552 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_9 == 0 [2024-01-29 14:17:42,552 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_10 == 0 [2024-01-29 14:17:42,552 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] is_null_6 == (_Bool)0 || is_null_6 == (_Bool)1 [2024-01-29 14:17:42,552 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1 [2024-01-29 14:17:42,552 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] filename_is_null_2 == (_Bool)0 || filename_is_null_2 == (_Bool)1 [2024-01-29 14:17:42,552 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_11 == 0 [2024-01-29 14:17:42,553 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] result_11 == 0 [2024-01-29 14:17:42,553 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] filename_is_null_2 == (_Bool)0 || filename_is_null_2 == (_Bool)1 [2024-01-29 14:17:42,553 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] filename_is_null_8 == (_Bool)0 [2024-01-29 14:17:42,553 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] result_10 == 0 [2024-01-29 14:17:42,553 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] is_null_3 == (_Bool)0 || is_null_3 == (_Bool)1 [2024-01-29 14:17:42,553 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1 [2024-01-29 14:17:42,553 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] val == (_Bool)0 || val == (_Bool)1 [2024-01-29 14:17:42,553 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] filename_is_null_5 == (_Bool)0 || filename_is_null_5 == (_Bool)1 [2024-01-29 14:17:42,554 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] result_9 == 0 [2024-01-29 14:17:42,554 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] is_null_6 == (_Bool)0 || is_null_6 == (_Bool)1 [2024-01-29 14:17:42,554 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_9 == 0 [2024-01-29 14:17:42,554 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] filename_7 == 0 [2024-01-29 14:17:42,554 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_10 == 0 [2024-01-29 14:17:42,554 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] is_null_0 == (_Bool)0 [2024-01-29 14:17:42,554 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] is_null_6 == (_Bool)0 [2024-01-29 14:17:42,554 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] filename_is_null_5 == (_Bool)0 [2024-01-29 14:17:42,555 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] is_null_3 == (_Bool)0 [2024-01-29 14:17:42,555 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] filename_is_null_2 == (_Bool)0 [2024-01-29 14:17:42,555 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_11 == 0 [2024-01-29 14:17:42,555 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] filename_is_null_8 == (_Bool)0 [2024-01-29 14:17:42,555 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] is_null_6 == (_Bool)0 || is_null_6 == (_Bool)1 [2024-01-29 14:17:42,555 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] result_10 == 0 [2024-01-29 14:17:42,555 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] filename_is_null_5 == (_Bool)0 [2024-01-29 14:17:42,556 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] filename_is_null_2 == (_Bool)0 || filename_is_null_2 == (_Bool)1 [2024-01-29 14:17:42,556 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] result_9 == 0 [2024-01-29 14:17:42,556 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] is_null_3 == (_Bool)0 || is_null_3 == (_Bool)1 [2024-01-29 14:17:42,556 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] filename_is_null_8 == (_Bool)0 [2024-01-29 14:17:42,556 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] result_11 == 0 [2024-01-29 14:17:42,556 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1 [2024-01-29 14:17:42,556 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-29 14:17:42,556 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] 1 <= b [2024-01-29 14:17:42,557 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] b != 0 [2024-01-29 14:17:42,557 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_10 == 0 [2024-01-29 14:17:42,557 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] filename_is_null_2 == (_Bool)0 [2024-01-29 14:17:42,557 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] filename_is_null_5 == (_Bool)0 [2024-01-29 14:17:42,557 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1 [2024-01-29 14:17:42,557 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] filename_is_null_8 == (_Bool)0 [2024-01-29 14:17:42,557 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] is_null_6 == (_Bool)0 [2024-01-29 14:17:42,557 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_11 == 0 [2024-01-29 14:17:42,558 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_9 == 0 [2024-01-29 14:17:42,558 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] is_null_3 == (_Bool)0 || is_null_3 == (_Bool)1 [2024-01-29 14:17:42,558 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] filename_is_null_2 == (_Bool)0 [2024-01-29 14:17:42,558 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] is_null_0 == (_Bool)0 [2024-01-29 14:17:42,558 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_11 == 0 [2024-01-29 14:17:42,558 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] is_null_6 == (_Bool)0 [2024-01-29 14:17:42,558 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] filename_is_null_5 == (_Bool)0 [2024-01-29 14:17:42,559 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] filename_7 == 0 [2024-01-29 14:17:42,559 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_10 == 0 [2024-01-29 14:17:42,559 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_9 == 0 [2024-01-29 14:17:42,559 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] is_null_3 == (_Bool)0 [2024-01-29 14:17:42,559 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] filename_is_null_8 == (_Bool)0 [2024-01-29 14:17:42,559 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] result_10 == 0 [2024-01-29 14:17:42,559 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] result_9 == 0 [2024-01-29 14:17:42,560 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] is_null_6 == (_Bool)0 || is_null_6 == (_Bool)1 [2024-01-29 14:17:42,560 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] result_11 == 0 [2024-01-29 14:17:42,560 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] filename_is_null_2 == (_Bool)0 [2024-01-29 14:17:42,560 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] is_null_3 == (_Bool)0 || is_null_3 == (_Bool)1 [2024-01-29 14:17:42,560 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] filename_is_null_5 == (_Bool)0 [2024-01-29 14:17:42,560 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] filename_is_null_8 == (_Bool)0 [2024-01-29 14:17:42,560 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1 [2024-01-29 14:17:42,560 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] filename_4 == 0 [2024-01-29 14:17:42,561 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_10 == 0 [2024-01-29 14:17:42,561 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_11 == 0 [2024-01-29 14:17:42,561 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] is_null_6 == (_Bool)0 [2024-01-29 14:17:42,561 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_9 == 0 [2024-01-29 14:17:42,561 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] filename_7 == 0 [2024-01-29 14:17:42,561 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] is_null_0 == (_Bool)0 [2024-01-29 14:17:42,561 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] filename_is_null_2 == (_Bool)0 [2024-01-29 14:17:42,561 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] filename_is_null_8 == (_Bool)0 [2024-01-29 14:17:42,562 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] is_null_3 == (_Bool)0 [2024-01-29 14:17:42,562 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] filename_is_null_5 == (_Bool)0 [2024-01-29 14:17:42,562 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] filename_1 == 0 [2024-01-29 14:17:42,562 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_9 == 0 [2024-01-29 14:17:42,562 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] filename_is_null_8 == (_Bool)0 [2024-01-29 14:17:42,562 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_10 == 0 [2024-01-29 14:17:42,562 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_11 == 0 [2024-01-29 14:17:42,563 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] filename_is_null_5 == (_Bool)0 [2024-01-29 14:17:42,563 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] filename_is_null_2 == (_Bool)0 [2024-01-29 14:17:42,563 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] is_null_6 == (_Bool)0 [2024-01-29 14:17:42,563 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] is_null_0 == (_Bool)0 [2024-01-29 14:17:42,563 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] is_null_3 == (_Bool)0 [2024-01-29 14:17:42,563 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] b <= -1 [2024-01-29 14:17:42,563 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] b != 0 [2024-01-29 14:17:42,563 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] result_11 == 0 [2024-01-29 14:17:42,564 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] is_null_3 == (_Bool)0 || is_null_3 == (_Bool)1 [2024-01-29 14:17:42,564 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] filename_is_null_5 == (_Bool)0 || filename_is_null_5 == (_Bool)1 [2024-01-29 14:17:42,564 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] result_9 == 0 [2024-01-29 14:17:42,564 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1 [2024-01-29 14:17:42,564 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] filename_is_null_2 == (_Bool)0 || filename_is_null_2 == (_Bool)1 [2024-01-29 14:17:42,564 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] filename_is_null_8 == (_Bool)0 || filename_is_null_8 == (_Bool)1 [2024-01-29 14:17:42,564 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] result_10 == 0 [2024-01-29 14:17:42,564 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] is_null_6 == (_Bool)0 || is_null_6 == (_Bool)1 [2024-01-29 14:17:42,565 INFO L98 nessWitnessExtractor]: Location invariant before [L46-L46] (unsigned long )_argptr == 0UL [2024-01-29 14:17:42,565 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] filename_4 == 0 [2024-01-29 14:17:42,565 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_9 == 0 [2024-01-29 14:17:42,565 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] is_null_0 == (_Bool)0 [2024-01-29 14:17:42,565 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] is_null_6 == (_Bool)0 [2024-01-29 14:17:42,565 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_11 == 0 [2024-01-29 14:17:42,565 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] filename_is_null_5 == (_Bool)0 [2024-01-29 14:17:42,565 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] is_null_3 == (_Bool)0 [2024-01-29 14:17:42,566 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] filename_7 == 0 [2024-01-29 14:17:42,566 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_10 == 0 [2024-01-29 14:17:42,566 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] filename_is_null_2 == (_Bool)0 [2024-01-29 14:17:42,566 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] filename_is_null_8 == (_Bool)0 [2024-01-29 14:17:42,566 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_10 == 0 [2024-01-29 14:17:42,566 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_11 == 0 [2024-01-29 14:17:42,566 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] is_null_6 == (_Bool)0 [2024-01-29 14:17:42,566 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_9 == 0 [2024-01-29 14:17:42,567 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] filename_is_null_8 == (_Bool)0 [2024-01-29 14:17:42,567 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] is_null_3 == (_Bool)0 [2024-01-29 14:17:42,567 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1 [2024-01-29 14:17:42,567 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] filename_is_null_2 == (_Bool)0 [2024-01-29 14:17:42,567 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] filename_is_null_5 == (_Bool)0 [2024-01-29 14:17:42,583 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 14:17:42,730 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-subst.wvr.c[3054,3067] [2024-01-29 14:17:42,735 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:17:42,742 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 14:17:42,759 WARN L424 MainDispatcher]: Unable to annotate __assert_fail(const char *__assertion, const char *__file, unsigned int __line, const char *__function) with a witness entry [2024-01-29 14:17:42,760 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 Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 14:17:42,814 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-subst.wvr.c[3054,3067] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 14:17:42,817 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:17:42,828 INFO L206 MainTranslator]: Completed translation [2024-01-29 14:17:42,829 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:42 WrapperNode [2024-01-29 14:17:42,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 14:17:42,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 14:17:42,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 14:17:42,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 14:17:42,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,909 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 319 [2024-01-29 14:17:42,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 14:17:42,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 14:17:42,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 14:17:42,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 14:17:42,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,969 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-29 14:17:42,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,987 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:42,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:43,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 14:17:43,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 14:17:43,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 14:17:43,006 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 14:17:43,007 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:42" (1/1) ... [2024-01-29 14:17:43,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:17:43,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:17:43,061 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 14:17:43,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 14:17:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 14:17:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 14:17:43,173 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 14:17:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 14:17:43,173 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 14:17:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-29 14:17:43,173 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-29 14:17:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 14:17:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 14:17:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 14:17:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 14:17:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 14:17:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 14:17:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 14:17:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 14:17:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 14:17:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 14:17:43,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 14:17:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 14:17:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 14:17:43,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 14:17:43,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 14:17:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 14:17:43,182 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 14:17:43,342 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 14:17:43,344 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 14:17:43,843 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 14:17:43,843 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 14:17:44,056 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 14:17:44,056 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 14:17:44,058 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:17:44 BoogieIcfgContainer [2024-01-29 14:17:44,058 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 14:17:44,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 14:17:44,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 14:17:44,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 14:17:44,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 02:17:42" (1/4) ... [2024-01-29 14:17:44,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2676c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:17:44, skipping insertion in model container [2024-01-29 14:17:44,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:17:42" (2/4) ... [2024-01-29 14:17:44,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2676c2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:17:44, skipping insertion in model container [2024-01-29 14:17:44,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:42" (3/4) ... [2024-01-29 14:17:44,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2676c2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:17:44, skipping insertion in model container [2024-01-29 14:17:44,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:17:44" (4/4) ... [2024-01-29 14:17:44,080 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-subst.wvr.c [2024-01-29 14:17:44,096 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 14:17:44,097 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 112 error locations. [2024-01-29 14:17:44,097 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 14:17:44,175 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-29 14:17:44,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 277 places, 279 transitions, 579 flow [2024-01-29 14:17:44,263 INFO L124 PetriNetUnfolderBase]: 12/276 cut-off events. [2024-01-29 14:17:44,263 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 14:17:44,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 276 events. 12/276 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 376 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 247. Up to 2 conditions per place. [2024-01-29 14:17:44,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 277 places, 279 transitions, 579 flow [2024-01-29 14:17:44,276 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 273 places, 275 transitions, 568 flow [2024-01-29 14:17:44,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 14:17:44,293 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;@36b6ce4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 14:17:44,293 INFO L358 AbstractCegarLoop]: Starting to check reachability of 130 error locations. [2024-01-29 14:17:44,295 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 14:17:44,295 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 14:17:44,295 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:17:44,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:44,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 14:17:44,296 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 14:17:44,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:44,300 INFO L85 PathProgramCache]: Analyzing trace with hash 31413, now seen corresponding path program 1 times [2024-01-29 14:17:44,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:44,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209325929] [2024-01-29 14:17:44,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:44,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:44,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:44,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209325929] [2024-01-29 14:17:44,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209325929] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:44,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:44,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:44,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457486410] [2024-01-29 14:17:44,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:44,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:44,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:44,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:44,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:44,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 279 [2024-01-29 14:17:44,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 275 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:44,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:44,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 279 [2024-01-29 14:17:44,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:45,536 INFO L124 PetriNetUnfolderBase]: 4522/7497 cut-off events. [2024-01-29 14:17:45,537 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2024-01-29 14:17:45,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13937 conditions, 7497 events. 4522/7497 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58507 event pairs, 3768 based on Foata normal form. 0/6084 useless extension candidates. Maximal degree in co-relation 12584. Up to 6161 conditions per place. [2024-01-29 14:17:45,594 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 49 selfloop transitions, 2 changer transitions 0/274 dead transitions. [2024-01-29 14:17:45,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 274 transitions, 668 flow [2024-01-29 14:17:45,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 730 transitions. [2024-01-29 14:17:45,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8721624850657109 [2024-01-29 14:17:45,608 INFO L175 Difference]: Start difference. First operand has 273 places, 275 transitions, 568 flow. Second operand 3 states and 730 transitions. [2024-01-29 14:17:45,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 274 transitions, 668 flow [2024-01-29 14:17:45,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 274 transitions, 656 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-29 14:17:45,620 INFO L231 Difference]: Finished difference. Result has 268 places, 274 transitions, 558 flow [2024-01-29 14:17:45,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=268, PETRI_TRANSITIONS=274} [2024-01-29 14:17:45,624 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -5 predicate places. [2024-01-29 14:17:45,625 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 274 transitions, 558 flow [2024-01-29 14:17:45,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:45,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 14:17:45,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 14:17:45,626 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 14:17:45,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:45,627 INFO L85 PathProgramCache]: Analyzing trace with hash 974770, now seen corresponding path program 1 times [2024-01-29 14:17:45,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:45,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294440178] [2024-01-29 14:17:45,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:45,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:45,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:45,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294440178] [2024-01-29 14:17:45,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294440178] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:45,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:45,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:45,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881635482] [2024-01-29 14:17:45,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:45,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:45,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:45,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:45,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:45,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 279 [2024-01-29 14:17:45,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 274 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:45,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:45,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 279 [2024-01-29 14:17:45,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:46,663 INFO L124 PetriNetUnfolderBase]: 4522/7489 cut-off events. [2024-01-29 14:17:46,663 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 14:17:46,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13748 conditions, 7489 events. 4522/7489 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58485 event pairs, 3768 based on Foata normal form. 8/6094 useless extension candidates. Maximal degree in co-relation 13718. Up to 6156 conditions per place. [2024-01-29 14:17:46,718 INFO L140 encePairwiseOnDemand]: 269/279 looper letters, 50 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2024-01-29 14:17:46,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 266 transitions, 646 flow [2024-01-29 14:17:46,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-01-29 14:17:46,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8530465949820788 [2024-01-29 14:17:46,737 INFO L175 Difference]: Start difference. First operand has 268 places, 274 transitions, 558 flow. Second operand 3 states and 714 transitions. [2024-01-29 14:17:46,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 266 transitions, 646 flow [2024-01-29 14:17:46,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 266 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:46,741 INFO L231 Difference]: Finished difference. Result has 260 places, 266 transitions, 542 flow [2024-01-29 14:17:46,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=260, PETRI_TRANSITIONS=266} [2024-01-29 14:17:46,742 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -13 predicate places. [2024-01-29 14:17:46,742 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 266 transitions, 542 flow [2024-01-29 14:17:46,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:46,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:46,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 14:17:46,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 14:17:46,743 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 14:17:46,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:46,744 INFO L85 PathProgramCache]: Analyzing trace with hash 30218940, now seen corresponding path program 1 times [2024-01-29 14:17:46,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:46,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013627952] [2024-01-29 14:17:46,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:46,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:46,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:46,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013627952] [2024-01-29 14:17:46,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013627952] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:46,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:46,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:46,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778376483] [2024-01-29 14:17:46,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:46,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:46,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:46,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:46,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:46,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 279 [2024-01-29 14:17:46,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 266 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:46,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:46,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 279 [2024-01-29 14:17:46,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:47,654 INFO L124 PetriNetUnfolderBase]: 4522/7484 cut-off events. [2024-01-29 14:17:47,654 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 14:17:47,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13746 conditions, 7484 events. 4522/7484 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58468 event pairs, 3768 based on Foata normal form. 5/6094 useless extension candidates. Maximal degree in co-relation 13586. Up to 6162 conditions per place. [2024-01-29 14:17:47,694 INFO L140 encePairwiseOnDemand]: 272/279 looper letters, 53 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2024-01-29 14:17:47,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 261 transitions, 642 flow [2024-01-29 14:17:47,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-01-29 14:17:47,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8530465949820788 [2024-01-29 14:17:47,696 INFO L175 Difference]: Start difference. First operand has 260 places, 266 transitions, 542 flow. Second operand 3 states and 714 transitions. [2024-01-29 14:17:47,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 261 transitions, 642 flow [2024-01-29 14:17:47,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 261 transitions, 638 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:47,700 INFO L231 Difference]: Finished difference. Result has 255 places, 261 transitions, 532 flow [2024-01-29 14:17:47,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=255, PETRI_TRANSITIONS=261} [2024-01-29 14:17:47,701 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -18 predicate places. [2024-01-29 14:17:47,701 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 261 transitions, 532 flow [2024-01-29 14:17:47,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:47,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:47,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 14:17:47,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 14:17:47,702 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 14:17:47,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:47,702 INFO L85 PathProgramCache]: Analyzing trace with hash 936788089, now seen corresponding path program 1 times [2024-01-29 14:17:47,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:47,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391174404] [2024-01-29 14:17:47,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:47,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:47,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:47,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391174404] [2024-01-29 14:17:47,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391174404] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:47,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:47,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:47,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122899444] [2024-01-29 14:17:47,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:47,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:47,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:47,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:47,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:47,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 279 [2024-01-29 14:17:47,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 261 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:47,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:47,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 279 [2024-01-29 14:17:47,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:48,388 INFO L124 PetriNetUnfolderBase]: 4522/7475 cut-off events. [2024-01-29 14:17:48,389 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 14:17:48,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13733 conditions, 7475 events. 4522/7475 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58412 event pairs, 3768 based on Foata normal form. 8/6092 useless extension candidates. Maximal degree in co-relation 13635. Up to 6154 conditions per place. [2024-01-29 14:17:48,428 INFO L140 encePairwiseOnDemand]: 268/279 looper letters, 49 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2024-01-29 14:17:48,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 252 transitions, 616 flow [2024-01-29 14:17:48,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-01-29 14:17:48,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8530465949820788 [2024-01-29 14:17:48,430 INFO L175 Difference]: Start difference. First operand has 255 places, 261 transitions, 532 flow. Second operand 3 states and 714 transitions. [2024-01-29 14:17:48,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 252 transitions, 616 flow [2024-01-29 14:17:48,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 252 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:48,433 INFO L231 Difference]: Finished difference. Result has 246 places, 252 transitions, 514 flow [2024-01-29 14:17:48,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=246, PETRI_TRANSITIONS=252} [2024-01-29 14:17:48,434 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -27 predicate places. [2024-01-29 14:17:48,434 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 252 transitions, 514 flow [2024-01-29 14:17:48,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:48,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:48,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 14:17:48,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 14:17:48,435 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 14:17:48,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:48,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1024339501, now seen corresponding path program 1 times [2024-01-29 14:17:48,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:48,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118616902] [2024-01-29 14:17:48,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:48,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:48,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:48,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118616902] [2024-01-29 14:17:48,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118616902] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:48,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:48,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:48,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047901984] [2024-01-29 14:17:48,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:48,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:48,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:48,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:48,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:48,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 279 [2024-01-29 14:17:48,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 252 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:48,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:48,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 279 [2024-01-29 14:17:48,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:49,349 INFO L124 PetriNetUnfolderBase]: 4522/7468 cut-off events. [2024-01-29 14:17:49,349 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 14:17:49,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13728 conditions, 7468 events. 4522/7468 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58398 event pairs, 3768 based on Foata normal form. 7/6093 useless extension candidates. Maximal degree in co-relation 13566. Up to 6158 conditions per place. [2024-01-29 14:17:49,382 INFO L140 encePairwiseOnDemand]: 270/279 looper letters, 51 selfloop transitions, 2 changer transitions 0/245 dead transitions. [2024-01-29 14:17:49,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 245 transitions, 606 flow [2024-01-29 14:17:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-01-29 14:17:49,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8530465949820788 [2024-01-29 14:17:49,384 INFO L175 Difference]: Start difference. First operand has 246 places, 252 transitions, 514 flow. Second operand 3 states and 714 transitions. [2024-01-29 14:17:49,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 245 transitions, 606 flow [2024-01-29 14:17:49,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 245 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:49,388 INFO L231 Difference]: Finished difference. Result has 239 places, 245 transitions, 500 flow [2024-01-29 14:17:49,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=239, PETRI_TRANSITIONS=245} [2024-01-29 14:17:49,390 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -34 predicate places. [2024-01-29 14:17:49,390 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 245 transitions, 500 flow [2024-01-29 14:17:49,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:49,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:49,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:49,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 14:17:49,396 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 14:17:49,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:49,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1689752552, now seen corresponding path program 1 times [2024-01-29 14:17:49,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:49,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127909015] [2024-01-29 14:17:49,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:49,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:49,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:49,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:49,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127909015] [2024-01-29 14:17:49,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127909015] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:49,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:49,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:49,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098769703] [2024-01-29 14:17:49,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:49,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:49,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:49,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:49,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:49,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 279 [2024-01-29 14:17:49,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 245 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:49,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:49,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 279 [2024-01-29 14:17:49,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:50,083 INFO L124 PetriNetUnfolderBase]: 4522/7464 cut-off events. [2024-01-29 14:17:50,084 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 14:17:50,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13727 conditions, 7464 events. 4522/7464 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58351 event pairs, 3768 based on Foata normal form. 4/6093 useless extension candidates. Maximal degree in co-relation 13603. Up to 6164 conditions per place. [2024-01-29 14:17:50,118 INFO L140 encePairwiseOnDemand]: 273/279 looper letters, 54 selfloop transitions, 2 changer transitions 0/241 dead transitions. [2024-01-29 14:17:50,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 241 transitions, 604 flow [2024-01-29 14:17:50,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:50,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-01-29 14:17:50,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8530465949820788 [2024-01-29 14:17:50,120 INFO L175 Difference]: Start difference. First operand has 239 places, 245 transitions, 500 flow. Second operand 3 states and 714 transitions. [2024-01-29 14:17:50,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 241 transitions, 604 flow [2024-01-29 14:17:50,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 241 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:50,123 INFO L231 Difference]: Finished difference. Result has 235 places, 241 transitions, 492 flow [2024-01-29 14:17:50,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=235, PETRI_TRANSITIONS=241} [2024-01-29 14:17:50,124 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -38 predicate places. [2024-01-29 14:17:50,124 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 241 transitions, 492 flow [2024-01-29 14:17:50,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:50,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:50,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:50,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 14:17:50,125 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 14:17:50,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:50,125 INFO L85 PathProgramCache]: Analyzing trace with hash -842720565, now seen corresponding path program 1 times [2024-01-29 14:17:50,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:50,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122463105] [2024-01-29 14:17:50,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:50,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:50,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:50,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122463105] [2024-01-29 14:17:50,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122463105] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:50,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:50,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:50,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319987718] [2024-01-29 14:17:50,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:50,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:50,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:50,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:50,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:50,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 279 [2024-01-29 14:17:50,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 241 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:50,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:50,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 279 [2024-01-29 14:17:50,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:50,826 INFO L124 PetriNetUnfolderBase]: 4522/7461 cut-off events. [2024-01-29 14:17:50,826 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 14:17:50,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13721 conditions, 7461 events. 4522/7461 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58457 event pairs, 3768 based on Foata normal form. 0/6083 useless extension candidates. Maximal degree in co-relation 13647. Up to 6159 conditions per place. [2024-01-29 14:17:50,870 INFO L140 encePairwiseOnDemand]: 274/279 looper letters, 51 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2024-01-29 14:17:50,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 238 transitions, 592 flow [2024-01-29 14:17:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2024-01-29 14:17:50,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8626045400238949 [2024-01-29 14:17:50,872 INFO L175 Difference]: Start difference. First operand has 235 places, 241 transitions, 492 flow. Second operand 3 states and 722 transitions. [2024-01-29 14:17:50,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 238 transitions, 592 flow [2024-01-29 14:17:50,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 238 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:50,875 INFO L231 Difference]: Finished difference. Result has 232 places, 238 transitions, 486 flow [2024-01-29 14:17:50,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=232, PETRI_TRANSITIONS=238} [2024-01-29 14:17:50,876 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -41 predicate places. [2024-01-29 14:17:50,876 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 238 transitions, 486 flow [2024-01-29 14:17:50,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:50,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:50,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:50,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 14:17:50,877 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 14:17:50,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:50,877 INFO L85 PathProgramCache]: Analyzing trace with hash -354532890, now seen corresponding path program 1 times [2024-01-29 14:17:50,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:50,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721545820] [2024-01-29 14:17:50,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:50,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:50,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 14:17:50,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:50,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721545820] [2024-01-29 14:17:50,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721545820] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:50,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:50,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:50,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292980530] [2024-01-29 14:17:50,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:50,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:50,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:50,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:50,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:50,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 279 [2024-01-29 14:17:50,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 238 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:50,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:50,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 279 [2024-01-29 14:17:50,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:51,972 INFO L124 PetriNetUnfolderBase]: 4501/7458 cut-off events. [2024-01-29 14:17:51,973 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 14:17:51,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13723 conditions, 7458 events. 4501/7458 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 59162 event pairs, 2654 based on Foata normal form. 1/6180 useless extension candidates. Maximal degree in co-relation 13667. Up to 4396 conditions per place. [2024-01-29 14:17:52,015 INFO L140 encePairwiseOnDemand]: 266/279 looper letters, 78 selfloop transitions, 3 changer transitions 0/251 dead transitions. [2024-01-29 14:17:52,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 251 transitions, 676 flow [2024-01-29 14:17:52,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2024-01-29 14:17:52,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8614097968936678 [2024-01-29 14:17:52,018 INFO L175 Difference]: Start difference. First operand has 232 places, 238 transitions, 486 flow. Second operand 3 states and 721 transitions. [2024-01-29 14:17:52,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 251 transitions, 676 flow [2024-01-29 14:17:52,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 251 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:52,022 INFO L231 Difference]: Finished difference. Result has 222 places, 228 transitions, 468 flow [2024-01-29 14:17:52,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=222, PETRI_TRANSITIONS=228} [2024-01-29 14:17:52,023 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -51 predicate places. [2024-01-29 14:17:52,023 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 228 transitions, 468 flow [2024-01-29 14:17:52,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:52,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:52,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:52,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 14:17:52,024 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 14:17:52,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:52,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1894383370, now seen corresponding path program 1 times [2024-01-29 14:17:52,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:52,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266714382] [2024-01-29 14:17:52,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:52,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:52,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:52,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:52,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266714382] [2024-01-29 14:17:52,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266714382] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:52,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:52,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:52,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684212341] [2024-01-29 14:17:52,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:52,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:52,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:52,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:52,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:52,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 279 [2024-01-29 14:17:52,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 228 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:52,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:52,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 279 [2024-01-29 14:17:52,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:52,769 INFO L124 PetriNetUnfolderBase]: 4522/7445 cut-off events. [2024-01-29 14:17:52,770 INFO L125 PetriNetUnfolderBase]: For 213/213 co-relation queries the response was YES. [2024-01-29 14:17:52,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13888 conditions, 7445 events. 4522/7445 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58461 event pairs, 3768 based on Foata normal form. 6/6089 useless extension candidates. Maximal degree in co-relation 9955. Up to 6160 conditions per place. [2024-01-29 14:17:52,810 INFO L140 encePairwiseOnDemand]: 271/279 looper letters, 52 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-01-29 14:17:52,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 222 transitions, 564 flow [2024-01-29 14:17:52,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-01-29 14:17:52,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8530465949820788 [2024-01-29 14:17:52,812 INFO L175 Difference]: Start difference. First operand has 222 places, 228 transitions, 468 flow. Second operand 3 states and 714 transitions. [2024-01-29 14:17:52,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 222 transitions, 564 flow [2024-01-29 14:17:52,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 222 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:52,815 INFO L231 Difference]: Finished difference. Result has 216 places, 222 transitions, 454 flow [2024-01-29 14:17:52,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=216, PETRI_TRANSITIONS=222} [2024-01-29 14:17:52,816 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -57 predicate places. [2024-01-29 14:17:52,816 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 222 transitions, 454 flow [2024-01-29 14:17:52,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:52,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:52,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:52,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 14:17:52,817 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 14:17:52,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:52,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1403656769, now seen corresponding path program 1 times [2024-01-29 14:17:52,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:52,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754243194] [2024-01-29 14:17:52,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:52,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:52,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:52,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754243194] [2024-01-29 14:17:52,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754243194] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:52,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:52,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:52,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691778893] [2024-01-29 14:17:52,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:52,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:52,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:52,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:52,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:52,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 279 [2024-01-29 14:17:52,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 222 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:52,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:52,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 279 [2024-01-29 14:17:52,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:53,569 INFO L124 PetriNetUnfolderBase]: 4522/7455 cut-off events. [2024-01-29 14:17:53,570 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-01-29 14:17:53,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13721 conditions, 7455 events. 4522/7455 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 58731 event pairs, 2958 based on Foata normal form. 0/6100 useless extension candidates. Maximal degree in co-relation 13631. Up to 4918 conditions per place. [2024-01-29 14:17:53,633 INFO L140 encePairwiseOnDemand]: 267/279 looper letters, 80 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2024-01-29 14:17:53,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 235 transitions, 646 flow [2024-01-29 14:17:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-01-29 14:17:53,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8590203106332138 [2024-01-29 14:17:53,650 INFO L175 Difference]: Start difference. First operand has 216 places, 222 transitions, 454 flow. Second operand 3 states and 719 transitions. [2024-01-29 14:17:53,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 235 transitions, 646 flow [2024-01-29 14:17:53,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 235 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:53,654 INFO L231 Difference]: Finished difference. Result has 206 places, 212 transitions, 434 flow [2024-01-29 14:17:53,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=434, PETRI_PLACES=206, PETRI_TRANSITIONS=212} [2024-01-29 14:17:53,655 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -67 predicate places. [2024-01-29 14:17:53,657 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 212 transitions, 434 flow [2024-01-29 14:17:53,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:53,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:53,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:53,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 14:17:53,658 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 14:17:53,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:53,658 INFO L85 PathProgramCache]: Analyzing trace with hash -563685832, now seen corresponding path program 1 times [2024-01-29 14:17:53,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:53,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326287978] [2024-01-29 14:17:53,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:53,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:53,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:53,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326287978] [2024-01-29 14:17:53,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326287978] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:53,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:53,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:53,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138331575] [2024-01-29 14:17:53,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:53,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:53,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:53,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:53,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:53,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 279 [2024-01-29 14:17:53,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 212 transitions, 434 flow. Second operand has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:53,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:53,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 279 [2024-01-29 14:17:53,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:54,460 INFO L124 PetriNetUnfolderBase]: 4522/7443 cut-off events. [2024-01-29 14:17:54,461 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2024-01-29 14:17:54,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13888 conditions, 7443 events. 4522/7443 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 58969 event pairs, 2878 based on Foata normal form. 0/6135 useless extension candidates. Maximal degree in co-relation 11029. Up to 4780 conditions per place. [2024-01-29 14:17:54,491 INFO L140 encePairwiseOnDemand]: 267/279 looper letters, 78 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2024-01-29 14:17:54,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 225 transitions, 624 flow [2024-01-29 14:17:54,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2024-01-29 14:17:54,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8637992831541219 [2024-01-29 14:17:54,493 INFO L175 Difference]: Start difference. First operand has 206 places, 212 transitions, 434 flow. Second operand 3 states and 723 transitions. [2024-01-29 14:17:54,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 225 transitions, 624 flow [2024-01-29 14:17:54,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 225 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:54,498 INFO L231 Difference]: Finished difference. Result has 196 places, 202 transitions, 414 flow [2024-01-29 14:17:54,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=196, PETRI_TRANSITIONS=202} [2024-01-29 14:17:54,498 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -77 predicate places. [2024-01-29 14:17:54,499 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 202 transitions, 414 flow [2024-01-29 14:17:54,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:54,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:54,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:54,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 14:17:54,499 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 14:17:54,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:54,500 INFO L85 PathProgramCache]: Analyzing trace with hash -294390705, now seen corresponding path program 1 times [2024-01-29 14:17:54,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:54,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560490812] [2024-01-29 14:17:54,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:54,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:54,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:54,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:54,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560490812] [2024-01-29 14:17:54,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560490812] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:54,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:54,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:54,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084167622] [2024-01-29 14:17:54,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:54,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:54,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:54,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:54,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:54,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 279 [2024-01-29 14:17:54,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 202 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:54,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:54,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 279 [2024-01-29 14:17:54,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:55,156 INFO L124 PetriNetUnfolderBase]: 4522/7423 cut-off events. [2024-01-29 14:17:55,156 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2024-01-29 14:17:55,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13877 conditions, 7423 events. 4522/7423 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58326 event pairs, 3768 based on Foata normal form. 0/6075 useless extension candidates. Maximal degree in co-relation 10698. Up to 6160 conditions per place. [2024-01-29 14:17:55,186 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 48 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2024-01-29 14:17:55,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 200 transitions, 510 flow [2024-01-29 14:17:55,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:55,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 730 transitions. [2024-01-29 14:17:55,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8721624850657109 [2024-01-29 14:17:55,189 INFO L175 Difference]: Start difference. First operand has 196 places, 202 transitions, 414 flow. Second operand 3 states and 730 transitions. [2024-01-29 14:17:55,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 200 transitions, 510 flow [2024-01-29 14:17:55,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 200 transitions, 506 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:55,192 INFO L231 Difference]: Finished difference. Result has 194 places, 200 transitions, 410 flow [2024-01-29 14:17:55,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=194, PETRI_TRANSITIONS=200} [2024-01-29 14:17:55,192 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -79 predicate places. [2024-01-29 14:17:55,193 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 200 transitions, 410 flow [2024-01-29 14:17:55,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:55,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:55,193 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] [2024-01-29 14:17:55,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 14:17:55,193 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 14:17:55,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1218712181, now seen corresponding path program 1 times [2024-01-29 14:17:55,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:55,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761260637] [2024-01-29 14:17:55,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:55,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:17:55,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 14:17:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:17:55,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 14:17:55,247 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 14:17:55,248 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 130 remaining) [2024-01-29 14:17:55,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 130 remaining) [2024-01-29 14:17:55,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 130 remaining) [2024-01-29 14:17:55,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 130 remaining) [2024-01-29 14:17:55,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 130 remaining) [2024-01-29 14:17:55,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 130 remaining) [2024-01-29 14:17:55,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 130 remaining) [2024-01-29 14:17:55,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 130 remaining) [2024-01-29 14:17:55,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 130 remaining) [2024-01-29 14:17:55,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 130 remaining) [2024-01-29 14:17:55,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 130 remaining) [2024-01-29 14:17:55,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 130 remaining) [2024-01-29 14:17:55,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 130 remaining) [2024-01-29 14:17:55,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 130 remaining) [2024-01-29 14:17:55,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 130 remaining) [2024-01-29 14:17:55,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 130 remaining) [2024-01-29 14:17:55,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 130 remaining) [2024-01-29 14:17:55,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 130 remaining) [2024-01-29 14:17:55,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 130 remaining) [2024-01-29 14:17:55,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 130 remaining) [2024-01-29 14:17:55,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 130 remaining) [2024-01-29 14:17:55,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 130 remaining) [2024-01-29 14:17:55,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 130 remaining) [2024-01-29 14:17:55,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 130 remaining) [2024-01-29 14:17:55,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 130 remaining) [2024-01-29 14:17:55,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 130 remaining) [2024-01-29 14:17:55,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 130 remaining) [2024-01-29 14:17:55,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 130 remaining) [2024-01-29 14:17:55,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 130 remaining) [2024-01-29 14:17:55,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 130 remaining) [2024-01-29 14:17:55,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 130 remaining) [2024-01-29 14:17:55,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 130 remaining) [2024-01-29 14:17:55,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 130 remaining) [2024-01-29 14:17:55,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 130 remaining) [2024-01-29 14:17:55,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 130 remaining) [2024-01-29 14:17:55,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 130 remaining) [2024-01-29 14:17:55,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 130 remaining) [2024-01-29 14:17:55,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 130 remaining) [2024-01-29 14:17:55,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 130 remaining) [2024-01-29 14:17:55,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 130 remaining) [2024-01-29 14:17:55,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 130 remaining) [2024-01-29 14:17:55,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 130 remaining) [2024-01-29 14:17:55,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 130 remaining) [2024-01-29 14:17:55,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 130 remaining) [2024-01-29 14:17:55,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 130 remaining) [2024-01-29 14:17:55,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 130 remaining) [2024-01-29 14:17:55,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 130 remaining) [2024-01-29 14:17:55,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 130 remaining) [2024-01-29 14:17:55,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 130 remaining) [2024-01-29 14:17:55,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 130 remaining) [2024-01-29 14:17:55,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 130 remaining) [2024-01-29 14:17:55,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 130 remaining) [2024-01-29 14:17:55,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 130 remaining) [2024-01-29 14:17:55,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 130 remaining) [2024-01-29 14:17:55,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 130 remaining) [2024-01-29 14:17:55,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 130 remaining) [2024-01-29 14:17:55,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 130 remaining) [2024-01-29 14:17:55,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 130 remaining) [2024-01-29 14:17:55,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 130 remaining) [2024-01-29 14:17:55,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 130 remaining) [2024-01-29 14:17:55,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 130 remaining) [2024-01-29 14:17:55,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 130 remaining) [2024-01-29 14:17:55,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 130 remaining) [2024-01-29 14:17:55,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 130 remaining) [2024-01-29 14:17:55,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 130 remaining) [2024-01-29 14:17:55,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 130 remaining) [2024-01-29 14:17:55,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 130 remaining) [2024-01-29 14:17:55,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 130 remaining) [2024-01-29 14:17:55,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 130 remaining) [2024-01-29 14:17:55,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 130 remaining) [2024-01-29 14:17:55,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 130 remaining) [2024-01-29 14:17:55,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 130 remaining) [2024-01-29 14:17:55,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 130 remaining) [2024-01-29 14:17:55,263 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 130 remaining) [2024-01-29 14:17:55,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 130 remaining) [2024-01-29 14:17:55,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 130 remaining) [2024-01-29 14:17:55,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 130 remaining) [2024-01-29 14:17:55,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 130 remaining) [2024-01-29 14:17:55,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 130 remaining) [2024-01-29 14:17:55,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 130 remaining) [2024-01-29 14:17:55,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 130 remaining) [2024-01-29 14:17:55,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 130 remaining) [2024-01-29 14:17:55,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 130 remaining) [2024-01-29 14:17:55,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 130 remaining) [2024-01-29 14:17:55,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 130 remaining) [2024-01-29 14:17:55,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 130 remaining) [2024-01-29 14:17:55,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 130 remaining) [2024-01-29 14:17:55,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 130 remaining) [2024-01-29 14:17:55,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 130 remaining) [2024-01-29 14:17:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 130 remaining) [2024-01-29 14:17:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 130 remaining) [2024-01-29 14:17:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 130 remaining) [2024-01-29 14:17:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 130 remaining) [2024-01-29 14:17:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 130 remaining) [2024-01-29 14:17:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 130 remaining) [2024-01-29 14:17:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 130 remaining) [2024-01-29 14:17:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 130 remaining) [2024-01-29 14:17:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 130 remaining) [2024-01-29 14:17:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 130 remaining) [2024-01-29 14:17:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 130 remaining) [2024-01-29 14:17:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 130 remaining) [2024-01-29 14:17:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 130 remaining) [2024-01-29 14:17:55,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 130 remaining) [2024-01-29 14:17:55,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 130 remaining) [2024-01-29 14:17:55,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 130 remaining) [2024-01-29 14:17:55,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 130 remaining) [2024-01-29 14:17:55,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 130 remaining) [2024-01-29 14:17:55,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 130 remaining) [2024-01-29 14:17:55,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 130 remaining) [2024-01-29 14:17:55,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 130 remaining) [2024-01-29 14:17:55,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 130 remaining) [2024-01-29 14:17:55,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONERROR_FUNCTION (18 of 130 remaining) [2024-01-29 14:17:55,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 130 remaining) [2024-01-29 14:17:55,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 130 remaining) [2024-01-29 14:17:55,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 130 remaining) [2024-01-29 14:17:55,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 130 remaining) [2024-01-29 14:17:55,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 130 remaining) [2024-01-29 14:17:55,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 130 remaining) [2024-01-29 14:17:55,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 130 remaining) [2024-01-29 14:17:55,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 130 remaining) [2024-01-29 14:17:55,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 130 remaining) [2024-01-29 14:17:55,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 130 remaining) [2024-01-29 14:17:55,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 130 remaining) [2024-01-29 14:17:55,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 130 remaining) [2024-01-29 14:17:55,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 130 remaining) [2024-01-29 14:17:55,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 130 remaining) [2024-01-29 14:17:55,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 130 remaining) [2024-01-29 14:17:55,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 130 remaining) [2024-01-29 14:17:55,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 130 remaining) [2024-01-29 14:17:55,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 130 remaining) [2024-01-29 14:17:55,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 14:17:55,279 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:55,284 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 14:17:55,284 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 14:17:55,355 INFO L503 ceAbstractionStarter]: Automizer considered 111 witness invariants [2024-01-29 14:17:55,356 INFO L504 ceAbstractionStarter]: WitnessConsidered=111 [2024-01-29 14:17:55,356 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 02:17:55 BasicIcfg [2024-01-29 14:17:55,356 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 14:17:55,357 INFO L158 Benchmark]: Toolchain (without parser) took 12831.93ms. Allocated memory was 176.2MB in the beginning and 9.7GB in the end (delta: 9.5GB). Free memory was 137.8MB in the beginning and 8.6GB in the end (delta: -8.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-01-29 14:17:55,357 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:17:55,357 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:17:55,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.49ms. Allocated memory is still 176.2MB. Free memory was 137.4MB in the beginning and 113.5MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-01-29 14:17:55,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.22ms. Allocated memory is still 176.2MB. Free memory was 113.5MB in the beginning and 110.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 14:17:55,358 INFO L158 Benchmark]: Boogie Preprocessor took 89.69ms. Allocated memory is still 176.2MB. Free memory was 110.9MB in the beginning and 108.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 14:17:55,358 INFO L158 Benchmark]: RCFGBuilder took 1052.08ms. Allocated memory is still 176.2MB. Free memory was 108.0MB in the beginning and 138.6MB in the end (delta: -30.6MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2024-01-29 14:17:55,358 INFO L158 Benchmark]: TraceAbstraction took 11284.14ms. Allocated memory was 234.9MB in the beginning and 9.7GB in the end (delta: 9.5GB). Free memory was 200.3MB in the beginning and 8.6GB in the end (delta: -8.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-01-29 14:17:55,360 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.49ms. Allocated memory is still 176.2MB. Free memory was 137.4MB in the beginning and 113.5MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.22ms. Allocated memory is still 176.2MB. Free memory was 113.5MB in the beginning and 110.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.69ms. Allocated memory is still 176.2MB. Free memory was 110.9MB in the beginning and 108.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1052.08ms. Allocated memory is still 176.2MB. Free memory was 108.0MB in the beginning and 138.6MB in the end (delta: -30.6MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11284.14ms. Allocated memory was 234.9MB in the beginning and 9.7GB in the end (delta: 9.5GB). Free memory was 200.3MB in the beginning and 8.6GB in the end (delta: -8.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 68]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] int filename_1, filename_4, filename_7, result_9, result_10, result_11; [L39] _Bool is_null_0, is_null_3, is_null_6, filename_is_null_2, filename_is_null_5, filename_is_null_8; [L62] pthread_t t1, t2, t3; VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_1],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_8],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_7],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_6],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_4],IntegerLiteral[0]]]] [L64] filename_1 = __VERIFIER_nondet_int() [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_8],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_7],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_6],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_4],IntegerLiteral[0]]]] [L65] filename_4 = __VERIFIER_nondet_int() [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_8],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_6],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_7],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] [L66] filename_7 = __VERIFIER_nondet_int() [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_6],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_8],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] [L67] is_null_0 = __VERIFIER_nondet_bool() [L68] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L68] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L68] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[is_null_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[is_null_0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=2, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] - UnprovableResult [Line: 46]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: 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: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: 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: 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: 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: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: 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: 77]: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 331 locations, 130 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: 11.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 588 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 334 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1317 IncrementalHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 38 mSDtfsCounter, 1317 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=568occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 14:17:55,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE