./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-file-item-symm.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-file-item-symm.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/chl-file-item-symm.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-file-item-symm.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-8857f20-m [2024-01-29 22:56:27,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:56:27,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 22:56:27,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:56:27,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:56:27,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:56:27,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:56:27,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:56:27,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:56:27,998 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:56:27,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:56:27,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:56:27,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:56:28,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:56:28,001 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:56:28,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:56:28,001 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:56:28,001 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:56:28,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:56:28,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:56:28,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:56:28,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:56:28,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:56:28,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:56:28,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:56:28,003 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:56:28,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:56:28,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:56:28,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:56:28,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:56:28,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:56:28,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:56:28,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:56:28,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:56:28,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:56:28,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:56:28,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:56:28,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:56:28,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:56:28,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:56:28,006 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:56:28,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:56:28,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:56:28,006 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 22:56:28,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:56:28,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:56:28,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:56:28,254 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:56:28,254 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:56:28,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-file-item-symm.wvr.c [2024-01-29 22:56:29,368 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:56:29,534 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:56:29,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-symm.wvr.c [2024-01-29 22:56:29,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5897bde1/742c7ec848fc44b786a1bd9605173546/FLAG673717841 [2024-01-29 22:56:29,560 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5897bde1/742c7ec848fc44b786a1bd9605173546 [2024-01-29 22:56:29,562 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:56:29,564 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:56:29,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-file-item-symm.wvr.yml/witness.yml [2024-01-29 22:56:29,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:56:29,661 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:56:29,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:56:29,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:56:29,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:56:29,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:56:29" (1/2) ... [2024-01-29 22:56:29,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@520472c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:29, skipping insertion in model container [2024-01-29 22:56:29,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:56:29" (1/2) ... [2024-01-29 22:56:29,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@72d431b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:29, skipping insertion in model container [2024-01-29 22:56:29,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:29" (2/2) ... [2024-01-29 22:56:29,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@520472c5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:29, skipping insertion in model container [2024-01-29 22:56:29,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:29" (2/2) ... [2024-01-29 22:56:29,669 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:56:29,686 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:56:29,689 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] ((filename_4 == 0) && (isNull_0 == (_Bool)0)) && (isNull_3 == (_Bool)0) [2024-01-29 22:56:29,689 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (((filename_4 == 0) && (isNull_0 == (_Bool)0)) && (isNull_3 == (_Bool)0)) && (filename_5 == (_Bool)0) [2024-01-29 22:56:29,689 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (filename_4 == 0) && (isNull_0 == (_Bool)0) [2024-01-29 22:56:29,689 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] filename_4 == 0 [2024-01-29 22:56:29,689 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (filename_4 == 0) && (result_6 == 0) [2024-01-29 22:56:29,689 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (filename_4 == 0) && (result_7 == 0) [2024-01-29 22:56:29,690 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (((filename_4 == 0) && (isNull_0 == (_Bool)0)) && (isNull_3 == (_Bool)0)) && (filename_2 == (_Bool)0) [2024-01-29 22:56:29,690 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (result_6 == 0) && (isNull_0 == (_Bool)0 || isNull_0 == (_Bool)1) [2024-01-29 22:56:29,690 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((result_6 == 0) && (isNull_0 == (_Bool)0 || isNull_0 == (_Bool)1)) && (isNull_3 == (_Bool)0 || isNull_3 == (_Bool)1) [2024-01-29 22:56:29,690 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((result_6 == 0) && (isNull_0 == (_Bool)0 || isNull_0 == (_Bool)1)) && (filename_2 == (_Bool)0 || filename_2 == (_Bool)1) [2024-01-29 22:56:29,690 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((result_6 == 0) && (isNull_0 == (_Bool)0 || isNull_0 == (_Bool)1)) && (filename_5 == (_Bool)0 || filename_5 == (_Bool)1) [2024-01-29 22:56:29,690 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_6 == 0 [2024-01-29 22:56:29,690 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (result_6 == 0) && (result_7 == 0) [2024-01-29 22:56:29,691 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (filename_4 == 0) && (filename_2 == (_Bool)0) [2024-01-29 22:56:29,691 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] filename_4 == 0 [2024-01-29 22:56:29,691 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (filename_4 == 0) && (isNull_3 == (_Bool)0) [2024-01-29 22:56:29,691 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ((filename_4 == 0) && (filename_2 == (_Bool)0)) && (filename_5 == (_Bool)0) [2024-01-29 22:56:29,691 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (filename_4 == 0) && (result_7 == 0) [2024-01-29 22:56:29,691 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (filename_4 == 0) && (result_6 == 0) [2024-01-29 22:56:29,691 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (filename_4 == 0) && (isNull_0 == (_Bool)0) [2024-01-29 22:56:29,692 INFO L98 nessWitnessExtractor]: Location invariant before [L46-L46] (unsigned long )_argptr == 0UL [2024-01-29 22:56:29,692 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] (((result_6 == 0) && (result_7 == 0)) && (isNull_0 == (_Bool)0 || isNull_0 == (_Bool)1)) && (filename_2 == (_Bool)0 || filename_2 == (_Bool)1) [2024-01-29 22:56:29,692 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] ((((result_6 == 0) && (result_7 == 0)) && (isNull_0 == (_Bool)0 || isNull_0 == (_Bool)1)) && (filename_2 == (_Bool)0 || filename_2 == (_Bool)1)) && (val == (_Bool)0 || val == (_Bool)1) [2024-01-29 22:56:29,692 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] ((result_6 == 0) && (result_7 == 0)) && (isNull_0 == (_Bool)0 || isNull_0 == (_Bool)1) [2024-01-29 22:56:29,693 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] (result_6 == 0) && (result_7 == 0) [2024-01-29 22:56:29,693 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] ((result_6 == 0) && (result_7 == 0)) && (filename_5 == (_Bool)0) [2024-01-29 22:56:29,693 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] result_6 == 0 [2024-01-29 22:56:29,693 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] (((result_6 == 0) && (result_7 == 0)) && (isNull_0 == (_Bool)0 || isNull_0 == (_Bool)1)) && (isNull_3 == (_Bool)0 || isNull_3 == (_Bool)1) [2024-01-29 22:56:29,693 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-29 22:56:29,693 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (result_6 == 0) && (isNull_3 == (_Bool)0) [2024-01-29 22:56:29,693 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] ((result_6 == 0) && (isNull_3 == (_Bool)0)) && (filename_2 == (_Bool)0) [2024-01-29 22:56:29,693 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] result_6 == 0 [2024-01-29 22:56:29,694 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (result_6 == 0) && (result_7 == 0) [2024-01-29 22:56:29,694 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] ((result_6 == 0) && (isNull_3 == (_Bool)0)) && (isNull_0 == (_Bool)0 || isNull_0 == (_Bool)1) [2024-01-29 22:56:29,694 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] ((result_6 == 0) && (isNull_3 == (_Bool)0)) && (filename_5 == (_Bool)0) [2024-01-29 22:56:29,694 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] filename_1 == 0 [2024-01-29 22:56:29,695 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (filename_1 == 0) && (filename_2 == (_Bool)0) [2024-01-29 22:56:29,695 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (filename_1 == 0) && (filename_5 == (_Bool)0) [2024-01-29 22:56:29,696 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (filename_1 == 0) && (result_7 == 0) [2024-01-29 22:56:29,696 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (filename_1 == 0) && (filename_4 == 0) [2024-01-29 22:56:29,696 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (filename_1 == 0) && (isNull_3 == (_Bool)0) [2024-01-29 22:56:29,696 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (filename_1 == 0) && (result_6 == 0) [2024-01-29 22:56:29,696 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (filename_1 == 0) && (isNull_0 == (_Bool)0) [2024-01-29 22:56:29,696 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] b <= -1 [2024-01-29 22:56:29,697 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] (b <= -1) && (b != 0) [2024-01-29 22:56:29,697 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] ((result_6 == 0) && (result_7 == 0)) && (filename_2 == (_Bool)0) [2024-01-29 22:56:29,697 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (((result_6 == 0) && (result_7 == 0)) && (filename_2 == (_Bool)0)) && (isNull_3 == (_Bool)0 || isNull_3 == (_Bool)1) [2024-01-29 22:56:29,697 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (((result_6 == 0) && (result_7 == 0)) && (filename_2 == (_Bool)0)) && (isNull_0 == (_Bool)0 || isNull_0 == (_Bool)1) [2024-01-29 22:56:29,697 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (((result_6 == 0) && (result_7 == 0)) && (filename_2 == (_Bool)0)) && (filename_5 == (_Bool)0) [2024-01-29 22:56:29,697 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (result_6 == 0) && (result_7 == 0) [2024-01-29 22:56:29,697 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] result_6 == 0 [2024-01-29 22:56:29,698 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (result_6 == 0) && (result_7 == 0) [2024-01-29 22:56:29,698 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((result_6 == 0) && (result_7 == 0)) && (isNull_0 == (_Bool)0 || isNull_0 == (_Bool)1) [2024-01-29 22:56:29,698 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((result_6 == 0) && (result_7 == 0)) && (filename_5 == (_Bool)0) [2024-01-29 22:56:29,698 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((result_6 == 0) && (result_7 == 0)) && (filename_2 == (_Bool)0 || filename_2 == (_Bool)1) [2024-01-29 22:56:29,699 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] result_6 == 0 [2024-01-29 22:56:29,699 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((result_6 == 0) && (result_7 == 0)) && (isNull_3 == (_Bool)0 || isNull_3 == (_Bool)1) [2024-01-29 22:56:29,700 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] (result_6 == 0) && (result_7 == 0) [2024-01-29 22:56:29,700 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] ((result_6 == 0) && (result_7 == 0)) && (isNull_3 == (_Bool)0) [2024-01-29 22:56:29,700 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] ((result_6 == 0) && (result_7 == 0)) && (filename_2 == (_Bool)0) [2024-01-29 22:56:29,700 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] ((result_6 == 0) && (result_7 == 0)) && (filename_5 == (_Bool)0) [2024-01-29 22:56:29,700 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] result_6 == 0 [2024-01-29 22:56:29,700 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] ((result_6 == 0) && (result_7 == 0)) && (isNull_0 == (_Bool)0) [2024-01-29 22:56:29,720 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:56:29,872 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-symm.wvr.c[2521,2534] [2024-01-29 22:56:29,878 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:56:29,890 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 22:56:29,898 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 22:56:29,900 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:56:29,949 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-symm.wvr.c[2521,2534] Start Parsing Local Start Parsing Local [2024-01-29 22:56:29,953 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:56:29,964 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:56:29,965 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:29 WrapperNode [2024-01-29 22:56:29,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:56:29,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:56:29,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:56:29,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:56:29,971 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 10:56:29" (1/1) ... [2024-01-29 22:56:29,978 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 10:56:29" (1/1) ... [2024-01-29 22:56:30,003 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 200 [2024-01-29 22:56:30,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:56:30,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:56:30,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:56:30,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:56:30,016 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 10:56:29" (1/1) ... [2024-01-29 22:56:30,016 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 10:56:29" (1/1) ... [2024-01-29 22:56:30,019 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 10:56:29" (1/1) ... [2024-01-29 22:56:30,031 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-01-29 22:56:30,032 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 10:56:29" (1/1) ... [2024-01-29 22:56:30,032 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 10:56:29" (1/1) ... [2024-01-29 22:56:30,040 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 10:56:29" (1/1) ... [2024-01-29 22:56:30,042 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 10:56:29" (1/1) ... [2024-01-29 22:56:30,043 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 10:56:29" (1/1) ... [2024-01-29 22:56:30,044 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 10:56:29" (1/1) ... [2024-01-29 22:56:30,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:56:30,066 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:56:30,066 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:56:30,067 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:56:30,067 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 10:56:29" (1/1) ... [2024-01-29 22:56:30,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:56:30,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:56:30,129 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 22:56:30,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 22:56:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:56:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 22:56:30,190 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 22:56:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 22:56:30,191 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 22:56:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:56:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:56:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:56:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:56:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:56:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:56:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:56:30,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:56:30,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:56:30,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 22:56:30,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 22:56:30,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 22:56:30,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:56:30,193 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 22:56:30,301 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:56:30,303 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:56:30,667 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:56:30,669 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:56:30,830 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:56:30,831 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 22:56:30,832 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:56:30 BoogieIcfgContainer [2024-01-29 22:56:30,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:56:30,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:56:30,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:56:30,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:56:30,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:56:29" (1/4) ... [2024-01-29 22:56:30,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c8c807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:56:30, skipping insertion in model container [2024-01-29 22:56:30,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:29" (2/4) ... [2024-01-29 22:56:30,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c8c807 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:56:30, skipping insertion in model container [2024-01-29 22:56:30,839 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 10:56:29" (3/4) ... [2024-01-29 22:56:30,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c8c807 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:56:30, skipping insertion in model container [2024-01-29 22:56:30,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:56:30" (4/4) ... [2024-01-29 22:56:30,841 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-symm.wvr.c [2024-01-29 22:56:30,854 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:56:30,854 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2024-01-29 22:56:30,854 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:56:30,936 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 22:56:30,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 141 transitions, 296 flow [2024-01-29 22:56:31,029 INFO L124 PetriNetUnfolderBase]: 8/139 cut-off events. [2024-01-29 22:56:31,030 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 22:56:31,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 139 events. 8/139 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 168 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2024-01-29 22:56:31,033 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 141 transitions, 296 flow [2024-01-29 22:56:31,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 138 transitions, 288 flow [2024-01-29 22:56:31,052 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:56:31,058 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;@3936afe3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:56:31,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-01-29 22:56:31,060 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:56:31,060 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:56:31,060 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:31,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:31,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:56:31,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 22:56:31,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:31,065 INFO L85 PathProgramCache]: Analyzing trace with hash 18184, now seen corresponding path program 1 times [2024-01-29 22:56:31,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:31,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382973793] [2024-01-29 22:56:31,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:31,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:31,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:31,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382973793] [2024-01-29 22:56:31,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382973793] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:31,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:31,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:31,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526737756] [2024-01-29 22:56:31,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:31,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:31,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:31,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:31,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:31,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 141 [2024-01-29 22:56:31,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 138 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:31,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:31,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 141 [2024-01-29 22:56:31,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:31,583 INFO L124 PetriNetUnfolderBase]: 246/571 cut-off events. [2024-01-29 22:56:31,587 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-01-29 22:56:31,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 571 events. 246/571 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3043 event pairs, 189 based on Foata normal form. 1/441 useless extension candidates. Maximal degree in co-relation 814. Up to 395 conditions per place. [2024-01-29 22:56:31,596 INFO L140 encePairwiseOnDemand]: 137/141 looper letters, 30 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2024-01-29 22:56:31,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 136 transitions, 348 flow [2024-01-29 22:56:31,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:31,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2024-01-29 22:56:31,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8321513002364066 [2024-01-29 22:56:31,613 INFO L175 Difference]: Start difference. First operand has 137 places, 138 transitions, 288 flow. Second operand 3 states and 352 transitions. [2024-01-29 22:56:31,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 136 transitions, 348 flow [2024-01-29 22:56:31,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 136 transitions, 340 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 22:56:31,620 INFO L231 Difference]: Finished difference. Result has 133 places, 136 transitions, 280 flow [2024-01-29 22:56:31,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=133, PETRI_TRANSITIONS=136} [2024-01-29 22:56:31,624 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -4 predicate places. [2024-01-29 22:56:31,624 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 136 transitions, 280 flow [2024-01-29 22:56:31,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:31,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:31,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 22:56:31,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:56:31,625 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 22:56:31,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:31,626 INFO L85 PathProgramCache]: Analyzing trace with hash 564281, now seen corresponding path program 1 times [2024-01-29 22:56:31,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:31,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310008568] [2024-01-29 22:56:31,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:31,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:31,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:31,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310008568] [2024-01-29 22:56:31,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310008568] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:31,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:31,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:31,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432134097] [2024-01-29 22:56:31,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:31,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:31,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:31,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:31,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:31,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 141 [2024-01-29 22:56:31,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 136 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:31,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:31,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 141 [2024-01-29 22:56:31,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:31,869 INFO L124 PetriNetUnfolderBase]: 246/570 cut-off events. [2024-01-29 22:56:31,870 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:56:31,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 570 events. 246/570 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3053 event pairs, 189 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 963. Up to 400 conditions per place. [2024-01-29 22:56:31,874 INFO L140 encePairwiseOnDemand]: 138/141 looper letters, 36 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2024-01-29 22:56:31,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 135 transitions, 354 flow [2024-01-29 22:56:31,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2024-01-29 22:56:31,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8014184397163121 [2024-01-29 22:56:31,877 INFO L175 Difference]: Start difference. First operand has 133 places, 136 transitions, 280 flow. Second operand 3 states and 339 transitions. [2024-01-29 22:56:31,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 135 transitions, 354 flow [2024-01-29 22:56:31,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 135 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:31,881 INFO L231 Difference]: Finished difference. Result has 132 places, 135 transitions, 278 flow [2024-01-29 22:56:31,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=132, PETRI_TRANSITIONS=135} [2024-01-29 22:56:31,882 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -5 predicate places. [2024-01-29 22:56:31,883 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 135 transitions, 278 flow [2024-01-29 22:56:31,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:31,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:31,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 22:56:31,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:56:31,883 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 22:56:31,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:31,884 INFO L85 PathProgramCache]: Analyzing trace with hash 17493257, now seen corresponding path program 1 times [2024-01-29 22:56:31,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:31,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058333700] [2024-01-29 22:56:31,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:31,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:31,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:31,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058333700] [2024-01-29 22:56:31,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058333700] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:31,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:31,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:31,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038132685] [2024-01-29 22:56:31,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:31,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:31,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:31,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:31,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:32,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 141 [2024-01-29 22:56:32,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 135 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:32,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:32,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 141 [2024-01-29 22:56:32,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:32,187 INFO L124 PetriNetUnfolderBase]: 246/569 cut-off events. [2024-01-29 22:56:32,187 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:56:32,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 569 events. 246/569 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3068 event pairs, 189 based on Foata normal form. 1/441 useless extension candidates. Maximal degree in co-relation 958. Up to 395 conditions per place. [2024-01-29 22:56:32,190 INFO L140 encePairwiseOnDemand]: 138/141 looper letters, 30 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2024-01-29 22:56:32,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 134 transitions, 340 flow [2024-01-29 22:56:32,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:32,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2024-01-29 22:56:32,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8297872340425532 [2024-01-29 22:56:32,191 INFO L175 Difference]: Start difference. First operand has 132 places, 135 transitions, 278 flow. Second operand 3 states and 351 transitions. [2024-01-29 22:56:32,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 134 transitions, 340 flow [2024-01-29 22:56:32,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 134 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:32,194 INFO L231 Difference]: Finished difference. Result has 131 places, 134 transitions, 276 flow [2024-01-29 22:56:32,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=131, PETRI_TRANSITIONS=134} [2024-01-29 22:56:32,194 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -6 predicate places. [2024-01-29 22:56:32,195 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 134 transitions, 276 flow [2024-01-29 22:56:32,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:32,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:32,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 22:56:32,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:56:32,195 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 22:56:32,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:32,196 INFO L85 PathProgramCache]: Analyzing trace with hash 542291517, now seen corresponding path program 1 times [2024-01-29 22:56:32,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:32,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870804995] [2024-01-29 22:56:32,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:32,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:32,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:32,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870804995] [2024-01-29 22:56:32,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870804995] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:32,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:32,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:32,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120951017] [2024-01-29 22:56:32,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:32,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:32,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:32,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:32,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:32,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 141 [2024-01-29 22:56:32,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 134 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:32,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:32,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 141 [2024-01-29 22:56:32,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:32,313 INFO L124 PetriNetUnfolderBase]: 246/568 cut-off events. [2024-01-29 22:56:32,313 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:56:32,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 568 events. 246/568 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3073 event pairs, 189 based on Foata normal form. 0/441 useless extension candidates. Maximal degree in co-relation 959. Up to 396 conditions per place. [2024-01-29 22:56:32,316 INFO L140 encePairwiseOnDemand]: 138/141 looper letters, 32 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2024-01-29 22:56:32,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 133 transitions, 342 flow [2024-01-29 22:56:32,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2024-01-29 22:56:32,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8203309692671394 [2024-01-29 22:56:32,317 INFO L175 Difference]: Start difference. First operand has 131 places, 134 transitions, 276 flow. Second operand 3 states and 347 transitions. [2024-01-29 22:56:32,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 133 transitions, 342 flow [2024-01-29 22:56:32,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 133 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:32,319 INFO L231 Difference]: Finished difference. Result has 130 places, 133 transitions, 274 flow [2024-01-29 22:56:32,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=130, PETRI_TRANSITIONS=133} [2024-01-29 22:56:32,320 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -7 predicate places. [2024-01-29 22:56:32,320 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 133 transitions, 274 flow [2024-01-29 22:56:32,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:32,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:32,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 22:56:32,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:56:32,321 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 22:56:32,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:32,322 INFO L85 PathProgramCache]: Analyzing trace with hash -368831574, now seen corresponding path program 1 times [2024-01-29 22:56:32,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:32,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69181921] [2024-01-29 22:56:32,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:32,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:32,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:32,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69181921] [2024-01-29 22:56:32,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69181921] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:32,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:32,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:32,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216684602] [2024-01-29 22:56:32,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:32,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:32,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:32,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:32,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:32,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 141 [2024-01-29 22:56:32,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 133 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:32,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:32,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 141 [2024-01-29 22:56:32,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:32,477 INFO L124 PetriNetUnfolderBase]: 246/567 cut-off events. [2024-01-29 22:56:32,477 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:56:32,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 567 events. 246/567 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3073 event pairs, 189 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 958. Up to 395 conditions per place. [2024-01-29 22:56:32,480 INFO L140 encePairwiseOnDemand]: 138/141 looper letters, 31 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2024-01-29 22:56:32,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 132 transitions, 338 flow [2024-01-29 22:56:32,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2024-01-29 22:56:32,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8250591016548463 [2024-01-29 22:56:32,481 INFO L175 Difference]: Start difference. First operand has 130 places, 133 transitions, 274 flow. Second operand 3 states and 349 transitions. [2024-01-29 22:56:32,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 132 transitions, 338 flow [2024-01-29 22:56:32,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 132 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:32,483 INFO L231 Difference]: Finished difference. Result has 129 places, 132 transitions, 272 flow [2024-01-29 22:56:32,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=129, PETRI_TRANSITIONS=132} [2024-01-29 22:56:32,484 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -8 predicate places. [2024-01-29 22:56:32,484 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 132 transitions, 272 flow [2024-01-29 22:56:32,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:32,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:32,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:32,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:56:32,485 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 22:56:32,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:32,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1451123667, now seen corresponding path program 1 times [2024-01-29 22:56:32,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:32,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57049449] [2024-01-29 22:56:32,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:32,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:32,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:32,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57049449] [2024-01-29 22:56:32,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57049449] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:32,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:32,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:32,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454102772] [2024-01-29 22:56:32,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:32,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:32,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:32,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:32,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:32,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 141 [2024-01-29 22:56:32,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 132 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:32,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:32,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 141 [2024-01-29 22:56:32,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:32,614 INFO L124 PetriNetUnfolderBase]: 246/566 cut-off events. [2024-01-29 22:56:32,614 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:56:32,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 566 events. 246/566 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3058 event pairs, 189 based on Foata normal form. 1/441 useless extension candidates. Maximal degree in co-relation 958. Up to 395 conditions per place. [2024-01-29 22:56:32,617 INFO L140 encePairwiseOnDemand]: 138/141 looper letters, 30 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2024-01-29 22:56:32,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 131 transitions, 334 flow [2024-01-29 22:56:32,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:32,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2024-01-29 22:56:32,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8297872340425532 [2024-01-29 22:56:32,618 INFO L175 Difference]: Start difference. First operand has 129 places, 132 transitions, 272 flow. Second operand 3 states and 351 transitions. [2024-01-29 22:56:32,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 131 transitions, 334 flow [2024-01-29 22:56:32,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 131 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:32,620 INFO L231 Difference]: Finished difference. Result has 128 places, 131 transitions, 270 flow [2024-01-29 22:56:32,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=128, PETRI_TRANSITIONS=131} [2024-01-29 22:56:32,621 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -9 predicate places. [2024-01-29 22:56:32,621 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 131 transitions, 270 flow [2024-01-29 22:56:32,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:32,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:32,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:32,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 22:56:32,622 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 22:56:32,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:32,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2035161315, now seen corresponding path program 1 times [2024-01-29 22:56:32,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:32,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040742325] [2024-01-29 22:56:32,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:32,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:32,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:32,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040742325] [2024-01-29 22:56:32,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040742325] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:32,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:32,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:32,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556187052] [2024-01-29 22:56:32,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:32,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:32,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:32,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:32,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:32,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 141 [2024-01-29 22:56:32,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 131 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:32,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:32,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 141 [2024-01-29 22:56:32,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:32,760 INFO L124 PetriNetUnfolderBase]: 246/565 cut-off events. [2024-01-29 22:56:32,760 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:56:32,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 565 events. 246/565 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3075 event pairs, 189 based on Foata normal form. 1/441 useless extension candidates. Maximal degree in co-relation 958. Up to 395 conditions per place. [2024-01-29 22:56:32,763 INFO L140 encePairwiseOnDemand]: 138/141 looper letters, 30 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2024-01-29 22:56:32,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 130 transitions, 332 flow [2024-01-29 22:56:32,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:32,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2024-01-29 22:56:32,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8297872340425532 [2024-01-29 22:56:32,764 INFO L175 Difference]: Start difference. First operand has 128 places, 131 transitions, 270 flow. Second operand 3 states and 351 transitions. [2024-01-29 22:56:32,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 130 transitions, 332 flow [2024-01-29 22:56:32,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 130 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:32,766 INFO L231 Difference]: Finished difference. Result has 127 places, 130 transitions, 268 flow [2024-01-29 22:56:32,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=127, PETRI_TRANSITIONS=130} [2024-01-29 22:56:32,767 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -10 predicate places. [2024-01-29 22:56:32,767 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 130 transitions, 268 flow [2024-01-29 22:56:32,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:32,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:32,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:32,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 22:56:32,768 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 22:56:32,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:32,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1579921797, now seen corresponding path program 1 times [2024-01-29 22:56:32,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:32,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031805304] [2024-01-29 22:56:32,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:32,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:32,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:32,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:32,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031805304] [2024-01-29 22:56:32,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031805304] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:32,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:32,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:56:32,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214951259] [2024-01-29 22:56:32,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:32,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:56:32,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:32,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:56:32,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:56:33,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 141 [2024-01-29 22:56:33,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 130 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:33,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:33,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 141 [2024-01-29 22:56:33,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:33,164 INFO L124 PetriNetUnfolderBase]: 460/947 cut-off events. [2024-01-29 22:56:33,164 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-29 22:56:33,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1628 conditions, 947 events. 460/947 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4785 event pairs, 327 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 1608. Up to 653 conditions per place. [2024-01-29 22:56:33,168 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 54 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2024-01-29 22:56:33,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 126 transitions, 372 flow [2024-01-29 22:56:33,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:33,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2024-01-29 22:56:33,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7092198581560284 [2024-01-29 22:56:33,170 INFO L175 Difference]: Start difference. First operand has 127 places, 130 transitions, 268 flow. Second operand 3 states and 300 transitions. [2024-01-29 22:56:33,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 126 transitions, 372 flow [2024-01-29 22:56:33,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 126 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:33,172 INFO L231 Difference]: Finished difference. Result has 123 places, 126 transitions, 260 flow [2024-01-29 22:56:33,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=123, PETRI_TRANSITIONS=126} [2024-01-29 22:56:33,173 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -14 predicate places. [2024-01-29 22:56:33,173 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 126 transitions, 260 flow [2024-01-29 22:56:33,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:33,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:33,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:33,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 22:56:33,174 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 22:56:33,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:33,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1732935999, now seen corresponding path program 1 times [2024-01-29 22:56:33,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:33,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335281778] [2024-01-29 22:56:33,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:33,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:33,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:33,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335281778] [2024-01-29 22:56:33,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335281778] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:33,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:33,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:33,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285654604] [2024-01-29 22:56:33,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:33,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:33,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:33,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:33,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:33,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 141 [2024-01-29 22:56:33,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 126 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:33,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:33,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 141 [2024-01-29 22:56:33,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:33,315 INFO L124 PetriNetUnfolderBase]: 246/560 cut-off events. [2024-01-29 22:56:33,315 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:56:33,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 560 events. 246/560 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3040 event pairs, 189 based on Foata normal form. 0/439 useless extension candidates. Maximal degree in co-relation 943. Up to 394 conditions per place. [2024-01-29 22:56:33,317 INFO L140 encePairwiseOnDemand]: 138/141 looper letters, 31 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2024-01-29 22:56:33,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 125 transitions, 324 flow [2024-01-29 22:56:33,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2024-01-29 22:56:33,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8250591016548463 [2024-01-29 22:56:33,319 INFO L175 Difference]: Start difference. First operand has 123 places, 126 transitions, 260 flow. Second operand 3 states and 349 transitions. [2024-01-29 22:56:33,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 125 transitions, 324 flow [2024-01-29 22:56:33,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 125 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:33,321 INFO L231 Difference]: Finished difference. Result has 122 places, 125 transitions, 258 flow [2024-01-29 22:56:33,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=122, PETRI_TRANSITIONS=125} [2024-01-29 22:56:33,321 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -15 predicate places. [2024-01-29 22:56:33,322 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 125 transitions, 258 flow [2024-01-29 22:56:33,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:33,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:33,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:33,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 22:56:33,323 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 22:56:33,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:33,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2113558214, now seen corresponding path program 1 times [2024-01-29 22:56:33,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:33,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032838508] [2024-01-29 22:56:33,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:33,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:33,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:33,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:33,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032838508] [2024-01-29 22:56:33,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032838508] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:33,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:33,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:33,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123586714] [2024-01-29 22:56:33,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:33,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:33,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:33,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:33,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:33,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 141 [2024-01-29 22:56:33,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 125 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:33,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:33,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 141 [2024-01-29 22:56:33,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:33,514 INFO L124 PetriNetUnfolderBase]: 246/559 cut-off events. [2024-01-29 22:56:33,514 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:56:33,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 559 events. 246/559 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3062 event pairs, 189 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 948. Up to 399 conditions per place. [2024-01-29 22:56:33,516 INFO L140 encePairwiseOnDemand]: 138/141 looper letters, 36 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2024-01-29 22:56:33,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 124 transitions, 332 flow [2024-01-29 22:56:33,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:33,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2024-01-29 22:56:33,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8014184397163121 [2024-01-29 22:56:33,525 INFO L175 Difference]: Start difference. First operand has 122 places, 125 transitions, 258 flow. Second operand 3 states and 339 transitions. [2024-01-29 22:56:33,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 124 transitions, 332 flow [2024-01-29 22:56:33,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 124 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:33,526 INFO L231 Difference]: Finished difference. Result has 121 places, 124 transitions, 256 flow [2024-01-29 22:56:33,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=121, PETRI_TRANSITIONS=124} [2024-01-29 22:56:33,528 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -16 predicate places. [2024-01-29 22:56:33,529 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 124 transitions, 256 flow [2024-01-29 22:56:33,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:33,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:33,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:33,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 22:56:33,530 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 22:56:33,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:33,530 INFO L85 PathProgramCache]: Analyzing trace with hash -791623809, now seen corresponding path program 1 times [2024-01-29 22:56:33,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:33,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834994442] [2024-01-29 22:56:33,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:33,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:33,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:33,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:33,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834994442] [2024-01-29 22:56:33,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834994442] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:33,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:33,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:56:33,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326003830] [2024-01-29 22:56:33,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:33,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:56:33,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:33,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:56:33,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:56:33,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 141 [2024-01-29 22:56:33,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 124 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 83.0) internal successors, (498), 6 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:33,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:33,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 141 [2024-01-29 22:56:33,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:33,972 INFO L124 PetriNetUnfolderBase]: 451/901 cut-off events. [2024-01-29 22:56:33,972 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-01-29 22:56:33,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 901 events. 451/901 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4479 event pairs, 327 based on Foata normal form. 0/683 useless extension candidates. Maximal degree in co-relation 1546. Up to 652 conditions per place. [2024-01-29 22:56:33,976 INFO L140 encePairwiseOnDemand]: 138/141 looper letters, 53 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2024-01-29 22:56:33,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 123 transitions, 364 flow [2024-01-29 22:56:33,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:33,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2024-01-29 22:56:33,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.706855791962175 [2024-01-29 22:56:33,977 INFO L175 Difference]: Start difference. First operand has 121 places, 124 transitions, 256 flow. Second operand 3 states and 299 transitions. [2024-01-29 22:56:33,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 123 transitions, 364 flow [2024-01-29 22:56:33,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 123 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:33,979 INFO L231 Difference]: Finished difference. Result has 120 places, 123 transitions, 254 flow [2024-01-29 22:56:33,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=120, PETRI_TRANSITIONS=123} [2024-01-29 22:56:33,979 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -17 predicate places. [2024-01-29 22:56:33,980 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 123 transitions, 254 flow [2024-01-29 22:56:33,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.0) internal successors, (498), 6 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:33,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:33,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:33,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 22:56:33,980 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 22:56:33,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:33,980 INFO L85 PathProgramCache]: Analyzing trace with hash -541247706, now seen corresponding path program 1 times [2024-01-29 22:56:33,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:33,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449929643] [2024-01-29 22:56:33,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:33,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:34,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:34,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449929643] [2024-01-29 22:56:34,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449929643] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:34,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:34,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:34,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45413509] [2024-01-29 22:56:34,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:34,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:34,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:34,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:34,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:34,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 141 [2024-01-29 22:56:34,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 123 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:34,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:34,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 141 [2024-01-29 22:56:34,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:34,292 INFO L124 PetriNetUnfolderBase]: 335/749 cut-off events. [2024-01-29 22:56:34,292 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:56:34,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 749 events. 335/749 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4017 event pairs, 67 based on Foata normal form. 5/649 useless extension candidates. Maximal degree in co-relation 1242. Up to 240 conditions per place. [2024-01-29 22:56:34,295 INFO L140 encePairwiseOnDemand]: 122/141 looper letters, 73 selfloop transitions, 8 changer transitions 0/139 dead transitions. [2024-01-29 22:56:34,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 139 transitions, 450 flow [2024-01-29 22:56:34,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 394 transitions. [2024-01-29 22:56:34,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6985815602836879 [2024-01-29 22:56:34,297 INFO L175 Difference]: Start difference. First operand has 120 places, 123 transitions, 254 flow. Second operand 4 states and 394 transitions. [2024-01-29 22:56:34,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 139 transitions, 450 flow [2024-01-29 22:56:34,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 139 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:34,299 INFO L231 Difference]: Finished difference. Result has 112 places, 118 transitions, 279 flow [2024-01-29 22:56:34,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=112, PETRI_TRANSITIONS=118} [2024-01-29 22:56:34,299 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -25 predicate places. [2024-01-29 22:56:34,299 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 118 transitions, 279 flow [2024-01-29 22:56:34,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:34,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:34,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:34,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 22:56:34,300 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 22:56:34,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:34,300 INFO L85 PathProgramCache]: Analyzing trace with hash -447984145, now seen corresponding path program 1 times [2024-01-29 22:56:34,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:34,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239631121] [2024-01-29 22:56:34,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:34,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:34,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:34,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239631121] [2024-01-29 22:56:34,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239631121] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:34,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:34,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:34,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141326094] [2024-01-29 22:56:34,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:34,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:34,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:34,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:34,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:34,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 141 [2024-01-29 22:56:34,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 118 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:34,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:34,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 141 [2024-01-29 22:56:34,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:34,548 INFO L124 PetriNetUnfolderBase]: 307/761 cut-off events. [2024-01-29 22:56:34,548 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2024-01-29 22:56:34,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1454 conditions, 761 events. 307/761 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4516 event pairs, 68 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 467. Up to 239 conditions per place. [2024-01-29 22:56:34,554 INFO L140 encePairwiseOnDemand]: 131/141 looper letters, 70 selfloop transitions, 10 changer transitions 0/142 dead transitions. [2024-01-29 22:56:34,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 142 transitions, 499 flow [2024-01-29 22:56:34,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:34,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 394 transitions. [2024-01-29 22:56:34,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6985815602836879 [2024-01-29 22:56:34,557 INFO L175 Difference]: Start difference. First operand has 112 places, 118 transitions, 279 flow. Second operand 4 states and 394 transitions. [2024-01-29 22:56:34,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 142 transitions, 499 flow [2024-01-29 22:56:34,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 142 transitions, 499 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-29 22:56:34,560 INFO L231 Difference]: Finished difference. Result has 115 places, 120 transitions, 330 flow [2024-01-29 22:56:34,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=115, PETRI_TRANSITIONS=120} [2024-01-29 22:56:34,562 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -22 predicate places. [2024-01-29 22:56:34,562 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 120 transitions, 330 flow [2024-01-29 22:56:34,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:34,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:34,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:34,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 22:56:34,563 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 22:56:34,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:34,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1002605989, now seen corresponding path program 1 times [2024-01-29 22:56:34,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:34,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672037217] [2024-01-29 22:56:34,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:34,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:34,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:34,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:34,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672037217] [2024-01-29 22:56:34,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672037217] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:34,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:34,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:34,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258501676] [2024-01-29 22:56:34,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:34,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:34,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:34,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:34,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:34,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 141 [2024-01-29 22:56:34,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 120 transitions, 330 flow. Second operand has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:34,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:34,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 141 [2024-01-29 22:56:34,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:34,829 INFO L124 PetriNetUnfolderBase]: 332/845 cut-off events. [2024-01-29 22:56:34,829 INFO L125 PetriNetUnfolderBase]: For 365/384 co-relation queries the response was YES. [2024-01-29 22:56:34,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 845 events. 332/845 cut-off events. For 365/384 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5331 event pairs, 63 based on Foata normal form. 5/727 useless extension candidates. Maximal degree in co-relation 755. Up to 275 conditions per place. [2024-01-29 22:56:34,833 INFO L140 encePairwiseOnDemand]: 131/141 looper letters, 72 selfloop transitions, 14 changer transitions 0/146 dead transitions. [2024-01-29 22:56:34,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 146 transitions, 592 flow [2024-01-29 22:56:34,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 391 transitions. [2024-01-29 22:56:34,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6932624113475178 [2024-01-29 22:56:34,835 INFO L175 Difference]: Start difference. First operand has 115 places, 120 transitions, 330 flow. Second operand 4 states and 391 transitions. [2024-01-29 22:56:34,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 146 transitions, 592 flow [2024-01-29 22:56:34,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 146 transitions, 581 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:34,840 INFO L231 Difference]: Finished difference. Result has 117 places, 124 transitions, 404 flow [2024-01-29 22:56:34,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=404, PETRI_PLACES=117, PETRI_TRANSITIONS=124} [2024-01-29 22:56:34,841 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -20 predicate places. [2024-01-29 22:56:34,841 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 124 transitions, 404 flow [2024-01-29 22:56:34,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:34,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:34,842 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] [2024-01-29 22:56:34,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 22:56:34,842 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 22:56:34,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:34,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1016013929, now seen corresponding path program 1 times [2024-01-29 22:56:34,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:34,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886056426] [2024-01-29 22:56:34,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:34,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:34,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:34,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886056426] [2024-01-29 22:56:34,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886056426] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:34,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:34,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:34,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665129146] [2024-01-29 22:56:34,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:34,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:34,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:34,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:34,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:34,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 141 [2024-01-29 22:56:34,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 124 transitions, 404 flow. Second operand has 4 states, 4 states have (on average 75.5) internal successors, (302), 4 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:34,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:34,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 141 [2024-01-29 22:56:34,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:35,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L44-22-->L46: Formula: (= v_~result_6~0_78 |v_thread1Thread1of1ForFork0_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_1|, thread1Thread1of1ForFork0_#t~ite2#1=|v_thread1Thread1of1ForFork0_#t~ite2#1_1|, ~result_6~0=v_~result_6~0_78, thread1Thread1of1ForFork0_#t~ite3#1=|v_thread1Thread1of1ForFork0_#t~ite3#1_1|, thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite4#1, thread1Thread1of1ForFork0_#t~ite5#1, ~result_6~0][121], [Black: 190#(and (= ~result_6~0 0) (= ~result_7~0 0)), 182#true, Black: 191#(and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 24#L46true, 194#true, 200#true, Black: 196#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 197#(and (= ~result_6~0 0) (= ~filename_2~0 (* 256 (div ~filename_2~0 256))) (= ~result_7~0 0)), Black: 185#(and (= ~result_6~0 0) (= ~result_7~0 0) (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 22#L52true, 50#L67-4true, Black: 184#(and (= ~result_6~0 0) (= ~result_7~0 0))]) [2024-01-29 22:56:35,102 INFO L294 olderBase$Statistics]: this new event has 61 ancestors and is cut-off event [2024-01-29 22:56:35,102 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2024-01-29 22:56:35,102 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2024-01-29 22:56:35,102 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2024-01-29 22:56:35,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L44-22-->L46: Formula: (= v_~result_6~0_78 |v_thread1Thread1of1ForFork0_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_1|, thread1Thread1of1ForFork0_#t~ite2#1=|v_thread1Thread1of1ForFork0_#t~ite2#1_1|, ~result_6~0=v_~result_6~0_78, thread1Thread1of1ForFork0_#t~ite3#1=|v_thread1Thread1of1ForFork0_#t~ite3#1_1|, thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite4#1, thread1Thread1of1ForFork0_#t~ite5#1, ~result_6~0][121], [Black: 190#(and (= ~result_6~0 0) (= ~result_7~0 0)), 182#true, Black: 191#(and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 24#L46true, 194#true, 200#true, Black: 196#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 197#(and (= ~result_6~0 0) (= ~filename_2~0 (* 256 (div ~filename_2~0 256))) (= ~result_7~0 0)), 7#thread2EXITtrue, Black: 185#(and (= ~result_6~0 0) (= ~result_7~0 0) (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 50#L67-4true, Black: 184#(and (= ~result_6~0 0) (= ~result_7~0 0))]) [2024-01-29 22:56:35,103 INFO L294 olderBase$Statistics]: this new event has 62 ancestors and is cut-off event [2024-01-29 22:56:35,103 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2024-01-29 22:56:35,103 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2024-01-29 22:56:35,103 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2024-01-29 22:56:35,103 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L44-22-->L46: Formula: (= v_~result_6~0_78 |v_thread1Thread1of1ForFork0_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_1|, thread1Thread1of1ForFork0_#t~ite2#1=|v_thread1Thread1of1ForFork0_#t~ite2#1_1|, ~result_6~0=v_~result_6~0_78, thread1Thread1of1ForFork0_#t~ite3#1=|v_thread1Thread1of1ForFork0_#t~ite3#1_1|, thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite4#1, thread1Thread1of1ForFork0_#t~ite5#1, ~result_6~0][142], [Black: 190#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 191#(and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 182#true, 24#L46true, 194#true, 200#true, Black: 196#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 197#(and (= ~result_6~0 0) (= ~filename_2~0 (* 256 (div ~filename_2~0 256))) (= ~result_7~0 0)), Black: 185#(and (= ~result_6~0 0) (= ~result_7~0 0) (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 50#L67-4true, Black: 184#(and (= ~result_6~0 0) (= ~result_7~0 0)), 117#L81true]) [2024-01-29 22:56:35,103 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2024-01-29 22:56:35,103 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2024-01-29 22:56:35,104 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2024-01-29 22:56:35,104 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2024-01-29 22:56:35,108 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L44-22-->L46: Formula: (= v_~result_6~0_78 |v_thread1Thread1of1ForFork0_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_1|, thread1Thread1of1ForFork0_#t~ite2#1=|v_thread1Thread1of1ForFork0_#t~ite2#1_1|, ~result_6~0=v_~result_6~0_78, thread1Thread1of1ForFork0_#t~ite3#1=|v_thread1Thread1of1ForFork0_#t~ite3#1_1|, thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite4#1, thread1Thread1of1ForFork0_#t~ite5#1, ~result_6~0][121], [Black: 190#(and (= ~result_6~0 0) (= ~result_7~0 0)), 182#true, Black: 191#(and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 24#L46true, 200#true, 194#true, Black: 196#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 197#(and (= ~result_6~0 0) (= ~filename_2~0 (* 256 (div ~filename_2~0 256))) (= ~result_7~0 0)), Black: 185#(and (= ~result_6~0 0) (= ~result_7~0 0) (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 22#L52true, 91#L68-1true, Black: 184#(and (= ~result_6~0 0) (= ~result_7~0 0))]) [2024-01-29 22:56:35,108 INFO L294 olderBase$Statistics]: this new event has 62 ancestors and is cut-off event [2024-01-29 22:56:35,108 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2024-01-29 22:56:35,108 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2024-01-29 22:56:35,108 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2024-01-29 22:56:35,108 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L44-22-->L46: Formula: (= v_~result_6~0_78 |v_thread1Thread1of1ForFork0_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_1|, thread1Thread1of1ForFork0_#t~ite2#1=|v_thread1Thread1of1ForFork0_#t~ite2#1_1|, ~result_6~0=v_~result_6~0_78, thread1Thread1of1ForFork0_#t~ite3#1=|v_thread1Thread1of1ForFork0_#t~ite3#1_1|, thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite4#1, thread1Thread1of1ForFork0_#t~ite5#1, ~result_6~0][121], [Black: 190#(and (= ~result_6~0 0) (= ~result_7~0 0)), 182#true, Black: 191#(and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 24#L46true, 200#true, 194#true, Black: 196#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 197#(and (= ~result_6~0 0) (= ~filename_2~0 (* 256 (div ~filename_2~0 256))) (= ~result_7~0 0)), 7#thread2EXITtrue, Black: 185#(and (= ~result_6~0 0) (= ~result_7~0 0) (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 91#L68-1true, Black: 184#(and (= ~result_6~0 0) (= ~result_7~0 0))]) [2024-01-29 22:56:35,108 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2024-01-29 22:56:35,109 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2024-01-29 22:56:35,109 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2024-01-29 22:56:35,109 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2024-01-29 22:56:35,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L44-22-->L46: Formula: (= v_~result_6~0_78 |v_thread1Thread1of1ForFork0_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_1|, thread1Thread1of1ForFork0_#t~ite2#1=|v_thread1Thread1of1ForFork0_#t~ite2#1_1|, ~result_6~0=v_~result_6~0_78, thread1Thread1of1ForFork0_#t~ite3#1=|v_thread1Thread1of1ForFork0_#t~ite3#1_1|, thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite4#1, thread1Thread1of1ForFork0_#t~ite5#1, ~result_6~0][142], [Black: 190#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 191#(and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 182#true, 24#L46true, 194#true, 200#true, Black: 196#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 197#(and (= ~result_6~0 0) (= ~filename_2~0 (* 256 (div ~filename_2~0 256))) (= ~result_7~0 0)), 91#L68-1true, Black: 185#(and (= ~result_6~0 0) (= ~result_7~0 0) (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 117#L81true, Black: 184#(and (= ~result_6~0 0) (= ~result_7~0 0))]) [2024-01-29 22:56:35,109 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2024-01-29 22:56:35,109 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2024-01-29 22:56:35,110 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2024-01-29 22:56:35,110 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2024-01-29 22:56:35,120 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L44-22-->L46: Formula: (= v_~result_6~0_78 |v_thread1Thread1of1ForFork0_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_1|, thread1Thread1of1ForFork0_#t~ite2#1=|v_thread1Thread1of1ForFork0_#t~ite2#1_1|, ~result_6~0=v_~result_6~0_78, thread1Thread1of1ForFork0_#t~ite3#1=|v_thread1Thread1of1ForFork0_#t~ite3#1_1|, thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite4#1, thread1Thread1of1ForFork0_#t~ite5#1, ~result_6~0][142], [Black: 190#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 191#(and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 182#true, 24#L46true, 194#true, 200#true, Black: 196#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 197#(and (= ~result_6~0 0) (= ~filename_2~0 (* 256 (div ~filename_2~0 256))) (= ~result_7~0 0)), 50#L67-4true, Black: 185#(and (= ~result_6~0 0) (= ~result_7~0 0) (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 19#L50-19true, Black: 184#(and (= ~result_6~0 0) (= ~result_7~0 0))]) [2024-01-29 22:56:35,120 INFO L294 olderBase$Statistics]: this new event has 65 ancestors and is cut-off event [2024-01-29 22:56:35,120 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2024-01-29 22:56:35,120 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2024-01-29 22:56:35,121 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2024-01-29 22:56:35,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L44-22-->L46: Formula: (= v_~result_6~0_78 |v_thread1Thread1of1ForFork0_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_1|, thread1Thread1of1ForFork0_#t~ite2#1=|v_thread1Thread1of1ForFork0_#t~ite2#1_1|, ~result_6~0=v_~result_6~0_78, thread1Thread1of1ForFork0_#t~ite3#1=|v_thread1Thread1of1ForFork0_#t~ite3#1_1|, thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite4#1, thread1Thread1of1ForFork0_#t~ite5#1, ~result_6~0][142], [Black: 190#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 191#(and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 182#true, 24#L46true, 194#true, 200#true, Black: 196#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 197#(and (= ~result_6~0 0) (= ~filename_2~0 (* 256 (div ~filename_2~0 256))) (= ~result_7~0 0)), 91#L68-1true, Black: 185#(and (= ~result_6~0 0) (= ~result_7~0 0) (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 19#L50-19true, Black: 184#(and (= ~result_6~0 0) (= ~result_7~0 0))]) [2024-01-29 22:56:35,123 INFO L294 olderBase$Statistics]: this new event has 66 ancestors and is cut-off event [2024-01-29 22:56:35,123 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-01-29 22:56:35,124 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2024-01-29 22:56:35,124 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2024-01-29 22:56:35,124 INFO L124 PetriNetUnfolderBase]: 415/1036 cut-off events. [2024-01-29 22:56:35,125 INFO L125 PetriNetUnfolderBase]: For 1050/1062 co-relation queries the response was YES. [2024-01-29 22:56:35,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2713 conditions, 1036 events. 415/1036 cut-off events. For 1050/1062 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6556 event pairs, 55 based on Foata normal form. 8/966 useless extension candidates. Maximal degree in co-relation 1129. Up to 343 conditions per place. [2024-01-29 22:56:35,131 INFO L140 encePairwiseOnDemand]: 131/141 looper letters, 76 selfloop transitions, 18 changer transitions 0/149 dead transitions. [2024-01-29 22:56:35,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 149 transitions, 694 flow [2024-01-29 22:56:35,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 378 transitions. [2024-01-29 22:56:35,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6702127659574468 [2024-01-29 22:56:35,133 INFO L175 Difference]: Start difference. First operand has 117 places, 124 transitions, 404 flow. Second operand 4 states and 378 transitions. [2024-01-29 22:56:35,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 149 transitions, 694 flow [2024-01-29 22:56:35,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 149 transitions, 679 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:35,136 INFO L231 Difference]: Finished difference. Result has 119 places, 128 transitions, 494 flow [2024-01-29 22:56:35,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=494, PETRI_PLACES=119, PETRI_TRANSITIONS=128} [2024-01-29 22:56:35,139 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -18 predicate places. [2024-01-29 22:56:35,139 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 128 transitions, 494 flow [2024-01-29 22:56:35,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 4 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:35,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:35,139 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] [2024-01-29 22:56:35,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 22:56:35,140 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 22:56:35,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:35,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1431788753, now seen corresponding path program 1 times [2024-01-29 22:56:35,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:35,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239399347] [2024-01-29 22:56:35,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:35,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:35,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:35,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239399347] [2024-01-29 22:56:35,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239399347] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:35,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:35,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:35,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72282081] [2024-01-29 22:56:35,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:35,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:56:35,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:35,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:56:35,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:56:35,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 141 [2024-01-29 22:56:35,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 128 transitions, 494 flow. Second operand has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:35,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:35,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 141 [2024-01-29 22:56:35,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:35,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L44-22-->L46: Formula: (= v_~result_6~0_78 |v_thread1Thread1of1ForFork0_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_1|, thread1Thread1of1ForFork0_#t~ite2#1=|v_thread1Thread1of1ForFork0_#t~ite2#1_1|, ~result_6~0=v_~result_6~0_78, thread1Thread1of1ForFork0_#t~ite3#1=|v_thread1Thread1of1ForFork0_#t~ite3#1_1|, thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite4#1, thread1Thread1of1ForFork0_#t~ite5#1, ~result_6~0][146], [Black: 190#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 191#(and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 24#L46true, Black: 196#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 197#(and (= ~result_6~0 0) (= ~filename_2~0 (* 256 (div ~filename_2~0 256))) (= ~result_7~0 0)), 50#L67-4true, 117#L81true, Black: 202#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 203#(and (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 182#true, 200#true, Black: 185#(and (= ~result_6~0 0) (= ~result_7~0 0) (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 206#true, Black: 184#(and (= ~result_6~0 0) (= ~result_7~0 0))]) [2024-01-29 22:56:35,487 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2024-01-29 22:56:35,487 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2024-01-29 22:56:35,487 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2024-01-29 22:56:35,487 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2024-01-29 22:56:35,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L44-22-->L46: Formula: (= v_~result_6~0_78 |v_thread1Thread1of1ForFork0_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_1|, thread1Thread1of1ForFork0_#t~ite2#1=|v_thread1Thread1of1ForFork0_#t~ite2#1_1|, ~result_6~0=v_~result_6~0_78, thread1Thread1of1ForFork0_#t~ite3#1=|v_thread1Thread1of1ForFork0_#t~ite3#1_1|, thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite4#1, thread1Thread1of1ForFork0_#t~ite5#1, ~result_6~0][146], [Black: 190#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 191#(and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 24#L46true, Black: 196#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 197#(and (= ~result_6~0 0) (= ~filename_2~0 (* 256 (div ~filename_2~0 256))) (= ~result_7~0 0)), 91#L68-1true, 117#L81true, Black: 202#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 203#(and (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 182#true, 200#true, Black: 185#(and (= ~result_6~0 0) (= ~result_7~0 0) (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 206#true, Black: 184#(and (= ~result_6~0 0) (= ~result_7~0 0))]) [2024-01-29 22:56:35,494 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2024-01-29 22:56:35,494 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2024-01-29 22:56:35,494 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2024-01-29 22:56:35,494 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2024-01-29 22:56:35,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L44-22-->L46: Formula: (= v_~result_6~0_78 |v_thread1Thread1of1ForFork0_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_1|, thread1Thread1of1ForFork0_#t~ite2#1=|v_thread1Thread1of1ForFork0_#t~ite2#1_1|, ~result_6~0=v_~result_6~0_78, thread1Thread1of1ForFork0_#t~ite3#1=|v_thread1Thread1of1ForFork0_#t~ite3#1_1|, thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite4#1, thread1Thread1of1ForFork0_#t~ite5#1, ~result_6~0][146], [Black: 190#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 191#(and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 24#L46true, Black: 196#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 197#(and (= ~result_6~0 0) (= ~filename_2~0 (* 256 (div ~filename_2~0 256))) (= ~result_7~0 0)), 50#L67-4true, Black: 202#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 203#(and (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 182#true, 200#true, Black: 185#(and (= ~result_6~0 0) (= ~result_7~0 0) (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 206#true, Black: 184#(and (= ~result_6~0 0) (= ~result_7~0 0)), 19#L50-19true]) [2024-01-29 22:56:35,502 INFO L294 olderBase$Statistics]: this new event has 65 ancestors and is cut-off event [2024-01-29 22:56:35,502 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2024-01-29 22:56:35,502 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2024-01-29 22:56:35,502 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2024-01-29 22:56:35,506 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L44-22-->L46: Formula: (= v_~result_6~0_78 |v_thread1Thread1of1ForFork0_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_1|, thread1Thread1of1ForFork0_#t~ite2#1=|v_thread1Thread1of1ForFork0_#t~ite2#1_1|, ~result_6~0=v_~result_6~0_78, thread1Thread1of1ForFork0_#t~ite3#1=|v_thread1Thread1of1ForFork0_#t~ite3#1_1|, thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite4#1, thread1Thread1of1ForFork0_#t~ite5#1, ~result_6~0][146], [Black: 190#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 191#(and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 24#L46true, Black: 196#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 197#(and (= ~result_6~0 0) (= ~filename_2~0 (* 256 (div ~filename_2~0 256))) (= ~result_7~0 0)), 91#L68-1true, Black: 202#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 203#(and (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 182#true, 200#true, Black: 185#(and (= ~result_6~0 0) (= ~result_7~0 0) (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 206#true, Black: 184#(and (= ~result_6~0 0) (= ~result_7~0 0)), 19#L50-19true]) [2024-01-29 22:56:35,506 INFO L294 olderBase$Statistics]: this new event has 66 ancestors and is cut-off event [2024-01-29 22:56:35,506 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2024-01-29 22:56:35,506 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-01-29 22:56:35,506 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2024-01-29 22:56:35,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L44-22-->L46: Formula: (= v_~result_6~0_78 |v_thread1Thread1of1ForFork0_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_1|, thread1Thread1of1ForFork0_#t~ite2#1=|v_thread1Thread1of1ForFork0_#t~ite2#1_1|, ~result_6~0=v_~result_6~0_78, thread1Thread1of1ForFork0_#t~ite3#1=|v_thread1Thread1of1ForFork0_#t~ite3#1_1|, thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite4#1, thread1Thread1of1ForFork0_#t~ite5#1, ~result_6~0][153], [Black: 190#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 191#(and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 24#L46true, Black: 196#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 197#(and (= ~result_6~0 0) (= ~filename_2~0 (* 256 (div ~filename_2~0 256))) (= ~result_7~0 0)), 50#L67-4true, Black: 202#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 203#(and (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 182#true, 200#true, 22#L52true, 206#true, Black: 185#(and (= ~result_6~0 0) (= ~result_7~0 0) (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), Black: 184#(and (= ~result_6~0 0) (= ~result_7~0 0))]) [2024-01-29 22:56:35,508 INFO L294 olderBase$Statistics]: this new event has 65 ancestors and is cut-off event [2024-01-29 22:56:35,508 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2024-01-29 22:56:35,508 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2024-01-29 22:56:35,508 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2024-01-29 22:56:35,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L44-22-->L46: Formula: (= v_~result_6~0_78 |v_thread1Thread1of1ForFork0_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_1|, thread1Thread1of1ForFork0_#t~ite2#1=|v_thread1Thread1of1ForFork0_#t~ite2#1_1|, ~result_6~0=v_~result_6~0_78, thread1Thread1of1ForFork0_#t~ite3#1=|v_thread1Thread1of1ForFork0_#t~ite3#1_1|, thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite4#1, thread1Thread1of1ForFork0_#t~ite5#1, ~result_6~0][153], [Black: 190#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 191#(and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 24#L46true, Black: 196#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 197#(and (= ~result_6~0 0) (= ~filename_2~0 (* 256 (div ~filename_2~0 256))) (= ~result_7~0 0)), 91#L68-1true, Black: 202#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 203#(and (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 182#true, 200#true, Black: 185#(and (= ~result_6~0 0) (= ~result_7~0 0) (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 22#L52true, 206#true, Black: 184#(and (= ~result_6~0 0) (= ~result_7~0 0))]) [2024-01-29 22:56:35,532 INFO L294 olderBase$Statistics]: this new event has 66 ancestors and is cut-off event [2024-01-29 22:56:35,532 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-01-29 22:56:35,532 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-01-29 22:56:35,533 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2024-01-29 22:56:35,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L44-22-->L46: Formula: (= v_~result_6~0_78 |v_thread1Thread1of1ForFork0_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_1|, thread1Thread1of1ForFork0_#t~ite2#1=|v_thread1Thread1of1ForFork0_#t~ite2#1_1|, ~result_6~0=v_~result_6~0_78, thread1Thread1of1ForFork0_#t~ite3#1=|v_thread1Thread1of1ForFork0_#t~ite3#1_1|, thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite4#1, thread1Thread1of1ForFork0_#t~ite5#1, ~result_6~0][153], [Black: 190#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 191#(and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 24#L46true, Black: 196#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 197#(and (= ~result_6~0 0) (= ~filename_2~0 (* 256 (div ~filename_2~0 256))) (= ~result_7~0 0)), 50#L67-4true, Black: 202#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 203#(and (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 182#true, 200#true, 7#thread2EXITtrue, 206#true, Black: 185#(and (= ~result_6~0 0) (= ~result_7~0 0) (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), Black: 184#(and (= ~result_6~0 0) (= ~result_7~0 0))]) [2024-01-29 22:56:35,534 INFO L294 olderBase$Statistics]: this new event has 66 ancestors and is cut-off event [2024-01-29 22:56:35,534 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2024-01-29 22:56:35,534 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-01-29 22:56:35,534 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-01-29 22:56:35,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L44-22-->L46: Formula: (= v_~result_6~0_78 |v_thread1Thread1of1ForFork0_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_1|, thread1Thread1of1ForFork0_#t~ite2#1=|v_thread1Thread1of1ForFork0_#t~ite2#1_1|, ~result_6~0=v_~result_6~0_78, thread1Thread1of1ForFork0_#t~ite3#1=|v_thread1Thread1of1ForFork0_#t~ite3#1_1|, thread1Thread1of1ForFork0_#t~ite4#1=|v_thread1Thread1of1ForFork0_#t~ite4#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_#t~ite2#1, thread1Thread1of1ForFork0_#t~ite3#1, thread1Thread1of1ForFork0_#t~ite4#1, thread1Thread1of1ForFork0_#t~ite5#1, ~result_6~0][153], [Black: 190#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 191#(and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 24#L46true, Black: 196#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 197#(and (= ~result_6~0 0) (= ~filename_2~0 (* 256 (div ~filename_2~0 256))) (= ~result_7~0 0)), 91#L68-1true, Black: 202#(and (= ~result_6~0 0) (= ~result_7~0 0)), Black: 203#(and (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_6~0 0) (= ~result_7~0 0)), 182#true, 200#true, 7#thread2EXITtrue, 206#true, Black: 185#(and (= ~result_6~0 0) (= ~result_7~0 0) (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), Black: 184#(and (= ~result_6~0 0) (= ~result_7~0 0))]) [2024-01-29 22:56:35,535 INFO L294 olderBase$Statistics]: this new event has 67 ancestors and is cut-off event [2024-01-29 22:56:35,535 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2024-01-29 22:56:35,535 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2024-01-29 22:56:35,535 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2024-01-29 22:56:35,535 INFO L124 PetriNetUnfolderBase]: 485/1187 cut-off events. [2024-01-29 22:56:35,535 INFO L125 PetriNetUnfolderBase]: For 1675/1696 co-relation queries the response was YES. [2024-01-29 22:56:35,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3285 conditions, 1187 events. 485/1187 cut-off events. For 1675/1696 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7649 event pairs, 81 based on Foata normal form. 14/1144 useless extension candidates. Maximal degree in co-relation 1351. Up to 273 conditions per place. [2024-01-29 22:56:35,540 INFO L140 encePairwiseOnDemand]: 131/141 looper letters, 96 selfloop transitions, 18 changer transitions 0/156 dead transitions. [2024-01-29 22:56:35,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 156 transitions, 813 flow [2024-01-29 22:56:35,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:56:35,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:56:35,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2024-01-29 22:56:35,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6226950354609929 [2024-01-29 22:56:35,542 INFO L175 Difference]: Start difference. First operand has 119 places, 128 transitions, 494 flow. Second operand 5 states and 439 transitions. [2024-01-29 22:56:35,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 156 transitions, 813 flow [2024-01-29 22:56:35,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 156 transitions, 798 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:35,546 INFO L231 Difference]: Finished difference. Result has 124 places, 131 transitions, 564 flow [2024-01-29 22:56:35,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=564, PETRI_PLACES=124, PETRI_TRANSITIONS=131} [2024-01-29 22:56:35,547 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, -13 predicate places. [2024-01-29 22:56:35,547 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 131 transitions, 564 flow [2024-01-29 22:56:35,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:35,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:35,548 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] [2024-01-29 22:56:35,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 22:56:35,548 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 57 more)] === [2024-01-29 22:56:35,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:35,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1435777727, now seen corresponding path program 1 times [2024-01-29 22:56:35,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:35,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000720441] [2024-01-29 22:56:35,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:35,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:56:35,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 22:56:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:56:35,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 22:56:35,584 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 22:56:35,585 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 60 remaining) [2024-01-29 22:56:35,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 60 remaining) [2024-01-29 22:56:35,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 60 remaining) [2024-01-29 22:56:35,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 60 remaining) [2024-01-29 22:56:35,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 60 remaining) [2024-01-29 22:56:35,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 60 remaining) [2024-01-29 22:56:35,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 60 remaining) [2024-01-29 22:56:35,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 60 remaining) [2024-01-29 22:56:35,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 60 remaining) [2024-01-29 22:56:35,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 60 remaining) [2024-01-29 22:56:35,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 60 remaining) [2024-01-29 22:56:35,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 60 remaining) [2024-01-29 22:56:35,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 60 remaining) [2024-01-29 22:56:35,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 60 remaining) [2024-01-29 22:56:35,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 60 remaining) [2024-01-29 22:56:35,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 60 remaining) [2024-01-29 22:56:35,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 60 remaining) [2024-01-29 22:56:35,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 60 remaining) [2024-01-29 22:56:35,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 60 remaining) [2024-01-29 22:56:35,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 60 remaining) [2024-01-29 22:56:35,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 60 remaining) [2024-01-29 22:56:35,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 60 remaining) [2024-01-29 22:56:35,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 60 remaining) [2024-01-29 22:56:35,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 60 remaining) [2024-01-29 22:56:35,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 60 remaining) [2024-01-29 22:56:35,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 60 remaining) [2024-01-29 22:56:35,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 60 remaining) [2024-01-29 22:56:35,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 60 remaining) [2024-01-29 22:56:35,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 60 remaining) [2024-01-29 22:56:35,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 60 remaining) [2024-01-29 22:56:35,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 60 remaining) [2024-01-29 22:56:35,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 60 remaining) [2024-01-29 22:56:35,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 60 remaining) [2024-01-29 22:56:35,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 60 remaining) [2024-01-29 22:56:35,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 60 remaining) [2024-01-29 22:56:35,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 60 remaining) [2024-01-29 22:56:35,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 60 remaining) [2024-01-29 22:56:35,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 60 remaining) [2024-01-29 22:56:35,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 60 remaining) [2024-01-29 22:56:35,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 60 remaining) [2024-01-29 22:56:35,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 60 remaining) [2024-01-29 22:56:35,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 60 remaining) [2024-01-29 22:56:35,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 60 remaining) [2024-01-29 22:56:35,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 60 remaining) [2024-01-29 22:56:35,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 60 remaining) [2024-01-29 22:56:35,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 60 remaining) [2024-01-29 22:56:35,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 60 remaining) [2024-01-29 22:56:35,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 60 remaining) [2024-01-29 22:56:35,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 60 remaining) [2024-01-29 22:56:35,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 60 remaining) [2024-01-29 22:56:35,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 60 remaining) [2024-01-29 22:56:35,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION (8 of 60 remaining) [2024-01-29 22:56:35,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 60 remaining) [2024-01-29 22:56:35,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 60 remaining) [2024-01-29 22:56:35,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 60 remaining) [2024-01-29 22:56:35,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 60 remaining) [2024-01-29 22:56:35,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 60 remaining) [2024-01-29 22:56:35,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 60 remaining) [2024-01-29 22:56:35,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 60 remaining) [2024-01-29 22:56:35,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 60 remaining) [2024-01-29 22:56:35,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 22:56:35,595 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:35,600 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 22:56:35,600 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 22:56:35,644 INFO L503 ceAbstractionStarter]: Automizer considered 51 witness invariants [2024-01-29 22:56:35,644 INFO L504 ceAbstractionStarter]: WitnessConsidered=51 [2024-01-29 22:56:35,646 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:56:35 BasicIcfg [2024-01-29 22:56:35,646 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 22:56:35,647 INFO L158 Benchmark]: Toolchain (without parser) took 5986.26ms. Allocated memory was 146.8MB in the beginning and 251.7MB in the end (delta: 104.9MB). Free memory was 69.0MB in the beginning and 192.8MB in the end (delta: -123.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:56:35,647 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 96.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:56:35,647 INFO L158 Benchmark]: Witness Parser took 0.20ms. Allocated memory is still 146.8MB. Free memory was 73.6MB in the beginning and 73.4MB in the end (delta: 202.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:56:35,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.68ms. Allocated memory was 146.8MB in the beginning and 205.5MB in the end (delta: 58.7MB). Free memory was 68.8MB in the beginning and 169.9MB in the end (delta: -101.1MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-01-29 22:56:35,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.14ms. Allocated memory is still 205.5MB. Free memory was 169.9MB in the beginning and 167.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 22:56:35,648 INFO L158 Benchmark]: Boogie Preprocessor took 58.46ms. Allocated memory is still 205.5MB. Free memory was 167.8MB in the beginning and 164.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 22:56:35,648 INFO L158 Benchmark]: RCFGBuilder took 766.08ms. Allocated memory is still 205.5MB. Free memory was 164.7MB in the beginning and 112.3MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-01-29 22:56:35,649 INFO L158 Benchmark]: TraceAbstraction took 4810.91ms. Allocated memory was 205.5MB in the beginning and 251.7MB in the end (delta: 46.1MB). Free memory was 111.2MB in the beginning and 192.8MB in the end (delta: -81.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:56:35,650 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 96.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.20ms. Allocated memory is still 146.8MB. Free memory was 73.6MB in the beginning and 73.4MB in the end (delta: 202.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.68ms. Allocated memory was 146.8MB in the beginning and 205.5MB in the end (delta: 58.7MB). Free memory was 68.8MB in the beginning and 169.9MB in the end (delta: -101.1MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.14ms. Allocated memory is still 205.5MB. Free memory was 169.9MB in the beginning and 167.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.46ms. Allocated memory is still 205.5MB. Free memory was 167.8MB in the beginning and 164.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 766.08ms. Allocated memory is still 205.5MB. Free memory was 164.7MB in the beginning and 112.3MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4810.91ms. Allocated memory was 205.5MB in the beginning and 251.7MB in the end (delta: 46.1MB). Free memory was 111.2MB in the beginning and 192.8MB in the end (delta: -81.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 61]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] int filename_1, filename_4, result_6, result_7; [L39] _Bool isNull_0, isNull_3, filename_2, filename_5; [L56] pthread_t t1, t2; VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L58] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[filename_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[isNull_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L58] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[filename_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L58] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[filename_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[isNull_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L58] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[filename_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[filename_4],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L58] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[filename_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L58] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[filename_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[filename_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L58] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[filename_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[filename_2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L58] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_1],IntegerLiteral[0]]]] [L58] filename_1 = __VERIFIER_nondet_int() [L59] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[filename_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[isNull_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]],BinaryExpression[COMPEQ,IdentifierExpression[isNull_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]],BinaryExpression[COMPEQ,IdentifierExpression[filename_2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L59] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[filename_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L59] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[filename_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L59] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_4],IntegerLiteral[0]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L59] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[filename_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[isNull_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L59] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[filename_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[isNull_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]],BinaryExpression[COMPEQ,IdentifierExpression[isNull_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]],BinaryExpression[COMPEQ,IdentifierExpression[filename_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L59] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[filename_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[isNull_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]],BinaryExpression[COMPEQ,IdentifierExpression[isNull_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] [L59] filename_4 = __VERIFIER_nondet_int() [L60] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[isNull_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L60] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L60] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[filename_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L60] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[filename_2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L60] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[isNull_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L60] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] [L60] isNull_0 = __VERIFIER_nondet_bool() [L61] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[isNull_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]],BinaryExpression[COMPEQ,IdentifierExpression[filename_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] [L61] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[isNull_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[isNull_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[isNull_0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] VAL [filename_1=0, filename_2=0, filename_4=0, filename_5=0, isNull_0=2, isNull_3=0, result_6=0, result_7=0, t1={5:0}, t2={3:0}] - UnprovableResult [Line: 46]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 168 locations, 60 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3027 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1447 mSDsluCounter, 684 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 209 mSDsCounter, 260 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3555 IncrementalHoareTripleChecker+Invalid, 3815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 260 mSolverCounterUnsat, 475 mSDtfsCounter, 3555 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=564occurred in iteration=16, InterpolantAutomatonStates: 54, 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.6s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 2023 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 22:56:35,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE